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

In this paper, a fixed-point error analysis for well-known fast l-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 l-D analysis, the fixed-point error analysis of the row-column method and the Cho-Lee algorithm are also investigated for 2-D IDCT. Closed-form 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 the minimum word length to satisfy requirements for the implementation of 8/spl times/8 IDCT.<
>