DocumentCode
959359
Title
Split vector-radix-2/8 2-D fast Fourier transform
Author
Pei, Soo-Chang ; Chen, Wei-Yu
Author_Institution
Dept. of Electr. Eng., Nat. Taiwan Univ., Taipei, Taiwan
Volume
11
Issue
5
fYear
2004
fDate
5/1/2004 12:00:00 AM
Firstpage
459
Lastpage
462
Abstract
This letter presents an efficient split vector-radix-2/8 fast Fourier transform (FFT) algorithm. The split vector-radix-2/8 FFT algorithm saves 14% real multiplications and has much lower arithmetic complexity than the split vector-radix-2/4 FFT algorithm. Moreover, this algorithm reduces 25% data loads and stores compared with the split vector-radix-2/4 FFT algorithm.
Keywords
Fourier transform optics; computational complexity; digital arithmetic; fast Fourier transforms; image processing; 2-D fast Fourier transform; FFT algorithm; arithmetic complexity; data loads; split vector-radix; Arithmetic; Digital images; Discrete Fourier transforms; Fast Fourier transforms; Flexible printed circuits; Helium; Polynomials; Signal processing algorithms; Two dimensional displays;
fLanguage
English
Journal_Title
Signal Processing Letters, IEEE
Publisher
ieee
ISSN
1070-9908
Type
jour
DOI
10.1109/LSP.2004.826652
Filename
1288107
Link To Document