The multiplicative complexity of discrete cosine transforms

DOI10.1016/0196-8858(92)90023-PMaRDI QIDQ1802353zbMATH OpenFDO

Authors Ephraim Feig, Elliot Linzer

Publication date 21 July 1993

Published in Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-8858(92)90023-P

zbMATH Keywords

direct sumdiscrete cosine transformsdiscrete Fourier transformsMultiplicative complexitytensor product

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Complexity and performance of numerical algorithms (65Y20)

Review text

Multiplicative complexity of the discrete cosine transforms is evaluated in relation to that of the discrete Fourier transforms. The complexity measure is defined here to be the minimum number of non-rational multiplications required to compute jointly the real and imaginary outputs of the product of an arbitrary real vector by a complex matrix.

Recommendations

• On the multiplicative complexity of discrete cosine transforms
• A new algorithm to compute the discrete cosine Transform
• Multiplicative complexity of length-2^mtwo-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

• Computation of an odd-length DCT from a real-valued DFT of the same length
• scientific article; zbMATH DE number 3839315 (Why is no real title available?)
• scientific article; zbMATH DE number 193953 (Why is no real title available?)
• 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

(8)

• Algorithms meeting the lower bounds on the multiplicative complexity of length-2/sup n/ DFTs and their connection with practical algorithms
• Input and output index mappings for a prime-factor-decomposed computation of discrete cosine transform
• Multiplicative complexity of discrete cosine and sine transform
• Multiplicative complexity of length-2^mtwo-dimensional discrete cosine transform
• On the multiplicative complexity of discrete cosine transforms
• On the realization of discrete cosine transform using the distributed arithmetic
• scientific article; zbMATH DE number 193953 (Why is no real title available?)
• scientific article; zbMATH DE number 847093 (Why is no real title available?)

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)