Discrete Cosine Transform - Algorithms, Advantages, Applications

@inproceedings{Rao1990DiscreteCT,
  title={Discrete Cosine Transform - Algorithms, Advantages, Applications},
  author={K. R. Rao and Patrick C. Yip},
  year={1990}
}
  • K. Rao, P. Yip
  • Published 11 September 1990
  • Computer Science, Engineering
View via Publisher
arxiv.org
2,030 Citations
Highly Influential Citations
124
Background Citations
370
Methods Citations
457
Results Citations
7

2,030 Citations

Citation Type

Citation Type

Integer discrete cosine transform and its fast algorithm
TLDR
A recursive sparse matrix decomposition for a floating-point discrete cosine transform (DCT) matrix is presented and a split-radix DCT algorithm is proposed and a new integer DCT algorithms that requires only lifting steps and additions is developed.
A refined fast 2-D discrete cosine transform algorithm
An index permutation-based fast two-dimensional discrete cosine transform (2-D DCT) algorithm is presented. It is shown that the N/spl times/N 2-D DCT, where N=2/sup m/, can be computed using only N…
Normal bases expansion of the discrete cosine transform
TLDR
It is shown that the discrete cosine transform (DCT) can be obtained by projecting the discrete Fourier transform from the extension field to the basefield by applying the framework of projection operator.
A comparison of fast inverse discrete cosine transform algorithms
TLDR
Different styles of implementations of fast inverse DCTs designed especially for sparse data and compares them on workstation processors are described.
On the Discrete Cosine Transform of Weakly Stationary Signals
TLDR
The transformed autocorrelation matrix has half of its elements equal to zero, which means that it is possible to improve current DCT signal processing systems by means of more efficient implementation and algorithms.
Algorithm 749: fast discrete cosine transform
An in-place algorithm for the fast, direct computation of the forward and inverse discrete cosine transform is presented and evaluated. The transform length may be an arbitrary power of two.
On the discrete cosine transform computation
  • V. Britanak
  • Engineering, Computer Science
    Signal Process.
  • 1994
Systolic array for fast computation of discrete cosine transform
TLDR
A novel approach to perform DCT in terms of discrete moments and a systolic array for computing DCT with only a few multiplications and without any cosine evaluations has been proposed.
Comparison of Image Approximation Methods : Fourier Transform , Cosine Transform , Wavelets Packet and Karhunen-Loeve Transform
TLDR
Several transform coding methods commonly used in image compression systems are compared for the effectiveness as measured by rate-distortion ratio and the complexity of computation.
Fast DCT-based algorithms for signal convolution and translation
Fast DCT-based algorithms are presented for signal convolution and translation that are virtually free of boundary effects, characteristic for corresponding DFT-based fast algorithms. The properties…
...
1
2
3
4
5
...