A comment on the computational complexity of sliding FFT

DOI10.1109/82.208583MaRDI QIDQ4038852zbMATH OpenOpenAlexFDO

Authors 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

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50)

Cited in

(4)

• Critical analysis of electrohysterographic methods for continuous monitoring of intrauterine pressure
• Parallel algorithm for SWFFT using 3D data structure
• High-selectivity filter banks for spectral analysis of music signals
• Efficient matched filters for DFT based codes

This page was built for publication: A comment on the computational complexity of sliding FFT

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4038852)