Paper
6 December 1989 Fast Algorithms To Compute Multidimensional Discrete Fourier Transform
I. Gertner, R. Tolimieri
Author Affiliations +
Abstract
This paper presents algorithms to com-pute a N -dimensional Discrete Fourier Transform. First existing algorithms are surveyed. Multiplicative symmetrized and orbit exchange algorithm is presented. Then line algorithm to compute Multidi-mensional DFT is derived in two and N -dimensions. The explicit congruences for minimal number of lines covering a mul-tidimensional grid is given, when the data size in one dimension is equal to the power of a prime number.
© (1989) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
I. Gertner and R. Tolimieri "Fast Algorithms To Compute Multidimensional Discrete Fourier Transform", Proc. SPIE 1154, Real-Time Signal Processing XII, (6 December 1989); https://doi.org/10.1117/12.962379
Lens.org Logo
CITATIONS
Cited by 8 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Fourier transforms

Crystals

Signal processing

Adaptive optics

Algorithm development

Evolutionary algorithms

Vector spaces

RELATED CONTENT

A (Micro) Programmable Digital Image Processing System
Proceedings of SPIE (October 26 1983)
Parametric family of discrete trigonometric transforms
Proceedings of SPIE (March 13 1996)
Programming Methods For Crystallography
Proceedings of SPIE (December 06 1989)
Mixed-radix approach to incremental DFT refinement
Proceedings of SPIE (June 07 1995)
Real Time Considerations For DFT Algorithms
Proceedings of SPIE (November 28 1983)

Back to Top