Programming an efficient radix-four FFT algorithm.

DOI10.1016/0165-1684(84)90064-1MaRDI QIDQ554695zbMATH OpenOpenAlexFDO

Authors Gregory H. Allen

Publication date 5 August 2011

Published in Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0165-1684(84)90064-1

zbMATH Keywords

FFTfast Fourier transformbase fourradix-4radix-fourtwiddle factor organization

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Application of orthogonal and other special functions (94A11)

Recommendations

• Very fast computation of the radix-2 discrete Fourier transform
• An improved FFT digit-reversal algorithm
• Extendible look-up table of twiddle factors and radix-8 based fast Fourier transform
• scientific article; zbMATH DE number 4066292
• On hardware implementation of the split-radix FFT

Cited in

(2)

• scientific article; zbMATH DE number 6611926 (Why is no real title available?)
• scientific article; zbMATH DE number 773188 (Why is no real title available?)

This page was built for publication: Programming an efficient radix-four FFT algorithm.

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