Electrical and Computer Engineering
2332 Main Mall
Vancouver,
BC
Canada
V6T 1Z4
Tel +1.604.822.2872
Fax +1.604.822.5949
Email:
info@ece.ubc.ca
| Title | A fast weighted subband adaptive algorithm |
| Publication Type | Conference Paper |
| Year of Publication | 1999 |
| Authors | Mayyas, K., and T. Aboulnasr |
| Conference Name | Acoustics, Speech, and Signal Processing, 1999. ICASSP '99. Proceedings., 1999 IEEE International Conference on |
| Pagination | 1249 -1252 vol.3 |
| Date Published | mar. |
| Keywords | adaptive filters, adaptive signal processing, block algorithm, computational complexity, covariance matrix, fast affine projection algorithm, fast weighted subband adaptive algorithm, filtering theory, low complexity implementation, NLMS algorithm, sample-by-sample version, variable step size version |
| Abstract | The block algorithm has illustrated significant improvement in performance over the NLMS algorithm. However, it is known that block processing algorithms have lower tracking capabilities than their sample-by-sample counterparts. The fast affine projection (FAP) algorithm also outperforms the NLMS with a slight increase in complexity, but involves the fast calculation of the inverse of a covariance matrix of the input data that could undermine the performance of the algorithm. In this paper, we present a sample-by-sample version of the block algorithm and develop a low complexity implementation of this algorithm using a similar approach to the FAP algorithm. The new fast algorithm does not require matrix inversion thus alleviating the drawbacks of the FAP algorithm. A variable step size version of the proposed algorithm is also presented |
| URL | http://dx.doi.org/10.1109/ICASSP.1999.756205 |
| DOI | 10.1109/ICASSP.1999.756205 |