Fast algorithms for DFT of composite sequence lengths

DOI10.1016/S0165-1684(98)00119-4zbMath0910.65117OpenAlexW1986624946MaRDI QIDQ1275476

Guoan Bi

Publication date: 12 January 1999

Published in: Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0165-1684(98)00119-4

zbMATH Keywords

decomposition methoddiscrete Fourier transformfast algorithm

Mathematics Subject Classification ID

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

This page was built for publication: Fast algorithms for DFT of composite sequence lengths