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) log 2 N complex multiplication per sample reported in [1]. © 1992 IEEE
Cite
CITATION STYLE
APA
Farhang-Boroujeny, B., & Lim, Y. C. (1992). A Comment on the Computational Complexity of Sliding FFT. IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, 39(12), 875–876. https://doi.org/10.1109/82.208583
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free