A prime-factor decomposed algorithm for the discrete sine transform
From MaRDI portal
The paper presents a prime factor algorithm for the discrete sine transform, which is similar to the known prime factor algorithm for the discrete cosine transform [cf. \textit{K. R. Rao} and the first author, ``Discrete cosine transform. Algorithms, advantages, applications. (1990; Zbl 0726.65162)].
Recommendations
- Fast prime factor decomposition algorithms for a family of discrete trigonometric trigonometric transforms
- Prime factor algorithm for multidimensional discrete cosine transform
- A fast recursive algorithm for the discrete sine transform
- Fast and stable algorithms for discrete sine transformations having orthogonal factors
- The decimation-in-frequency algorithms for a family of discrete sine and cosine transforms
- Symmetric Prime Factor Fast Fourier Transform Algorithms
- Fast decimation-in-time algorithms for a family of discrete sine and cosine transforms
- Input and output index mappings for a prime-factor-decomposed computation of discrete cosine transform
- An integer approximation method for discrete sinusoidal transforms
- Fast discrete sine transform algorithms
Cited in
(5)- The decimation-in-frequency algorithms for a family of discrete sine and cosine transforms
- On the computation of the prime factor DST
- Fast prime factor decomposition algorithms for a family of discrete trigonometric trigonometric transforms
- Input and output index mappings for a prime-factor-decomposed computation of discrete cosine transform
- On prime factor mapping for the discrete Hartley transform
This page was built for publication: A prime-factor decomposed algorithm for the discrete sine transform
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q803771)
