This paper presents new schemes to reduce the computation of the discrete cosine transform (DCT) with negligible peak-signal-to-noise ratio (PSNR) degradation. The methods can be used in the software implementation of current video standard encoders, for example, H.26x and MPEG. We investigated the relationship between the quantization parameters and the position of the last nonzero DCT coefficient after quantization. That information is used to adaptively make the decision of calculating all 8/spl times/8 DCT coefficients or only part of the coefficients. To further reduce the computation, instead of using the exact DCT coefficients, we propose a method to approximate the DCT coefficients which leads to significant computation savings. The results show that for practical situations, significant computation reductions can be achieved while causing negligible PSNR degradation. The proposed method also results in computation savings in the quantization calculations.
[1]
Wen-Hsiung Chen,et al.
A Fast Computational Algorithm for the Discrete Cosine Transform
,
1977,
IEEE Trans. Commun..
[2]
Athanassios N. Skodras,et al.
The vector-radix fast cosine transform: Pruning and complexity analysis
,
1995,
Signal Process..
[3]
N. Cho,et al.
Fast algorithm and implementation of 2-D discrete cosine transform
,
1991
.
[4]
Zhongde Wang,et al.
Pruning the fast discrete cosine transform
,
1991,
IEEE Trans. Commun..
[5]
Athanassios N. Skodras.
Fast discrete cosine transform pruning
,
1994,
IEEE Trans. Signal Process..