Abstract
We present a novel normalized subband adaptive filter (NSAF) which dynamically selects subband filters in order to reduce computational complexity while maintaining convergence performance of conventional NSAF. The selection operation is performed to achieve the largest decrease between the successive mean square deviations at every iteration. As a result, an efficient and competent NSAF algorithm is derived. The experimental results show that the proposed NSAF algorithm gains an advantage over the conventional NSAF in that it leads to a similar convergence performance with a substantial saving of overall computational burden.
Original language | English |
---|---|
Pages (from-to) | 245-248 |
Number of pages | 4 |
Journal | IEEE Signal Processing Letters |
Volume | 17 |
Issue number | 3 |
DOIs | |
State | Published - 2010 |
Keywords
- Adaptive filters
- Dynamic selection of subband filters
- Subband adaptive filter (SAF)