DocumentCode
1087779
Title
Procedures for computing the discrete Fourier transform on staggered blocks
Author
Bongiovanni, Giancarlo ; Corsini, Paolo ; Frosini, Graziano
Author_Institution
Università di Pisa, Pisa Italy.
Volume
24
Issue
2
fYear
1976
fDate
4/1/1976 12:00:00 AM
Firstpage
132
Lastpage
137
Abstract
In this work the problem of evaluating successively the discrete Fourier transform (DFT) on ordered sets of 
elements staggered of 
is considered. Three procedures for solving such a problem are given, of which two are recursive and one nonrecursive. The complexity of each procedure, in number of complex multiplications, is about 
.
elements staggered of is considered. Three procedures for solving such a problem are given, of which two are recursive and one nonrecursive. The complexity of each procedure, in number of complex multiplications, is about .Keywords
Azimuth; Data mining; Discrete Fourier transforms; Doppler radar; Fourier transforms; Frequency;
fLanguage
English
Journal_Title
Acoustics, Speech and Signal Processing, IEEE Transactions on
Publisher
ieee
ISSN
0096-3518
Type
jour
DOI
10.1109/TASSP.1976.1162787
Filename
1162787
Link To Document