Low coefficient complexity approximations of the one dimensional discrete cosine transform

Author

Fox, Trevor K. ; Turner, Laurence E.

Author_Institution

Dept. of Electr. & Comput. Eng., Calgary Univ., Alta., Canada

Volume

1

fYear

2002

fDate

6/24/1905 12:00:00 AM

Abstract

A method for the design of arbitrarily exact Discrete Cosine Transform (DCT) approximations that permits perfect reconstruction using fixed point arithmetic is presented. Simple quantization of floating point precision coefficients typically leads to DCT approximations which fail to meet the coding gain, Mean Square Error (MSE), and coefficient complexity (number of coefficient adders and subtractors) specifications. It is shown that it is possible to design DCT approximations with near optimal coding gains that meets the MSE and coefficient complexity requirements. Finite precision effects are discussed for these DCT approximations.

Keywords

approximation theory; computational complexity; discrete cosine transforms; fixed point arithmetic; mean square error methods; signal reconstruction; 1D DCT approximations; MSE requirements; coding gain specifications; coefficient complexity specifications; discrete cosine transform; finite precision effects; fixed point arithmetic; low coefficient complexity approximations; mean square error specifications; near optimal coding gains; one dimensional DCT; perfect reconstruction; Design methodology; Discrete cosine transforms; Energy measurement; Fixed-point arithmetic; Gain measurement; Hardware; Image reconstruction; Mean square error methods; PSNR; Quantization;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems, 2002. ISCAS 2002. IEEE International Symposium on

Print_ISBN

0-7803-7448-7

Type

conf

DOI

10.1109/ISCAS.2002.1009833

Filename

1009833