This correspondence presents some results in fixed-point error analysis of fast Fourier transform algorithms. Two kinds of schemes for preventing overflow are considered in the analysis. The results, obtained for the decimation-in-frequency form of the algorithm, are compared with those of decimation-in-time. The results show that the error performance of the decimation-in-frequency algorithm is better than that of decimation-in-time.