A unified treatment of Cooley-Tukey algorithms for the evaluation of the multidimensional DFT
From MaRDI portal
Publication:3036661
DOI10.1109/TASSP.1981.1163687zbMath0524.65092OpenAlexW1981511223MaRDI QIDQ3036661
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
discrete Fourier transformsdigital signal processingCooley-Tukey fast Fourier transformmultidimensional sequencesfactorization of an integer matrixvector- radix algorithms
Trigonometric interpolation (42A15) Numerical methods for trigonometric approximation and interpolation (65T40)
Related Items
A special class of structured matrices constructed with the Kronecker product and its use for difference equations ⋮ Fast Fourier transform on FCC and BCC lattices with outputs on FCC and BCC lattices respectively ⋮ The fast Fourier transform and fast wavelet transform for patterns on the torus