MAP criterion trellis source coding for short data sequences
(2003) IEEE Data Compression Conference p.43-52- Abstract
- New trellis constructions for compression of short data sequences are presented. Traditional low rate trellis
source coding suffers from having a too small a reproduction alphabet. Governed by alphabet-constrained rate-distortion theory we propose a simple method
which for a source coding rate of 1 bit per sample allows 2n reconstruction values for a trellis with 2n states. The proposed method is based on the maximum a posteriori probability criterion distortion measure and it employs tailbiting. Simulation results are compared to TCQ-like methods.
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/628891
- author
- Eriksson, Tomas LU ; Novak, Mirek LU and Anderson, John B LU
- organization
- publishing date
- 2003
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- keywords
- minimum mean squared error, short data sequence, tail-biting BCJR algorithm, trellis coded quantization, TCQ-like method, alphabet-constrained rate-distortion theory, lossy source coding, data compression, trellis source coding, MAP criterion, maximum a posteriori, VA, tailbiting, Viterbi algorithm, MMSE
- host publication
- Proc., IEEE Data Compression Conf., Snowbird, UT
- pages
- 10 pages
- publisher
- IEEE - Institute of Electrical and Electronics Engineers Inc.
- conference name
- IEEE Data Compression Conference
- conference location
- Snowbird, UT, United States
- conference dates
- 2003-03-25 - 2003-03-27
- external identifiers
-
- wos:000182221500005
- scopus:2542620076
- ISBN
- 0-7695-1896-6
- DOI
- 10.1109/DCC.2003.1193995
- project
- Informations- och kommunikationsteori: Data- och bildkompression
- language
- English
- LU publication?
- yes
- id
- 1f4aa774-4072-4929-ae1f-109aaafd935e (old id 628891)
- date added to LUP
- 2016-04-04 11:18:30
- date last changed
- 2022-01-29 21:41:44
@inproceedings{1f4aa774-4072-4929-ae1f-109aaafd935e, abstract = {{New trellis constructions for compression of short data sequences are presented. Traditional low rate trellis<br/><br> source coding suffers from having a too small a reproduction alphabet. Governed by alphabet-constrained rate-distortion theory we propose a simple method<br/><br> which for a source coding rate of 1 bit per sample allows 2n reconstruction values for a trellis with 2n states. The proposed method is based on the maximum a posteriori probability criterion distortion measure and it employs tailbiting. Simulation results are compared to TCQ-like methods.}}, author = {{Eriksson, Tomas and Novak, Mirek and Anderson, John B}}, booktitle = {{Proc., IEEE Data Compression Conf., Snowbird, UT}}, isbn = {{0-7695-1896-6}}, keywords = {{minimum mean squared error; short data sequence; tail-biting BCJR algorithm; trellis coded quantization; TCQ-like method; alphabet-constrained rate-distortion theory; lossy source coding; data compression; trellis source coding; MAP criterion; maximum a posteriori; VA; tailbiting; Viterbi algorithm; MMSE}}, language = {{eng}}, pages = {{43--52}}, publisher = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}}, title = {{MAP criterion trellis source coding for short data sequences}}, url = {{https://lup.lub.lu.se/search/files/5743315/628922.ps}}, doi = {{10.1109/DCC.2003.1193995}}, year = {{2003}}, }