Short-block variable-length trellis quantization

Summary, in English

We present two methods for variable-rate trellis quantization. Both methods utilize trellis codes based on linear congruential (LC) recursions. LC code trellises have good pseudo-random properties and are easily adapted to serve reconstruction alphabets of different sizes. The first method finds an entropy-constrained code only by optimizing over a scale factor. The scale factor

modifies an initial reproducer alphabet in order to skew the associated set of codeword lengths. Using a Lagrangian formulation and the maximum a posteriori

(MAP) heuristic, we also develop an entropy-constrained trellis quantizer suitable for short blocks of data. Here the tailbiting BCJR algorithm is used to find the MAP path in the trellis. Simulation results for the Gaussian and Laplacian distributions show that the proposed method is competitive with the best in the literature.

• Author: Tomas Eriksson; Mirek Novak; John B Anderson
• Department/s: Department of Electrical and Information Technology
• Publishing year: 2005
• Language: English
• Pages: 251-260
• Publication/Series: Proc., 2005 IEEE Data Compression Conf., Snowbird
• Full text: - 229 kB; Download statistics
• Links: http://dx.doi.org/10.1109/DCC.2005.81
• Document type: Conference paper
• Publisher: IEEE - Institute of Electrical and Electronics Engineers Inc.
• Topic: Electrical Engineering, Electronic Engineering, Information Engineering
• Keywords: Data compression; trellis codes; BCJR algorithm; maximum a posteriori probability; rate-distortion theory
• Conference name: 2005 IEEE Data Compression Conf.
• Conference date: 2005-03-29 - 2005-03-31
• Status: Published
• Project: Informations- och kommunikationsteori: Data- och bildkompression
• Research group: Informations- och kommunikationsteori
• ISBN/ISSN/Other: ISSN: 1068-0314; ISBN: 0-7695-2309-9