DocumentCode
3004747
Title
A nesting algorithm for very fast discrete Fourier transforms
Author
Siu, Wan-Chi
Author_Institution
Dept. of Electron. Eng., Hong Kong Polytech., Kowloon, Hong Kong
fYear
1988
fDate
11-14 Apr 1988
Firstpage
1898
Abstract
The use of a nesting discrete Fourier transform technique to compute discrete Fourier transform is proposed. This technique only relies on two primitive modules and other modules are generated by a standard nesting procedure. The speed of computation of this approach is comparable to the speed of computation of the WFTA, whereas the program size of the present approach is smaller than that of the WFTA. This approach is most suitable for cases where there are restrictions on memory size
Keywords
FORTRAN listings; computerised signal processing; fast Fourier transforms; FORTRAN listings; discrete Fourier transforms; nesting algorithm; Convolution; Digital signal processing; Discrete Fourier transforms; FETs; Fourier transforms; Signal processing algorithms; Sun;
fLanguage
English
Publisher
ieee
Conference_Titel
Acoustics, Speech, and Signal Processing, 1988. ICASSP-88., 1988 International Conference on
Conference_Location
New York, NY
ISSN
1520-6149
Type
conf
DOI
10.1109/ICASSP.1988.196997
Filename
196997
Link To Document