Please use this identifier to cite or link to this item:
https://doi.org/10.1109/82.401172
| Title: | Order of N complexity transform domain adaptive filters | Authors: | Farhang-Boroujeny, B. | Issue Date: | Jul-1995 | Citation: | Farhang-Boroujeny, B. (1995-07). Order of N complexity transform domain adaptive filters. IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing 42 (7) : 478-480. ScholarBank@NUS Repository. https://doi.org/10.1109/82.401172 | 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. This is opposed to most of the previous reports that assume order of N log N complexity for such implementation. In this correspondence, a generalization of the sliding FFT, which introduces a wide class of orthogonal transforms that can be implemented with the order of N complexity is proposed. | Source Title: | IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing | URI: | http://scholarbank.nus.edu.sg/handle/10635/62569 | ISSN: | 10577130 | DOI: | 10.1109/82.401172 |
| Appears in Collections: | Staff Publications |
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.