二进制整数离散余弦变换无乘法提升阶梯算法

Binary Integer Discrete Cosine Transform Based on Multiplierless Lifting Structures

研究了一种基于二进制整数离散余弦变换的无乘法快速和高效算法 ,新算法同时对实现提升阶梯中涉及的系数进行了分式化和截“1”近似 ,对带来的误差进行了实验分析 ,实现了加法器总数的优化 .实验表明通过构造无乘法提升阶梯替代传统的递归平面旋转变换的算法降低了系统的运算复杂度 ,同时提高了算法的实时性 .

In this paper,a fast algorithm for multiplier-less binary integer approximation of discrete cosine transform is presented.The errors in the process when the multiplier coefficients in the lifting structures are converted to binary fractions are analyzed in experiments and the truncation errors are also studied.The lifting structures are realized with minimized additions.Compared with recursive algorithms based on plane rotations,the 3lifting structures reduce the computational complexity in real-time realization of the algorithm.