Unscrambling for fast DFT algorithms

DOI10.1109/29.1631MaRDI QIDQ3806773zbMATH OpenOpenAlexFDO

Authors C. Sidney Burrus

Publication date 1988

Published in IEEE Transactions on Acoustics, Speech, and Signal Processing (Search for Journal in Brave)

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

zbMATH Keywords

Cooley-Tukey fast Fourier transformin-place calculationprime factor algorithmsunscrambling

Mathematics Subject Classification ID

Trigonometric interpolation (42A15) Numerical methods for trigonometric approximation and interpolation (65T40) Computer aspects of numerical algorithms (65Yxx)

Recommendations

• scientific article; zbMATH DE number 4209550
• Fast algorithms for DFT of composite sequence lengths
• Fast generalized DFT and DHT algorithms
• A new algorithm for fast generalized DFTs
• scientific article; zbMATH DE number 60565
• On the structure of efficient DFT algorithms
• Rapid Computation of the Discrete Fourier Transform
• scientific article; zbMATH DE number 4164117
• scientific article; zbMATH DE number 796291
• Fast computation of multidimensional DFT

Cited in

(5)

• Novel algorithm for complex bit reversal: Employing vector permutation and branch reduction methods
• Realization of an in-place unscrambler for prime factor algorithm
• scientific article; zbMATH DE number 4209550 (Why is no real title available?)
• An analysis for the realization of an in-place and in-order prime factor algorithm
• Analog Scrambling by the General Fast Fourier Transform

This page was built for publication: Unscrambling for fast DFT algorithms

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