Multiplierless Fast DCT Algorithms
(M. C. Lee)

The Discrete Cosine Transform (DCT) can be considered one of the most widely used transforms in image and video compression. Recently, the approximation or implementation of multiplierless DCT algorithms has attracted much interest in the related research. Since a multiplierless implementation involves only shift-and-add operations, it requires a simpler hardware design; and such multiplierless algorithms would involve a relatively small power consumption in mobile devices. A multiplierless fast DCT algorithm can be considered as an approximate version of its original floating point fast DCT algorithm. Therefore, how to convert a fast DCT algorithm into its multiplierless version with good performance is a critical issue. This issue has not been well addressed in the literature. This project aims to devise effective algorithms to convert fast DCT algorithms into their equivalent approximate multiplierless versions.