摘要
§1.引言 离散余弦变换(DCT)有趋于统计最佳交换Kavhunven-Lave变换(KLT)的渐近性质,在通信和信号处理中应用广泛,并在许多方面比离散富里叶变换(DFT)更好。
This paper proposes an algorithm for computing Ⅱ type discrete cosinetransform (DCT-Ⅱ) of arbitrary length. If the length of the DCT-ⅡisN=2′p′_1~1p′_2^(2…)P′_s^sthe algorithm needs 1/2 Nl+N sum from i=1 to s m(Pi)+2Pi-2/Pi li multiplications and3/2 Nl-2l+1+N sum from to s a(Pi)+3Pi-3/Pi liadditions, where m(pi) and a(Pi) represent the number of multiplications andadditions for computingrespectively.
出处
《计算数学》
CSCD
北大核心
1993年第3期295-302,共8页
Mathematica Numerica Sinica