DocumentCode
869828
Title
Prime-factor algorithm and Winograd Fourier transform algorithm for real symmetric and antisymmetric sequences
Author
Chan, S.C. ; Ho, K.L.
Author_Institution
Dept. of Electr. & Electron. Eng., Hong Kong Univ., Hong Kong
Volume
136
Issue
2
fYear
1989
fDate
4/1/1989 12:00:00 AM
Firstpage
87
Lastpage
94
Abstract
In the paper, algorithms for computing discrete Fourier transform (DFT) of 1-D real symmetric and antisymmetric sequences, using the prime-factor algorithm (PFA) and the Winograd Fourier transform algorithm (WFTA), are presented. These algorithms are obtained from different factorisations of the Fourier matrix, and it is shown that symmetry conditions exist at each stage which are used to construct efficient algorithms for computing DFTs.
Keywords
correlation theory; fast Fourier transforms; series (mathematics); Winograd Fourier transform algorithm; antisymmetric sequences; discrete Fourier transform; factorisations; prime-factor algorithm; symmetric sequences;
fLanguage
English
Journal_Title
Circuits, Devices and Systems, IEE Proceedings G
Publisher
iet
ISSN
0956-3768
Type
jour
Filename
20256
Link To Document