A FIXED-POINT FAST FOURIER TRANSFORM ERROR ANALYSIS

被引:86
作者
WELCH, PD
机构
[1] IBM Watson Research Center, Yorktown Heights, N. Y.
来源
IEEE TRANSACTIONS ON AUDIO AND ELECTROACOUSTICS | 1969年 / AU17卷 / 02期
关键词
D O I
10.1109/TAU.1969.1162035
中图分类号
O42 [声学];
学科分类号
070206 ; 082403 ;
摘要
This paper contains an analysis of the fixed-point accuracy of the power of two, fast Fourier transform algorithm. This analysis leads to approximate upper and lower bounds on the root-mean-square error. Also included are the results of some accuracy experiments on a simulated fixed-point machine and their comparison with the error upper bound. Copyright © 1969 by The Institute of Electrical and Electronics Engineers, Inc.
引用
收藏
页码:151 / &
相关论文
共 7 条
[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, RC1743 IBM CORP RES
[3]  
COOLEY JW, 1966, FINITE COMPLEX FOURI
[4]  
GENTLEMAN WM, 1966, AFIPS P, V29, P563
[5]  
OPPENHEIM AV, 1969, IEEE T AUDIO ELECTRO, VAU17, P120
[6]  
SHIVELY RR, 1967, 1 ANN IEEE COMP C, P21
[7]  
F1962867C0198 CONTR