Please use this identifier to cite or link to this item: https://doi.org/10.1109/82.208583
Title: Comment on the computational complexity of sliding FFT
Authors: Farhang-Boroujeny, B. 
Lim, Y.C. 
Issue Date: Dec-1992
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
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].
Source Title: IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing
URI: http://scholarbank.nus.edu.sg/handle/10635/80328
ISSN: 10577130
DOI: 10.1109/82.208583
Appears in Collections:Staff Publications

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

SCOPUSTM   
Citations

42
checked on Sep 19, 2018

WEB OF SCIENCETM
Citations

33
checked on Sep 19, 2018

Page view(s)

69
checked on Jun 15, 2018

Google ScholarTM

Check

Altmetric


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