A generalized approach to linear transform approximations with applications to the discrete cosine transform

DOI10.1155/2008/736460zbMath1143.94317OpenAlexW2045435418WikidataQ59218558 ScholiaQ59218558MaRDI QIDQ938993

Yinpeng Chen, Hari Sundaram

Publication date: 28 August 2008

Published in: EURASIP Journal on Advances in Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2008/736460

Mathematics Subject Classification ID

Application of orthogonal and other special functions (94A11)

Cites Work

• A generalized output pruning algorithm for matrix-vector multiplication and its application to compute pruning discrete cosine transform
• A new two-dimensional fast cosine transform algorithm
• A fast cosine transform in one and two dimensions
• A new algorithm to compute the discrete cosine Transform
• On the multiplicative complexity of discrete cosine transforms
• Fast algorithms for the discrete cosine transform
• Efficient computation of the DFT with only a subset of input or output points
• Recursive pruning of the 2D DFT with 3D signal processing applications
• A Fast Computational Algorithm for the Discrete Cosine Transform
• Complexity distortion theory
• A novel generic fast Fourier transform pruning technique and complexity analysis
• Automated empirical optimizations of software and the ATLAS project

This page was built for publication: A generalized approach to linear transform approximations with applications to the discrete cosine transform