BOUNDS ON ERROR DUE TO FINITE ARITHMETIC IN FFT COMPUTATION.

被引:0
作者
Moharir, P.S.
机构
来源
Journal of the Institution of Electronics and Telecommunication Engineers | 1979年 / 25卷 / 06期
关键词
ALGORITHM - ERROR BOUNDS - FINITE ARITHMETIC EFFECTS;
D O I
10.1080/03772063.1979.11451864
中图分类号
学科分类号
摘要
For the decimation-in-frequency Fast Fourier Transform (FFT) algorithm using fixed point arithmetic, it is shown that there are position-dependent bounds on the error amplitude in the Fourier coefficients. This means that the error statistics are position dependent and the earlier results on finite arithmetic effects in FFT calculation are inaccurate to that extent. These results lead to worst-case deterministic design of a FFT processor.
引用
收藏
页码:236 / 239
页数:3
相关论文
empty
未找到相关数据