An improved fast Fourier transform algorithm using mixed frequency and time decimations

DOI10.1109/29.1522zbMath0647.65096OpenAlexW2060876740MaRDI QIDQ3792204

Kenji Nakayama

Publication date: 1988

Published in: IEEE Transactions on Acoustics, Speech, and Signal Processing (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2297/3945

zbMATH Keywords

number of multiplicationsfast Fourier transform algorithmdecimation in frequencydecimation in timeasymptotic complexity boundmixed decimation FFT algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trigonometric interpolation (42A15) Numerical methods for trigonometric approximation and interpolation (65T40)

This page was built for publication: An improved fast Fourier transform algorithm using mixed frequency and time decimations