Fast 2-D 8×8 discrete cosine transform algorithm for image coding  

作　　者：JI XiuHua ZHANG CaiMing WANG JiaYe BOEY S. H. 

机构地区：[1]Fast 2-D 8×8 discrete cosine transform algorithmfor image coding1 School of Computer Science and Technology, Shandong Economic University, Jinan 250014, China [2]School of Computer Science and Technology, Shandong University, Jinan 250061, China

出　　处：《Science in China(Series F)》2009年第2期215-225,共11页中国科学（F辑英文版）

基　　金：Supported by the National Basic Research Program of China (Grant No.2006CB303102);the National Natural Science Foundation of China(Grant Nos.60573114,60533030 and 60573181)

摘　　要：A new fast two-dimension 8×8 discrete cosine transform （2D 8×8 DCT） algorithm based on the characteristics of the basic images of 2D DCT is presented. The new algorithm computes each DCT coefficient in turn more independently. Hence, the new algorithm is suitable for 2D DCT pruning algorithm of pruning away any number of high-frequency components of 2D DCT. The proposed pruning algorithm is more efficient than the existing pruning 2D DCT algorithms in terms of the number of arithmetic operations, especially the number of multiplications required in the computation.A new fast two-dimension 8×8 discrete cosine transform （2D 8×8 DCT） algorithm based on the characteristics of the basic images of 2D DCT is presented. The new algorithm computes each DCT coefficient in turn more independently. Hence, the new algorithm is suitable for 2D DCT pruning algorithm of pruning away any number of high-frequency components of 2D DCT. The proposed pruning algorithm is more efficient than the existing pruning 2D DCT algorithms in terms of the number of arithmetic operations, especially the number of multiplications required in the computation.

关 键 词：discrete cosine transform basic image QUANTIZATION image coding 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术]