Please use this identifier to cite or link to this item: https://doi.org/10.1109/82.401172
DC FieldValue
dc.titleOrder of N complexity transform domain adaptive filters
dc.contributor.authorFarhang-Boroujeny, B.
dc.date.accessioned2014-06-17T06:52:30Z
dc.date.available2014-06-17T06:52:30Z
dc.date.issued1995-07
dc.identifier.citationFarhang-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
dc.identifier.issn10577130
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/62569
dc.description.abstractImplementation 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.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/82.401172
dc.sourceScopus
dc.typeArticle
dc.contributor.departmentELECTRICAL ENGINEERING
dc.description.doi10.1109/82.401172
dc.description.sourcetitleIEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing
dc.description.volume42
dc.description.issue7
dc.description.page478-480
dc.description.codenICSPE
dc.identifier.isiutA1995RK83300006
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.