FINITE FOURIER TRANSFORM

被引:119
作者
COOLEY, JW
LEWIS, PAW
WELCH, PD
机构
[1] IBM Watson Research Center, Yorktown Heights
来源
IEEE TRANSACTIONS ON AUDIO AND ELECTROACOUSTICS | 1969年 / AU17卷 / 02期
关键词
D O I
10.1109/TAU.1969.1162036
中图分类号
O42 [声学];
学科分类号
070206 ; 082403 ;
摘要
The finite Fourier transform of a finite sequence is defined and its elementary properties are developed. The convolution and term-by-term product operations are defined and their equivalent operations in transform space are given. A discussion of the transforms of stretched and sampled functions leads to a sampling theorem for finite sequences. Finally, these results are used to give a simple derivation of the fast Fourier transform algorithm. Copyright © 1969 by The Institute of Electrical and Electronics Engineers, Inc.
引用
收藏
页码:77 / &
相关论文
共 8 条
[1]   AN ALGORITHM FOR MACHINE CALCULATION OF COMPLEX FOURIER SERIES [J].
COOLEY, JW ;
TUKEY, JW .
MATHEMATICS OF COMPUTATION, 1965, 19 (90) :297-&
[2]  
COOLEY JW, 1967, IEEE T AUDIO ELECTRO, VAU15, P76
[3]  
GENTLEMAN WM, 1966, AFIPS P, V29, P563
[4]  
SANDE G, UNPUBLISHED TECH NOT
[5]  
SCHOENBERG IJ, 1950, AM MATH MONTHLY, V57
[6]  
STOCKHAM TG, 1966, AFIPS C P, V28, P229
[7]  
[No title captured]
[8]  
1967, IEEE T ACOUST SPEECH, VAU15, P45