一种高效4×4二维DCT快速算法

An Efficient Fast 2-D 4×4 DCT Algorithm

提出了一种新的高效 4× 4二维离散余弦变换 (DCT)的快速算法 .该算法具有极低的计算复杂性和简单、规则的结构 .由于大部分乘法运算集中在末级 ,所以 ,实际应用中的比例和量化可以和这些乘法结合在一起 .因此 ,算法适合用软件和硬件实现 .实验结果表明 ,该算法比其他算法具有更高的计算效率 .由于其高效率 ,该算法可作为递归二维离散余弦变换算法的核心模块 .

This paper proposes a new efficient 4×4 2 D algorithm for the computation of discrete cosine transform (DCT). The algorithm has less operational complexity, and involves simple and regular structure. Most of the multiplications can be done in the last stage of the realization; hence the property gives us some extra advantages for scaling and quantization. The algorithm is suitable for implementation by using both software and hardware. Experimental results show that the algorithm is more efficient as compared to other algorithms. Because of its high efficiency, the algorithm may be used as a kernel of recursive 2_D DCT algorithms.