CHEBYSHEV POLYNOMIAL DERIVATION OF COMPOSITE-LENGTH DCT ALGORITHMS

被引：0
|
作者：
STEIDL, G
机构：
[1] Universität Rostock, Fachbereich Mathematik, O- 2500 Rostock
来源：
SIGNAL PROCESSING | 1992年 / 29卷 / 01期
关键词：
FAST COSINE TRANSFORM; CHEBYSHEV POLYNOMIALS; FAST POLYNOMIAL ALGORITHM;
D O I：
10.1016/0165-1684(92)90096-F
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
Due to their increasing application in digital signal processing and numerical analysis many fast algorithms for the discrete cosine transform (DCT) have been developed. Nevertheless, direct fast algorithms do not exist for DCTs of length N=p' if p>2. This paper presents novel fast algorithms for DCTs of different single- and mixed-radix lengths by using a polynomial approach to the DCT which is mainly based on properties of Chebyshev polynomials.
引用
收藏
页码：17 / 27
页数：11
相关论文
共 22 条
123