1. ScholarBank@NUS
  2. 1. Staff
  3. Staff Publications
Please use this identifier to cite or link to this item: https://doi.org/10.1109/82.208583
DC FieldValue
dc.titleComment on the computational complexity of sliding FFT
dc.contributor.authorFarhang-Boroujeny, B.
dc.contributor.authorLim, Y.C.
dc.date.accessioned2014-10-07T02:56:19Z
dc.date.available2014-10-07T02:56:19Z
dc.date.issued1992-12
dc.identifier.citationFarhang-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.issn10577130
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/80328
dc.description.abstractThe 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.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/82.208583
dc.sourceScopus
dc.typeArticle
dc.contributor.departmentELECTRICAL ENGINEERING
dc.description.doi10.1109/82.208583
dc.description.sourcetitleIEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing
dc.description.volume39
dc.description.issue12
dc.description.page875-876
dc.description.codenICSPE
dc.identifier.isiutA1992KX00200006
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.