The multiplicative complexity of discrete cosine transforms
From MaRDI portal
Publication:1802353
DOI10.1016/0196-8858(92)90023-PzbMATH Open0772.65096MaRDI QIDQ1802353FDOQ1802353
Authors: Ephraim Feig, Elliot Linzer
Publication date: 21 July 1993
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
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
tensor productdirect sumdiscrete cosine transformsdiscrete Fourier transformsMultiplicative complexity
Complexity and performance of numerical algorithms (65Y20) Numerical methods for discrete and fast Fourier transforms (65T50)
Cites Work
- Title not available (Why is that?)
- Simple FFT and DCT algorithms with reduced number of operations.
- Title not available (Why is that?)
- On Computing the Discrete Fourier Transform
- On the multiplicative complexity of the discrete Fourier transform
- The multiplicative complexity of certain semilinear systems defined by polynomials
- The multiplicative complexity of the discrete Fourier transform
- Computation of an odd-length DCT from a real-valued DFT of the same length
Cited In (7)
- Title not available (Why is that?)
- Algorithms meeting the lower bounds on the multiplicative complexity of length-2/sup n/ DFTs and their connection with practical algorithms
- Multiplicative complexity of length-2mtwo-dimensional discrete cosine transform
- Input and output index mappings for a prime-factor-decomposed computation of discrete cosine transform
- On the realization of discrete cosine transform using the distributed arithmetic
- On the multiplicative complexity of discrete cosine transforms
- Title not available (Why is that?)
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)