DocumentCode
2656653
Title
FFT with reduced coefficient storage requirement
Author
Thong, Tran
Author_Institution
Tektronix Inc., Beaverton, OR, USA
fYear
1990
fDate
1-3 May 1990
Firstpage
1537
Abstract
The factorization of the Fourier coefficients in the fast Fourier transform (FFT) is reexamined. The author presents a modified radix-2 FFT where the coefficient storage requirement is reduced by close to 50% if the coefficient memory cycle is half that of the operation cycle. This refactorization of the FFT coefficient is a generalization of the decimation in time (DIT) and decimation in frequency (DIF) FFT algorithms. The DIT and DIF are the two extremes of FFT twiddle coefficient factorization
Keywords
fast Fourier transforms; coefficient memory cycle; decimation in frequency; decimation in time; fast Fourier transform; modified radix-2 FFT; reduced coefficient storage requirement; refactorization; twiddle coefficient factorization; Arithmetic; Fast Fourier transforms; Frequency; Laboratories; Memory; Multidimensional systems; Pipelines;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 1990., IEEE International Symposium on
Conference_Location
New Orleans, LA
Type
conf
DOI
10.1109/ISCAS.1990.112426
Filename
112426
Link To Document