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

DOI10.1109/TSP.2014.2379678zbMath1394.65175OpenAlexW1979555829MaRDI QIDQ4579717

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)

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