Improvement of the discrete cosine transform calculation by means of a recursive method
From MaRDI portal
Publication:969952
Recommendations
- Calculation scheme based on a weighted primitive: application to image processing transforms
- Compact recursive structures for discrete cosine transform
- New fast recursive algorithms for the computation of discrete cosine and sine transforms
- On the discrete cosine transform computation
- Fast recursive algorithms for 2-D discrete cosine transform.
Cites Work
- scientific article; zbMATH DE number 47594 (Why is no real title available?)
- A Modified Split-Radix FFT With Fewer Arithmetic Operations
- A Polynomial Approach to Fast Algorithms for Discrete Fourier-Cosine and Fourier-Sine Transforms
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Architecture-oriented regular algorithms for discrete sine and cosine transforms
- Calculation scheme based on a weighted primitive: application to image processing transforms
- Constant geometry algorithm for discrete cosine transform
- Fast Fourier transforms: A tutorial review and a state of the art
- Fast and numerically stable algorithms for discrete cosine transforms
- On the multiplicative complexity of discrete cosine transforms
- Recursive cyclotomic factorization--A new algorithm for calculating the discrete Fourier transform
- Simple FFT and DCT algorithms with reduced number of operations.
- The Algebraic Approach to the Discrete Cosine and Sine Transforms and Their Fast Algorithms
- Two new algorithms based on product system for discrete cosine transform
- Type-II/III DCT/DST algorithms with reduced number of arithmetic operations
Cited In (1)
Uses Software
This page was built for publication: Improvement of the discrete cosine transform calculation by means of a recursive method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q969952)