By Topic

Vector-radix-22×22 fast Fourier transform algorithm

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

2 Author(s)
Hamood, M.T. ; Sch. of Electr., Electron. & Comput. Eng., Newcastle Univ., Newcastle upon Tyne, UK ; Boussakta, S.

In this paper, a new decimation-in-time vector-radix-22 × 22 fast Fourier transform (VR-22 × 22-FFT) algorithm for computing the two dimensional discrete Fourier transform (2-D DFT) is presented. The algorithm is derived by applying a two-stage decomposition approach and by introducing an efficient technique for grouping the twiddle factors. The arithmetic complexity of the proposed algorithm is analyzed and the number of real multiplications and additions are computed for different transform sizes. Moreover, a comparison with the existing 2-D vector-radix FFT algorithms has shown that the presented algorithm can be considered as a good compromise between the structural and computational complexities.

Published in:

Electronics, Circuits, and Systems (ICECS), 2010 17th IEEE International Conference on

Date of Conference:

12-15 Dec. 2010