一种基于任意长离散余弦变换的并行递归算法

A Kind of Fast Recursive Algorithm for the Discrete Cosine Transform with Arbitrary Length

基于Clenshaw递归公式以及离散余弦自身的对称性提出任意长离散余弦变换(DCT)的一种并行递归快速算法,给出了算法的滤波器实现结构;与现有的其它递归算法进行了计算复杂度的比较分析,结果表明我们的算法运算量大大减少且计算的滤波器结构使算法非常适合大规模集成电路(VLSI)的实现.

A fast recursive algorithm is proposed in this paper for the realization of Discrete Cosine Transforms （DCT） with arbitrary length that jointly using Clenshaw recurrence formula and the sym- metry of DCT. Compared with other existed recursive algorithms and the method of arithmetic Fourier transform for computing DCT, the proposed algorithm holds a lower computation complexity. With regular digital filters structures, the algorithm is also effective for VLSI implementation.