A unified treatment of Cooley-Tukey algorithms for the evaluation of the multidimensional DFT

DOI10.1109/TASSP.1981.1163687zbMATH Open0524.65092OpenAlexW1981511223MaRDI QIDQ3036661FDOQ3036661

Authors: Russell M. Mersereau, Theresa C. Speake 

Publication date: 1981

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.1981.1163687

zbMATH Keywords

digital signal processingdiscrete Fourier transformsCooley-Tukey fast Fourier transformmultidimensional sequencesfactorization of an integer matrixvector- radix algorithms

Mathematics Subject Classification ID

Numerical methods for trigonometric approximation and interpolation (65T40) Trigonometric interpolation (42A15)

Cited In (3)

• A special class of structured matrices constructed with the Kronecker product and its use for difference equations
• The fast Fourier transform and fast wavelet transform for patterns on the torus
• Fast Fourier transform on FCC and BCC lattices with outputs on FCC and BCC lattices respectively

This page was built for publication: A unified treatment of Cooley-Tukey algorithms for the evaluation of the multidimensional DFT

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