Roundoff error analysis for fast trigonometric transforms
From MaRDI portal
Recommendations
- Fixed-point round-off error analysis for the discrete cosine transform
- scientific article; zbMATH DE number 2141510
- A Stochastic Roundoff Error Analysis for the Fast Fourier Transform
- scientific article; zbMATH DE number 1329640
- scientific article; zbMATH DE number 2164377
- scientific article; zbMATH DE number 770270
- Roundoff error analysis of fast DCT algorithms in fixed point arithmetic
- Floating point error analysis of two-dimensional, fast Fourier transform algorithms
- scientific article; zbMATH DE number 4039122
- Worst and average case roundoff error analysis for FFT
Cited in
(15)- A new theoretical derivation of NFFT and its implementation on GPU
- Fast and numerically stable algorithms for discrete cosine transforms
- Roundoff error analysis of the recursive moving window discrete Fourier transform
- Signal flow graph approach to efficient and forward stable DST algorithms
- Roundoff error analysis of fast DCT algorithms in fixed point arithmetic
- Signal processing based on stable radix-2 DCT I-IV algorithms having orthogonal factors
- scientific article; zbMATH DE number 2127851 (Why is no real title available?)
- 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 1971052 (Why is no real title available?)
- scientific article; zbMATH DE number 2141510 (Why is no real title available?)
- scientific article; zbMATH DE number 770270 (Why is no real title available?)
- Worst and average case roundoff error analysis for FFT
- Numerical stability of nonequispaced fast Fourier transforms
This page was built for publication: Roundoff error analysis for fast trigonometric transforms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2702479)
