New algorithms for the multidimensional discrete Fourier transform

DOI10.1109/TASSP.1983.1164081zbMATH Open0564.65091MaRDI QIDQ3678628FDOQ3678628

Authors: Louis Auslander, Ephraim Feig, Shmuel Winograd 

Publication date: 1983

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

Recommendations

• A new efficient algorithm to compute the two-dimensional discrete Fourier transform
• scientific article; zbMATH DE number 11434
• Publication:3490922
• An efficient algorithm for the computation of the multidimensional discrete Fourier transform
• scientific article; zbMATH DE number 3915602

zbMATH Keywords

discrete Fourier transformmultidimensional

Mathematics Subject Classification ID

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

Cited In (13)

• A New Representation of FFT Algorithms Using Triangular Matrices
• Computational Science and Its Applications – ICCSA 2004
• A new multidimensional FFT based on one-dimensional decompositions
• New algorithm for multidimensional type-III DCT
• Multidimensional polynomial transform algorithm for multidimensional discrete \(W\) transform
• A new efficient algorithm to compute the two-dimensional discrete Fourier transform
• Fast computation of multidimensional DFT
• The inverse of an automorphism in polynomial time
• Efficient implementation of multidimensional fast Fourier transforms on a Cray X-MP
• Multidimensional exploration of software implementations for DSP algorithms
• Title not available (Why is that?)
• Ring structures and the discrete Fourier transform
• The weighted redundancy transform

This page was built for publication: New algorithms for the multidimensional discrete Fourier transform

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