2-D FFT algorithm by matrix factorization in a 2-D space (Q1316209)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: 2-D FFT algorithm by matrix factorization in a 2-D space |
scientific article; zbMATH DE number 519725
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | 2-D FFT algorithm by matrix factorization in a 2-D space |
scientific article; zbMATH DE number 519725 |
Statements
2-D FFT algorithm by matrix factorization in a 2-D space (English)
0 references
14 March 1994
0 references
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.
0 references
parallel computation
0 references
factorization
0 references
Fourier matrix
0 references
two-dimensional fast Fourier transform
0 references
hypercube architecture
0 references
algorithm
0 references
0.8181015849113464
0 references
0.8175156116485596
0 references
0.8173297643661499
0 references
0.7897371053695679
0 references
