Selective partial update and set-membership subband adaptive filters

This paper presents three efficient subband adaptive filter (SAF) algorithms featuring low computational complexity. In the first algorithm, which is called selective partial update SAF (SPU-SAF), the filter coefficients are partially updated in each subband rather than the entire filter at every ad...

Full description

Saved in:
Bibliographic Details
Published in:Signal processing 2008-10, Vol.88 (10), p.2463-2471
Main Authors: Abadi, Mohammad Shams Esfand, Husøy, John Håkon
Format: Article
Language:English
Subjects:
Applied sciences
Computational complexity
Detection, estimation, filtering, equalization, prediction
Exact sciences and technology
Information, signal and communications theory
Miscellaneous
Selective partial update
Set-membership
Signal and communications theory
Signal processing
Signal, noise
Subband adaptive filter
Telecommunications and information theory
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper presents three efficient subband adaptive filter (SAF) algorithms featuring low computational complexity. In the first algorithm, which is called selective partial update SAF (SPU-SAF), the filter coefficients are partially updated in each subband rather than the entire filter at every adaptation. In the second one, the concept of set-membership (SM) adaptive filtering is extended to the SAFs and a novel SM-SAF algorithm is presented. This algorithm exhibits superior performance with significant reduction in the overall computational complexity compared with the ordinary SAF. The third algorithm is based on the combination of the ideas in the SPU-SAF and SM-SAF algorithms. We demonstrate the usefulness of the proposed algorithms through simulations.
ISSN:0165-1684
1872-7557
DOI:10.1016/j.sigpro.2008.04.014