Fast Multiplierless Approximation Of The DCT

Trac Duy Tran · 1999

In this paper, we present a fast biorthogonal block transform called binDCT that can be implemented using only shift and add operations. The transform is based on a VLSI-friendly lattice structure which robustly enforces both linear phase and perfect reconstruction properties. The lattice coefficients are parameterized as a series of dyadic lifting steps, providing fast, efficient in-place computation of the transform coefficients as well as the ability to map integers to integers. The new 8 \\Theta 8 transform approximates closely the popular 8 \\Theta 8 1D DCT, attaining a coding gain of 8.77 dB, despite requiring a modest amount of computations: 14 shifts and 31 additions per 8 input samples. Application of the novel transform in both lossy and lossless image coding yields very competitive results comparing to the performance of the original floating-point DCT. 1. INTRODUCTION Block transforms have long found application in image and video coding. The current image compression standa...

Read the paper · More papers on PaperTik