Please use this identifier to cite or link to this item:
https://doi.org/10.1109/82.208583
DC Field | Value | |
---|---|---|
dc.title | Comment on the computational complexity of sliding FFT | |
dc.contributor.author | Farhang-Boroujeny, B. | |
dc.contributor.author | Lim, Y.C. | |
dc.date.accessioned | 2014-10-07T02:56:19Z | |
dc.date.available | 2014-10-07T02:56:19Z | |
dc.date.issued | 1992-12 | |
dc.identifier.citation | Farhang-Boroujeny, B., Lim, Y.C. (1992-12). Comment on the computational complexity of sliding FFT. IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing 39 (12) : 875-876. ScholarBank@NUS Repository. https://doi.org/10.1109/82.208583 | |
dc.identifier.issn | 10577130 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/80328 | |
dc.description.abstract | The sliding fast Fourier transform (FFT) is reviewed and is shown to have the computational complexity of N complex multiplications per sample, as opposed to the well-cited assumption of (N/2) log2 N complex multiplication per sample reported in [1]. | |
dc.description.uri | http://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/82.208583 | |
dc.source | Scopus | |
dc.type | Article | |
dc.contributor.department | ELECTRICAL ENGINEERING | |
dc.description.doi | 10.1109/82.208583 | |
dc.description.sourcetitle | IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing | |
dc.description.volume | 39 | |
dc.description.issue | 12 | |
dc.description.page | 875-876 | |
dc.description.coden | ICSPE | |
dc.identifier.isiut | A1992KX00200006 | |
Appears in Collections: | Staff Publications |
Show simple 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.