任意2^n阶列率递增顺序斜变换及其快速算法与应用

Arbitrary 2n Order Slant Transform with Sequency Increment and Its Fast Algorithm and Application

本文分析了斜变换基矢量按列率递增顺序排列的规律,给出了任意2n阶列率递增顺序斜变换的公式及其快 速算法,使斜变换理论完备化。将该算法应用于图像压缩,其变换域数据的熵接近常用的离散余弦变换,但运算速度较快。 该算法适用于需要高速处理和硬件实现的正交变换场合。

This paper analyses the rule of the base vector alignment in sequency increment for slant transform, gives the equations and the fast algorithm for this kind of slant transform of arbitrary 2n orders, makes the slant transform theory more consummate. Using this algorithm to image compression, the data entropy in transform domain approaches that of the commonly used DCT, but the operation speed is faster. This algorithm is suitable for orthogonal transform where high speed and hardware implementation are required.