Fixed-point error analysis of fast Hartley transform
From MaRDI portal
The authors analyse fixed-point error propagation for both decimation-in- frequency (DIF) and decimation-in-time (DIT) fast Hartley transform (FHT). Expressions for average output signal-to-noise ratio (SNR) are derived and plotted. A comparison with plots of analogical expressions for standard DIT and DIF fast Fourier transform (FFT) shows better performance of FFT (FHT exhibits lower SNR than FFT). Moreover, DIT FHT should be preferred over DIF FHT. The reasons explaining these results are discussed.
Recommendations
- Fixed-point fast Hartley transform error analysis
- Comments on ``Fixed-point error analysis of fast Hartley transform
- Some results in fixed point error analysis of the Bruun-FTT algorithm
- Fixed-point round-off error analysis for the discrete cosine transform
- An accurate error analysis model for fast Fourier transform
Cited in
(6)- Comments on ``Fixed-point error analysis of fast Hartley transform
- Componentwise error analysis for FFTs with applications to fast Helmholtz solvers
- scientific article; zbMATH DE number 5521053 (Why is no real title available?)
- Fixed-point round-off error analysis for the discrete cosine transform
- Analysis of error in the fixed-point implementation of two-dimensional discrete wavelet transforms
- Fixed-point fast Hartley transform error analysis
This page was built for publication: Fixed-point error analysis of fast Hartley transform
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q802858)