The Chebyshev polynomial fitting properties of discrete cosine transform

被引:4
作者
Hu, XY [1 ]
Yu, XH [1 ]
机构
[1] Southeast Univ, Natl Commun Res Lab, Nanjing, Peoples R China
关键词
discrete cosine transform; least-squares approximation; Chebyshev polynomial;
D O I
10.1016/S0923-5965(97)00044-1
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this paper, the least-squares approximation/fitting aspects of discrete cosine transform (DCT) are identified and analyzed. Through constructing a monovariant function skillfully defined on a discrete set, we obtain a specified series expansion which is a combination of Chebyshev polynomials. It will be shown that the corresponding Chebyshev polynomial expansion is exactly a mathematical equivalence of DCT. (C) 1998 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:15 / 20
页数:6
相关论文
共 6 条
[1]   DISCRETE COSINE TRANSFORM [J].
AHMED, N ;
NATARAJAN, T ;
RAO, KR .
IEEE TRANSACTIONS ON COMPUTERS, 1974, C 23 (01) :90-93
[2]  
Ahmed N, 1975, ORTHOGONAL TRANSFORM
[3]  
AKANSU AN, 1992, MULTIRESOLUTION SIGN, P9
[4]  
Cheney EW., 1966, INTRO APPROXIMATION
[5]   FAST KARHUNEN-LOEVE TRANSFORM FOR A CLASS OF RANDOM PROCESSES [J].
JAIN, AK .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1976, 24 (09) :1023-1029
[6]  
JAIN AK, 1981, P IEEE, V69, P249