Short-block variable-length trellis quantization
(2005) 2005 IEEE Data Compression Conf. p.251-260- Abstract
- 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.... (More) - 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. (Less)
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/633653
- author
- Eriksson, Tomas LU ; Novak, Mirek LU and Anderson, John B LU
- organization
- publishing date
- 2005
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- keywords
- Data compression, trellis codes, BCJR algorithm, maximum a posteriori probability, rate-distortion theory
- host publication
- Proc., 2005 IEEE Data Compression Conf., Snowbird
- pages
- 10 pages
- publisher
- IEEE - Institute of Electrical and Electronics Engineers Inc.
- conference name
- 2005 IEEE Data Compression Conf.
- conference dates
- 2005-03-29 - 2005-03-31
- external identifiers
-
- wos:000229070000026
- ISSN
- 1068-0314
- ISBN
- 0-7695-2309-9
- DOI
- 10.1109/DCC.2005.81
- project
- Informations- och kommunikationsteori: Data- och bildkompression
- language
- English
- LU publication?
- yes
- id
- 0e1e4764-de9e-4c07-bc53-e167ab76bf6d (old id 633653)
- date added to LUP
- 2016-04-01 16:14:54
- date last changed
- 2020-06-16 15:05:09
@inproceedings{0e1e4764-de9e-4c07-bc53-e167ab76bf6d, abstract = {{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<br/><br> modifies an initial reproducer alphabet in order to skew the associated set of codeword lengths. Using a Lagrangian formulation and the maximum a posteriori<br/><br> (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 = {{Eriksson, Tomas and Novak, Mirek and Anderson, John B}}, booktitle = {{Proc., 2005 IEEE Data Compression Conf., Snowbird}}, isbn = {{0-7695-2309-9}}, issn = {{1068-0314}}, keywords = {{Data compression; trellis codes; BCJR algorithm; maximum a posteriori probability; rate-distortion theory}}, language = {{eng}}, pages = {{251--260}}, publisher = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}}, title = {{Short-block variable-length trellis quantization}}, url = {{https://lup.lub.lu.se/search/files/4614927/633690.pdf}}, doi = {{10.1109/DCC.2005.81}}, year = {{2005}}, }