A new discrete Fourier transform algorithm using butterfly structure fast convolution

DOI10.1109/TASSP.1985.1164684MaRDI QIDQ3757260zbMATH OpenOpenAlexFDO

Authors Kenji Nakayama

Publication date 1985

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

Full work available at URL https://doi.org/10.1109/tassp.1985.1164684

zbMATH Keywords

butterfly structure number theoretic transformcircular matricesdiscrete Fourier transformfast circular convolutionfast Fourier transform

Mathematics Subject Classification ID

Numerical methods for trigonometric approximation and interpolation (65T40)

Recommendations

• Convolution-based DCT algorithm
• scientific article; zbMATH DE number 1174541
• scientific article; zbMATH DE number 3915602
• Hardware efficient fast computation of the discrete Fourier transform
• Recursive Fourier transform using convolutions

This page was built for publication: A new discrete Fourier transform algorithm using butterfly structure fast convolution

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