Fast Algorithms To Compute Multidimensional Discrete Fourier Transform

I. Gertner; R. Tolimieri

doi:10.1117/12.962379

6 December 1989 Fast Algorithms To Compute Multidimensional Discrete Fourier Transform

I. Gertner, R. Tolimieri

Proceedings Volume 1154, Real-Time Signal Processing XII; (1989) https://doi.org/10.1117/12.962379
Event: 33rd Annual Technical Symposium, 1989, San Diego, United States

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.

Citation Download Citation

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

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available