Fast DFT algorithms for length N=q*2/sup m/

DOI10.1109/82.686687zbMath1003.94506OpenAlexW2018023989MaRDI QIDQ2724302

Guoan Bi, Van Qiu Chen

Publication date: 20 January 2003

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.686687

zbMATH Keywords

discrete Fourier transformsdigital signal processingsplit-radix algorithm

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical methods for discrete and fast Fourier transforms (65T50)

This page was built for publication: Fast DFT algorithms for length N=q*2/sup m/