An efficient FFT algorithm based on the discrete sine transform

DOI10.1109/78.80835MaRDI QIDQ3493170zbMATH OpenOpenAlexFDO

Authors

Publication date 1991

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/78.80835

zbMATH Keywords

discrete Fourier transformdiscrete sine transformfast Fourier transformFFT algorithm

Mathematics Subject Classification ID

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

Recommendations

• Simple FFT and DCT algorithms with reduced number of operations.
• Fast discrete sine transform algorithms
• A fast recursive algorithm for the discrete sine transform
• A fast algorithm for the discrete sine transform implemented by the fast cosine transform
• Efficient index mapping for computing discrete cosine transform

Cited in

(3)

• Discrete Fourier transform algorithms for real valued sequences
• Simultaneous computation of the DFT of an N-point real sequence and the IDFT of an N-point complex sequence with conjugate symmetry with a single N-point DFT.
• Five-step FFT algorithm with reduced computational complexity

This page was built for publication: An efficient FFT algorithm based on the discrete sine transform

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