On hardware implementation of the split-radix FFT

DOI10.1109/29.7545MaRDI QIDQ3805858zbMATH OpenOpenAlexFDO

Authors M. A. Richards

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

zbMATH Keywords

algorithmbutterfly computationscomplexityCooley-Tukey algorithmdiscrete Fourier transformfast Fourier transformsplit- radix FFT

Mathematics Subject Classification ID

Trigonometric interpolation (42A15) Numerical methods for trigonometric approximation and interpolation (65T40)

Recommendations

• Split-radix algorithms for length-p/sup m/ DFT's
• scientific article; zbMATH DE number 3926792
• Fast DFT algorithms for length N=q*2ᵐ
• Real-time implementation of the split-radix FFT -- an algorithm to efficiently construct local butterfly modules
• Modified FFTs for Fused Multiply-Add Architectures

Cited in

(9)

• Real-time implementation of the split-radix FFT -- an algorithm to efficiently construct local butterfly modules
• Split-radix generalized fast Fourier transform
• Lesser known FFT algorithms
• Split-radix algorithms for length-p/sup m/ DFT's
• Implementation of FFT Structures Using the Residue Number System
• Implementation of Efficient FFT Algorithms on Fused Multiply- Add Architectures
• The Tangent FFT
• Programming an efficient radix-four FFT algorithm.
• Novel design of multiplier-less FFT processors

This page was built for publication: On hardware implementation of the split-radix FFT

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