In this paper, a new fast algorithm to calculate discrete cosine transform (DCT) with arbitrary length by means of the butterfly structure is presented.
本文提出离散余弦变换(DCT)的一种新的快速算法，其特点是变换长度任意，而且采用蝶形结构。
The fast algorithm based on discrete cosine transform (DCT) and its complexity are obtained and the selection of the best basis is discussed.
给出了用离散余弦变换(DCT)实现的快速算法及复杂度，并考查了最优基的选取。
应用推荐