On the fixed-point rounding in the DFT
Authors:
- 1 July 2017
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 261-264
Abstract
Rounding error in the discrete Fourier transform calculated with fast fixed-point algorithms is considered. It is shown that the variance of the rounding error depends on frequency index. Theoretically obtained results for error variance are statistically checked on decimation-in-time fast Fourier transform with two rounding methods.Keywords
This publication has 7 references indexed in Scilit:
- Accurate performance analysis of a fixed point FFT2016
- Analysis of Mean-Square-Error (MSE) for fixed-point FFT units2011
- On the Fixed-Point Accuracy Analysis of FFT AlgorithmsIEEE Transactions on Signal Processing, 2008
- Error analysis and comparison of FFT implementation structures2003
- A simple fixed-point error bound for the fast Fourier transformIEEE Transactions on Acoustics, Speech, and Signal Processing, 1979
- A fixed-point fast Fourier transform error analysisIEEE Transactions on Audio and Electroacoustics, 1969
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965