FFT algorithms for prime transform sizes and their implementations on VAX, IBM3090VF, and IBM RS/6000

DOI10.1109/78.193205zbMATH Open0773.65095OpenAlexW2113741245MaRDI QIDQ4036237FDOQ4036237

Authors: Chao Lu, James W. Cooley, R. Tolimieri 

Publication date: 16 May 1993

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

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

Recommendations

• Modified Winograd FFT algorithm and its variants for transform size \(N=p^ k\) and their implementations
• Implementation of a self-sorting in-place prime factor FFT algorithm
• On the structure of efficient DFT algorithms
• A Generalized Prime Factor FFT Algorithm for any $N = 2^p 3^q 5^r $
• scientific article; zbMATH DE number 5876376

zbMATH Keywords

fast Fourier transformWinograd algorithmmultiply-addimplementation of FFTprime transform sizes

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Numerical algorithms for specific classes of architectures (65Y10)

Cited In (6)

• Implementation of the in-order prime factor transform for variable sizes
• Title not available (Why is that?)
• Lesser known FFT algorithms
• On the structure of efficient DFT algorithms
• Implementation of a prime factor FFT algorithm on CRAY-1
• Modified Winograd FFT algorithm and its variants for transform size \(N=p^ k\) and their implementations

This page was built for publication: FFT algorithms for prime transform sizes and their implementations on VAX, IBM3090VF, and IBM RS/6000

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