A Fast Algorithm With Less Operations for Length-<formula formulatype="inline"><tex Notation="TeX">N=q\times 2ᵐ</tex></formula> DFTs

DOI10.1109/TSP.2014.2379678MaRDI QIDQ4579717zbMATH OpenOpenAlexFDO

Authors KenLi Li, Weihua Zheng, Keqin Li

Publication date 22 August 2018

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

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

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50)

Cited in

(3)

• A reduced-complexity fast algorithm for software implementation of the IFFT/FFT in DMT systems
• Fast DHT algorithms for length N=q*2ᵐ
• Algorithms meeting the lower bounds on the multiplicative complexity of length-2/sup n/ DFTs and their connection with practical algorithms

This page was built for publication: A Fast Algorithm With Less Operations for Length-<formula formulatype="inline"><tex Notation="TeX">$N=q\times 2^{m}$</tex></formula> DFTs

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