作　　者： ;

机构地区： 华南理工大学

出　　处： 《信号处理》 1992年第2期105-111,共7页

摘　　要： 本文利用多项式变换和切匹雪夫多项式变换计算2-D DCT来推导2-D DCT的乘法复杂性。证明在有理数域上计算2~m×2~m 2-D DCT所需的最小实数乘法次数为2^(2m+1)-m2~m-2^(m+1),并说明利用多项式变换和切匹雪夫多项式变换计算2-D DCT的乘法复杂性是相同的。 In this paper, we develop the multiplicative complexity of the two-dimensional discrete cosine transform of length N=2~m by use of the polynomial transform computation and the Chebyshev polynomial trans- form computation. We prove that the minimal number of real multiplieations necessary to compute a 2~m×2~m two-dimensional discrete cosine transformover the field Q of rational numbers is equal to 2^(2m+1)-m2~m-2^(m+1). The method of derivation is shown that the polynomial transform computation and the Chebryshev polynomial transform computation have the same multiplicative complexity.

关 键 词： 算法 复杂性 乘法

领　　域： [自动化与计算机技术] [自动化与计算机技术]