Scaled Radix-2/8 Algorithm for Efficient Computation of Length-N=2ᵐ DFTs

DOI10.1109/TSP.2014.2310434MaRDI QIDQ4579189zbMATH OpenFDO

Authors Weihua Zheng, KenLi Li, Keqin Li

Publication date 22 August 2018

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

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Numerical algorithms for computer arithmetic, etc. (65Y04)

Cited in

(6)

• Extendible look-up table of twiddle factors and radix-8 based fast Fourier transform
• Hybrid multi-granulation rough sets of variable precision based on tolerance
• On the real complexity of a complex DFT
• A New Split-Radix FHT Algorithm for Length-<tex>$q*2^m$</tex>DHTs
• A General Class of Split-Radix FFT Algorithms for the Computation of the DFT of Length-$2^{m}$
• Multiplication

This page was built for publication: Scaled Radix-2/8 Algorithm for Efficient Computation of Length-$N=2^{m}$ DFTs

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