DocumentCode
1493285
Title
In-place butterfly-style FFT of 2-D real sequences
Author
Mou, Zhi-Jian ; Duhamel, Pierre
Author_Institution
CNET Issy les Moulineaux, France
Volume
36
Issue
10
fYear
1988
fDate
10/1/1988 12:00:00 AM
Firstpage
1642
Lastpage
1650
Abstract
Methodologies for constructing fast algorithms to compute the discrete Fourier transform (DFT) of a 2-D real sequence are introduced. The resulting algorithms are shown to be in-place and butterfly-style as well as the usual 1-D FFT algorithms. Above all, the computational load of these algorithms is reduced to less than one-half of their complex counterparts. Due to the in-place property, the storage requirement is exactly halved. A comparison is made on the basis of arithmetic complexity, storage, and input/output requirements
Keywords
computerised signal processing; fast Fourier transforms; 2D real sequences; arithmetic complexity; butterfly-style FFT; discrete Fourier transform; fast algorithms; input/output requirements; storage requirement; Arithmetic; Costs; Digital signal processing; Discrete Fourier transforms; Fourier transforms; Multidimensional signal processing; Polynomials; 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.7552
Filename
7552
Link To Document