DocumentCode
779394
Title
New FFT structures based on the Bruun algorithm
Author
Wu, Yuhang
Author_Institution
Electron. Lab., Tech. Univ. of Denmark, Lyngby, Denmark
Volume
38
Issue
1
fYear
1990
fDate
1/1/1990 12:00:00 AM
Firstpage
188
Lastpage
191
Abstract
In some signal processing applications, the input data are real. In this case, the Bruun algorithm for computation of the discrete Fourier transform (DFT) is attractive. The author offers a pipeline and a recirculated shuffle network implementation of the Bruun algorithm. The implementation of the parallel pipeline and recirculated FFT structures is based on the modified perfect shuffle network
Keywords
fast Fourier transforms; parallel algorithms; pipeline processing; signal processing; Bruun algorithm; DFT; discrete Fourier transform; modified perfect shuffle network; parallel pipeline FFT structures; recirculated FFT structures; recirculated shuffle network implementation; signal processing; Convolution; Digital signal processing; Discrete Fourier transforms; Discrete cosine transforms; Discrete transforms; Equations; Filter bank; Flow graphs; Pipelines; Signal processing algorithms;
fLanguage
English
Journal_Title
Acoustics, Speech and Signal Processing, IEEE Transactions on
Publisher
ieee
ISSN
0096-3518
Type
jour
DOI
10.1109/29.45572
Filename
45572
Link To Document