摘要
该文基于Clenshaw递归公式以及离散余弦自身的对称性提出任意长离散余弦变换(DCT)的一种并行递归快速算法,给出了该算法的滤波器实现结构;与现有的其它递归算法以及基于算术傅里叶变换的余弦变换算法进行了计算复杂度的比较分析,结果表明该文算法运算量大大减少。该递归计算的滤波器结构使算法非常适合大规模集成电路(VLSI)实现。
A fast recursive algorithm is proposed in this paper for the realization of Discrete Cosine Transforms （DCT） with arbitrary length jointly using Clenshaw recurrence formula and the symmetry of DCT. Compared with other exiting 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.
出处
《电子与信息学报》
EI
CSCD
北大核心
2007年第2期418-420,共3页
Journal of Electronics & Information Technology
