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

Author

Yun, Dong ; Lee, Sang Uk

Author_Institution

Signal Process. Lab., Seoul Nat. Univ., South Korea

Volume

42

Issue

11

fYear

1995

fDate

11/1/1995 12:00:00 AM

Firstpage

685

Lastpage

693

Abstract

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×8 IDCT

Keywords

data compression; digital arithmetic; discrete cosine transforms; error analysis; image coding; roundoff errors; 2D IDCT; Cho-Lee algorithm; IDCT algorithms; closed-form expressions; data compression; direct-form method; fixed-point error analysis; image coding; rounding error variances; row-column method; Algorithm design and analysis; Discrete cosine transforms; Discrete transforms; Error analysis; Fixed-point arithmetic; Image coding; Karhunen-Loeve transforms; Roundoff errors; Signal processing algorithms; Transform coding;

fLanguage

English

Journal_Title

Circuits and Systems II: Analog and Digital Signal Processing, IEEE Transactions on

Publisher

ieee

ISSN

1057-7130

Type

jour

DOI

10.1109/82.475243

Filename

475243