Binary Integer Discrete Cosine Transform Based on Multiplierless Lifting Structures
Chen Li · Journal of Shantou University · 2004
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.