Low coefficient complexity approximations of the one dimensional discrete cosine transform

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.

[1]  Khalid Sayood,et al.  Introduction to Data Compression , 1996 .

[2]  L. Jackson.  Digital filters and signal processing , 1985 .

[3]  Jiro Katto,et al.  Performance evaluation of subband coding and optimization of its filter coefficients , 1991, J. Vis. Commun. Image Represent..

[4]  T. Tran,et al.  The binDCT: fast multiplierless approximation of the DCT , 2000, IEEE Signal Processing Letters.

[5]  Jie Liang,et al.  Approximating the DCT with the lifting scheme: systematic design and applications , 2000, Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154).

[6]  Trac D. Tran,et al.  Fast multiplierless approximations of the DCT with the lifting scheme , 2001, IEEE Trans. Signal Process..

[7]  R. Hartley.  Subexpression sharing in filters using canonic signed digit multipliers , 1996 .

[8]  W. Sweldens.  The Lifting Scheme: A Custom - Design Construction of Biorthogonal Wavelets "Industrial Mathematics , 1996 .

[9]  G.S. Moschytz,et al.  Practical fast 1-D DCT algorithms with 11 multiplications , 1989, International Conference on Acoustics, Speech, and Signal Processing,.

[10]  I. Daubechies,et al.  Factoring wavelet transforms into lifting steps , 1998 .

[11]  Laurence E. Turner,et al.  The design of peak constrained least squares FIR filters with low complexity finite precision coefficients , 2001, ISCAS 2001. The 2001 IEEE International Symposium on Circuits and Systems (Cat. No.01CH37196).