A note on polynomial transform error analysis

In this correspondence, a fixed-point error analysis is given for polynomial transforms computed using two's complement arithmetic. The results are extended for computing the mean-square error of a two-dimensional discrete Fourier transform (DFT) computed by polynomial transform technique. Also, an earlier result derived by Nussbaumer [1] for comparing the rms error/rms result of the polynomial transform and the fast Fourier transform (FFT) has been modified.