Philip Heidelberger, Peter D. Welch
CACM
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.
Philip Heidelberger, Peter D. Welch
CACM
Peter D. Welch
SIGMETRICS 1976
James W. Cooley, Peter A. W. Lewis, et al.
IEEE Transactions on Audio and Electroacoustics
Peter D. Welch
Acta Informatica