DocumentCode :
1158388
Title :
On the two-dimensional vector split-radix FFT algorithm
Author :
Wu, H.R. ; Paoloni, F.J.
Author_Institution :
Dept. of Electr. & Comput. Eng., Wollongong Univ., NSW, Australia
Volume :
37
Issue :
8
fYear :
1989
fDate :
8/1/1989 12:00:00 AM
Firstpage :
1302
Lastpage :
1304
Abstract :
The complete equations are presented for the first stage of the two-dimensional vector split-radix decimation-in-frequency fast Fourier transform algorithm using a structural approach. The computational complexity of the algorithm is discussed and compared to other published results. The author states that generally, the vector split-radix method provides a significant reduction in the number of complex multiplications required to implement a two-dimensional discrete Fourier transform
Keywords :
computational complexity; fast Fourier transforms; computational complexity; decimation-in-frequency; fast Fourier transform; two-dimensional vector split-radix FFT algorithm; Acoustic signal processing; Australia; Computational complexity; Discrete Fourier transforms; Equations; Signal processing algorithms; Speech; Telecommunication computing; Two dimensional displays;
fLanguage :
English
Journal_Title :
Acoustics, Speech and Signal Processing, IEEE Transactions on
Publisher :
ieee
ISSN :
0096-3518
Type :
jour
DOI :
10.1109/29.31283
Filename :
31283
Link To Document :
بازگشت