arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2108.02119eess.SPcs.ARcs.CCcs.MMeess.IV
收藏

DCT-II近似的低复杂度缩放方法

Low-complexity Scaling Methods for DCT-II Approximations

D. F. G. Coelho, R. J. Cintra, A. Madanayake, S. Perera

AI总结:

本文提出基于Hou递归分解的2N点DCT-II近似缩放方法,涵盖并优于JAM方法,通过误差分析和硬件实现验证了其低复杂度和良好性能。

摘要:

本文介绍了一组缩放方法,用于基于N点低复杂度变换生成2N点DCT-II近似。这种缩放基于精确2N点DCT-II矩阵的Hou递归矩阵分解。所提出的技术涵盖了广泛使用的Jridi-Alfalou-Meher缩放方法,并显示出产生的DCT-II近似在总误差能量和均方误差方面优于JAM缩放方法产生的变换。推导了正交性条件,并基于统计模拟进行了广泛的误差分析,证明了所引入缩放方法的良好性能。还提供了硬件实现,展示了所提方法在与JAM缩放方法相比时的竞争力。

英文摘要:

This paper introduces a collection of scaling methods for generating $2N$-point DCT-II approximations based on $N$-point low-complexity transformations. Such scaling is based on the Hou recursive matrix factorization of the exact $2N$-point DCT-II matrix. Encompassing the widely employed Jridi-Alfalou-Meher scaling method, the proposed techniques are shown to produce DCT-II approximations that outperform the transforms resulting from the JAM scaling method according to total error energy and mean squared error. Orthogonality conditions are derived and an extensive error analysis based on statistical simulation demonstrates the good performance of the introduced scaling methods. A hardware implementation is also provided demonstrating the competitiveness of the proposed methods when compared to the JAM scaling method.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑