The multiplicative complexity of discrete cosine transforms
From MaRDI portal
(Redirected from Publication:1802353)
Recommendations
- On the multiplicative complexity of discrete cosine transforms
- A new algorithm to compute the discrete cosine Transform
- Multiplicative complexity of length-2mtwo-dimensional discrete cosine transform
- Algorithms meeting the lower bounds on the multiplicative complexity of length-2/sup n/ DFTs and their connection with practical algorithms
- Multiplicative complexity of discrete cosine and sine transform
Cites work
- scientific article; zbMATH DE number 3839315 (Why is no real title available?)
- scientific article; zbMATH DE number 193953 (Why is no real title available?)
- Computation of an odd-length DCT from a real-valued DFT of the same length
- On Computing the Discrete Fourier Transform
- On the multiplicative complexity of the discrete Fourier transform
- Simple FFT and DCT algorithms with reduced number of operations.
- The multiplicative complexity of certain semilinear systems defined by polynomials
- The multiplicative complexity of the discrete Fourier transform
Cited in
(7)- On the realization of discrete cosine transform using the distributed arithmetic
- Input and output index mappings for a prime-factor-decomposed computation of discrete cosine transform
- Multiplicative complexity of length-2mtwo-dimensional discrete cosine transform
- On the multiplicative complexity of discrete cosine transforms
- scientific article; zbMATH DE number 847093 (Why is no real title available?)
- scientific article; zbMATH DE number 193953 (Why is no real title available?)
- Algorithms meeting the lower bounds on the multiplicative complexity of length-2/sup n/ DFTs and their connection with practical algorithms
This page was built for publication: The multiplicative complexity of discrete cosine transforms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1802353)