Please use this identifier to cite or link to this item:
|Title:||Order of N complexity transform domain adaptive filters|
|Citation:||Farhang-Boroujeny, B. (1994). Order of N complexity transform domain adaptive filters. Proceedings - IEEE International Symposium on Circuits and Systems 2 : 37-40. ScholarBank@NUS Repository.|
|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.|
|Source Title:||Proceedings - IEEE International Symposium on Circuits and Systems|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Nov 3, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.