Fast computation of multidimensional DFT

MaRDI QIDQ1177501zbMATH OpenFDO

Authors Mark Kelbert, A. E. Mazel'

Publication date 26 June 1992

Published in Problems of Information Transmission (Search for Journal in Brave)

zbMATH Keywords

fast Fourier transformsdiscrete Fourier transformsresidue systems

Mathematics Subject Classification ID

Congruences; primitive roots; residue systems (11A07) Numerical methods for discrete and fast Fourier transforms (65T50)

Recommendations

• A new efficient algorithm to compute the two-dimensional discrete Fourier transform
• scientific article; zbMATH DE number 11434
• Publication:3490922
• New algorithms for the multidimensional discrete Fourier transform
• Multiplicative complexity of the two-dimensional discrete Fourier transform DFT (2n; 2)

Cited in

(9)

• scientific article; zbMATH DE number 6611926 (Why is no real title available?)
• Unscrambling for fast DFT algorithms
• Fast Fourier Transform Accelerated Fast Multipole Algorithm
• Fast computation of real discrete Fourier transform for any number of data points
• Fast Computation of Multidimensional Fourier Integrals
• Index transforms for multidimensional DFT's and convolutions
• scientific article; zbMATH DE number 11434 (Why is no real title available?)
• scientific article; zbMATH DE number 2058227 (Why is no real title available?)
• A new efficient algorithm to compute the two-dimensional discrete Fourier transform

This page was built for publication: Fast computation of multidimensional DFT

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