A fast recursive algorithm for the discrete sine transform
From MaRDI portal
Recommendations
- Fast discrete sine transform algorithms
- New fast recursive algorithms for the computation of discrete cosine and sine transforms
- Discrete sine transform and its inverse - realization through recursive algorithms
- A fast algorithm for the discrete sine transform implemented by the fast cosine transform
- scientific article; zbMATH DE number 613348
Cited in
(17)- Comments on On the computation and the effectiveness of discrete sine transform
- The decimation-in-frequency algorithms for a family of discrete sine and cosine transforms
- On the computation of the prime factor DST
- The approximating capability of fast forms
- Signal flow graph approach to efficient and forward stable DST algorithms
- Fast discrete sine transform algorithms
- Fast and stable algorithms for discrete sine transformations having orthogonal factors
- An efficient FFT algorithm based on the discrete sine transform
- Discrete sine transform and its inverse - realization through recursive algorithms
- Matrix recursive expressions of the DFT of even and odd complex sequences
- A fast algorithm for the discrete sine transform implemented by the fast cosine transform
- Comments on "A Fast Computational Algorithm for the Discrete Sine Transform"
- New fast recursive algorithms for the computation of discrete cosine and sine transforms
- scientific article; zbMATH DE number 613348 (Why is no real title available?)
- A recursive fast Fourier transformation algorithm
- A unified discrete cosine and discrete sine transform computation
- A prime-factor decomposed algorithm for the discrete sine transform
This page was built for publication: A fast recursive 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 Q3349942)