Share Email Print

Proceedings Paper

Fast Algorithms To Compute Multidimensional Discrete Fourier Transform
Author(s): I. Gertner; R. Tolimieri
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 6 December 1989
PDF: 15 pages
Proc. SPIE 1154, Real-Time Signal Processing XII, (6 December 1989); doi: 10.1117/12.962379
Show Author Affiliations
I. Gertner, The Graduate School and University Center CUNY (United States)
R. Tolimieri, The Graduate School and University Center CUNY (United States)

Published in SPIE Proceedings Vol. 1154:
Real-Time Signal Processing XII
J. P. Letellier, Editor(s)

© SPIE. Terms of Use
Back to Top