Scaled Radix-2/8 Algorithm for Efficient Computation of Length-$N=2^{m}$ DFTs

DOI10.1109/TSP.2014.2310434zbMath1392.65118MaRDI QIDQ4579189

KenLi Li, Keqin Li, Weihua Zheng

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)

Related Items (3)

On the real complexity of a complex DFT ⋮ Unnamed Item ⋮ Hybrid multi-granulation rough sets of variable precision based on tolerance

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