On the fixed-point error analysis of several fast IDCT algorithms

Abstract

In this paper, a fixed-point error analysis for wellknown fast 1-D IDCT algorithms, such as Lee, Hou, and Vetterli, are presented. For a comparison purpose, a direct-form method is also included in our investigation. Based on the 1-D analysis, the fixed-point error analysis of the row-column method and the Cho-Lee algorithm are also investigated for 2-D IDCT. Closedform expressions for the rounding error variances are derived and compared with the experimental results. There is a close agreement between the theory and experiment, demonstrating that the analysis presented in this paper is valid. In addition, we also discuss on the minimum word length to satisfy IEEE's requirements for the implementation of 8 x 8 IDCT.