2-D FFT algorithm by matrix factorization in a 2-D space

DOI10.1007/BF00985863MaRDI QIDQ1316209zbMATH OpenOpenAlexFDO

Authors V. Pereyra

Publication date 14 March 1994

Published in Multidimensional Systems and Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00985863

zbMATH Keywords

algorithmfactorizationFourier matrixhypercube architectureparallel computationtwo-dimensional fast Fourier transform

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Parallel numerical computation (65Y05)

Review text

Let \(n\) be a power of 2. Using a known factorization of the \(n\)-th Fourier matrix, the authors describe an algorithm of the two-dimensional fast Fourier transform (FFT). This algorithm works in both dimensions simultaneously. Its good parallelism benefits an implementation on a computer with hypercube architecture. The algorithm is extended to the \(m\)-dimensional FFT \((m>2)\), too.

Recommendations

• Two-dimensional FFT algorithms on hypercube and mesh machines
• A new proposed algorithm of arbitrary radix for the computation of the 2D DFT
• scientific article; zbMATH DE number 123335
• Two and three dimensional FFTs on highly parallel computers

Cites work

• Fast computation of discrete Fourier transforms using polynomial transforms
• scientific article; zbMATH DE number 3584892 (Why is no real title available?)

Cited in

(6)

• Two dimensional fast Fourier transform for large data matrices
• On the two-dimensional vector split-radix FFT algorithm
• scientific article; zbMATH DE number 123335 (Why is no real title available?)
• A new proposed algorithm of arbitrary radix for the computation of the 2D DFT
• Shifted Fourier transform-based tensor algorithms for the 2-D DCT
• The matrices form of 2FFT

This page was built for publication: 2-D FFT algorithm by matrix factorization in a 2-D space

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