A Fixed-Point Fast Fourier Transform Error Analysis

This paper contains an analysis of the fixed-point accuracy of the powqer 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.