DocumentCode
1220766
Title
A new computation procedure for the discrete Fourier transform
Author
Mason, J.S.
Author_Institution
University College of Swansea, Department of Electrical & Electronic Engineering, Swansea, UK
Volume
2
Issue
1
fYear
1978
fDate
1/1/1978 12:00:00 AM
Firstpage
16
Lastpage
20
Abstract
A new two-stage approach to the computation of the discrete Fourier transform is described, which, relative to the fast Fourier transform (f.f.t.), can offer a number of distinct advantages: fewer inherent multiplications over a given range, no complex arithmetic for real data, and flexibility of output. The mathematical foundations and related algorithms are discussed in detail and a guide to the advantages over both the f.f.t. and the recently reported Winograd Fourier transform are included.
Keywords
Fourier transforms; computation procedure; discrete Fourier transform; fast Fourier transform; inherent multiplications; output flexibility; two stage approach;
fLanguage
English
Journal_Title
Electronic Circuits and Systems, IEE Journal on
Publisher
iet
ISSN
0308-6984
Type
jour
DOI
10.1049/ij-ecs:19780003
Filename
4808494
Link To Document