Algorithms for defining mixed radix FFT flow graphs

DOI10.1109/29.31290MaRDI QIDQ3031918zbMATH OpenOpenAlexFDO

Authors Gordon L. Demuth

Publication date 1989

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

zbMATH Keywords

Fast Fourier Transformdecimation-in-timetwiddle factorsdecimation-in-frequenceFFT flow graphsFFT structuresintraconnectionphase rotation structureradixes

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99) Algorithms in computer science (68W99)

Recommendations

• An in-order, partially in-place mixed radix FFT algorithm
• scientific article; zbMATH DE number 3992906
• Generating and searching families of FFT algorithms
• FFT algorithms for vector computers
• A segmented FFT algorithm for vector computers
• scientific article; zbMATH DE number 500361
• A novel algorithm for computing the 2D split-vector-radix FFT
• scientific article; zbMATH DE number 4066292
• Implementation of Efficient FFT Algorithms on Fused Multiply- Add Architectures
• Method of flow graph simplification for the 16-point discrete Fourier transform

Cited in

(1)

• Comments on "Method of flow graph simplification for the 16-point discrete Fourier Transform"

This page was built for publication: Algorithms for defining mixed radix FFT flow graphs

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