A comment on the computational complexity of sliding FFT
From MaRDI portal
Publication:4038852
DOI10.1109/82.208583zbMath0775.65012OpenAlexW1994492130MaRDI QIDQ4038852
Behrouz Farhang-Boroujeny, Y. C. Lim
Publication date: 23 May 1993
Published in: IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/82.208583
Related Items (4)
High-selectivity filter banks for spectral analysis of music signals ⋮ Parallel algorithm for SWFFT using 3D data structure ⋮ Efficient matched filters for DFT based codes ⋮ Critical analysis of electrohysterographic methods for continuous monitoring of intrauterine pressure
This page was built for publication: A comment on the computational complexity of sliding FFT
