Order of N complexity transform domain adaptive filters
- 17 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, 37-40
- https://doi.org/10.1109/iscas.1994.408899
Abstract
Implementation of the transform domain adaptive filters is addressed. Recent results have shown that if the input data to a radix-2 fast Fourier transform (FFT) structure is sliding one sample at a time, only N-1 butterflies need to be calculated for updating the FFT structure, after the arrival of every new data sample. This is opposed to most of the previous reports that, assume order of N log N complexity, for such implementation. In this paper the sliding implementation of the other useful transforms, that can also be implemented with the order of N complexity, are worked out in detail.Keywords
This publication has 9 references indexed in Scilit:
- Generalized sliding FFT and its application to implementation of block LMS adaptive filtersIEEE Transactions on Signal Processing, 1994
- A comment on the computational complexity of sliding FFTIEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, 1992
- Fast filter bank (FFB)IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, 1992
- Quantization effects in transform-domain normalized LMS algorithmIEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, 1992
- Kronecker Products, Unitary Matrices and Signal Processing ApplicationsSIAM Review, 1989
- The use of orthogonal transforms for improving performance of adaptive filtersIEEE Transactions on Circuits and Systems, 1989
- Running DHT and real-time dht analyserElectronics Letters, 1988
- Performance of transform-domain LMS adaptive digital filtersIEEE Transactions on Acoustics, Speech, and Signal Processing, 1986
- Transform domain LMS algorithmIEEE Transactions on Acoustics, Speech, and Signal Processing, 1983