By Topic

The structure of vector radix fast Fourier transforms

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)
Wu, H.R. ; Dept. of Electr. & Comput Eng., Wollongong Univ., NSW, Australia ; Paoloni, F.J.

A general form of the matrix representation for multidimensional, vector-radix, fast Fourier transform (FFT) algorithms using decimation-in-frequency is presented. A structure theorem is devised to construct systematically various vector-radix decimation-in-frequency FFT algorithms from their 1-D counterparts. Logic diagrams are provided to facilitate the software and hardware implementation of the algorithms. The computational complexity of several of the algorithms is considered

Published in:

Acoustics, Speech and Signal Processing, IEEE Transactions on  (Volume:37 ,  Issue: 9 )