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.

翻译：本文介绍了一套基于美元点低复杂度变换生成2N美元点DCT-II近似值的缩放方法,这种缩放方法基于精确的2N美元点DCT-II矩阵的Hou递转矩阵因子化法;结合广泛使用的Jidi-Alfalou-Meher缩放法,显示拟议技术产生了DCT-II近似法,该近似法根据总误差能量和平均平方误差优于JAM缩放法的变异法;根据统计模拟得出了矫形条件,并进行了广泛的误差分析,表明采用的缩放法表现良好;还提供了硬件实施,表明与JAM缩放法相比,拟议方法的竞争力。