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)的一种新的快速算法，其特点是变换长度任意，而且采用蝶形结构。

youdao

This paper compares between the 32-point DCT decomposition method and the property of cosine function to find the latter more efficient for DCT fast algorithm.

本文在研究DCT快速算法的基础上，比较了32点dct分解和利用余弦函数特性两种快速计算dct的方法。

youdao

The fast algorithm based on discrete cosine transform (DCT) and its complexity are obtained and the selection of the best basis is discussed.

给出了用离散余弦变换(DCT)实现的快速算法及复杂度，并考查了最优基的选取。

youdao