System Maintenance:
There may be intermittent impact on performance while updates are in progress. We apologize for the inconvenience.
By Topic

Two-dimensional recursive fast Fourier transform [image processing applications]

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 $31
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)
Feihong Zhu ; Dept. of Electr. & Comput. Eng., Oregon State Univ., Corvallis, OR, USA

The author presents a two-dimensional recursive fast Fourier transform (RFFT) which consists of two recursive algorithms and a revised fast Fourier transform in the recursive process. This algorithm is applied to image processing as an example of 2-D signal processing. Compared with a standard FFT, the RFFT has the advantages of not requiring the number of input data points to be equal to the number of discrete frequencies and of being suitable for online processing. Compared with other recursive Fourier transforms, the RFFT has a shorter computation time

Published in:

Radar and Signal Processing, IEE Proceedings F  (Volume:137 ,  Issue: 4 )