Cart (Loading....) | Create Account
Close category search window
 

A new efficient algorithm to compute the two-dimensional discrete Fourier transform

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Gertner, I. ; Dept. of Electr. Eng., Technion, Israel Inst. of Technol., Haifa, Israel

An algorithm is presented for computation of the two-dimensional discrete Fourier transform (DFT). The algorithm is based on geometric properties of the integers and exhibits symmetry and simplicity of realization. Only one-dimensional transformation of the input data is required. The transformations are independent; hence, parallel processing is feasible. It is shown that the number of distinct N -point DFTs needed to calculate N×N-point two-dimensional DFTs is equal to the number of linear congruences spanning the N×N grid. Examples for N=3, N=4, and N=10 are presented. A short APL code illustrating the algorithm is given

Published in:

Acoustics, Speech and Signal Processing, IEEE Transactions on  (Volume:36 ,  Issue: 7 )

Date of Publication:

Jul 1988

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.