scientific article; zbMATH DE number 4052967
This paper is concerned with the error analysis of a floating point FFT (fast Fourier transform processor. A statistical model of the error propagation in each pass is developed, which takes into account three different sources of errors: - input error, due to the finite resolution of the analog-digital converter,- roundoff errors, associated with the computation of the transform, - coefficient quantization errors. Each of the errors is investigated in details and compared with the experimental results. It is concluded that for the particular structure of the processor realised, the input error has the maximum effect.
- An accurate error analysis model for fast Fourier transform
- Floating point error analysis of two-dimensional, fast Fourier transform algorithms
- A Stochastic Roundoff Error Analysis for the Fast Fourier Transform
- Range and error analysis for a fast Fourier transform computed over<tex>Z[{omega}]</tex>
- Error analysis of some operations involved in the Cooley-Tukey fast Fourier transform
- Arithmetic errors in the sub-band FFT: Derivation of error equations and simulation results
- On the effect of correlation between truncation errors in fixed-point error analysis of Winograd short-length DFT algorithms
- Error analysis of Good-Winograd algorithm assuming correlated truncation errors
- Floating point error analysis of two-dimensional, fast Fourier transform algorithms
- scientific article; zbMATH DE number 26618 (Why is no real title available?)
- An accurate error analysis model for fast Fourier transform
- scientific article; zbMATH DE number 4187669 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3789031)