A General Class of Split-Radix FFT Algorithms for the Computation of the DFT of Length-2ᵐ

DOI10.1109/TSP.2007.896110MaRDI QIDQ4567376zbMATH OpenFDO

Authors Saad Bouguezel, M. Omair Ahmad, M. N. S. Swamy

Publication date 27 June 2018

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

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

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Analysis of algorithms (68W40) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• Split-radix algorithms for length-p/sup m/ DFT's
• A novel algorithm for computing the 2D split-vector-radix FFT
• A New Radix-<tex>$2/8$</tex>FFT Algorithm for Length-<tex>$qtimes 2^m$</tex>DFTs
• On the two-dimensional vector split-radix FFT algorithm
• Scaled Radix-2/8 Algorithm for Efficient Computation of Length-$N=2^{m}$ DFTs
• Split-radix generalized fast Fourier transform
• A new proposed algorithm of arbitrary radix for the computation of the 2D DFT
• A split-radix partial input/output fast Fourier transform algorithm
• Radix-2 decimation-in-frequency algorithm for the computation of the real-valued FFT
• scientific article; zbMATH DE number 4066292

Cited in

(5)

• On the two-dimensional vector split-radix FFT algorithm
• A Generalized Prime Factor FFT Algorithm for any N = 2p 3q 5r
• A New Split-Radix FHT Algorithm for Length-<tex>$q*2^m$</tex>DHTs
• scientific article; zbMATH DE number 773188 (Why is no real title available?)
• Fast Fourier transform using matrix decomposition

This page was built for publication: A General Class of Split-Radix FFT Algorithms for the Computation of the DFT of Length-$2^{m}$

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