Fixed-point fast Fourier transform error analysis
- 1 December 1976
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Acoustics, Speech, and Signal Processing
- Vol. 24 (6) , 563-573
- https://doi.org/10.1109/tassp.1976.1162875
Abstract
A statistical model for roundoff errors is used to predict the output noise of the two common forms of the fast Fourier transform (FFT) algorithm, the decimations in-time and in-frequency. This paper deals with two's complement arithmetic with either rounding or chopping. The total mean-square errors and the mean-square errors for the individual points are derived for radix-2 FFT's. Results for mixed-radix FFT are also given.Keywords
This publication has 8 references indexed in Scilit:
- Quantization errors in the fast Fourier transformIEEE Transactions on Acoustics, Speech, and Signal Processing, 1975
- Roundoff error analysis of the fast Fourier transformMathematics of Computation, 1971
- Accumulation of Round-Off Error in Fast Fourier TransformsJournal of the ACM, 1970
- QUANTIZATION EFFECTS IN DIGITAL FILTERSPublished by Defense Technical Information Center (DTIC) ,1969
- Roundoff noise in floating point fast Fourier transform computationIEEE Transactions on Audio and Electroacoustics, 1969
- A fixed-point fast Fourier transform error analysisIEEE Transactions on Audio and Electroacoustics, 1969
- What is the fast Fourier transform?IEEE Transactions on Audio and Electroacoustics, 1967
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965