Fixed-point round-off error analysis for the discrete cosine transform
From MaRDI portal
Recommendations
Cites work
- A new algorithm to compute the discrete cosine Transform
- A two-dimensional fast cosine transform
- Discrete Cosine Transform
- Discrete cosine transform filtering
- Fixed-point error analysis of fast Hartley transform
- scientific article; zbMATH DE number 3577138 (Why is no real title available?)
- Synthesis of minimum roundoff noise fixed point digital filters
Cited in
(12)- Fixed-point error analysis and an efficient array processor design of two-dimensional sliding DFT
- Roundoff error analysis of the recursive moving window discrete Fourier transform
- Roundoff error analysis of fast DCT algorithms in fixed point arithmetic
- Roundoff error analysis for fast trigonometric transforms
- 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
- scientific article; zbMATH DE number 4004868 (Why is no real title available?)
- Analysis of error in the fixed-point implementation of two-dimensional discrete wavelet transforms
- scientific article; zbMATH DE number 770270 (Why is no real title available?)
- scientific article; zbMATH DE number 5038973 (Why is no real title available?)
- Fixed-point error analysis of fast Hartley transform
- Fixed-point fast Hartley transform error analysis
This page was built for publication: Fixed-point round-off error analysis for the discrete cosine transform
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3990960)