MAP criterion trellis source coding for short data sequences

Author

Eriksson, Tomas ; Novak, Mirek ; Anderson, Jhon B.

Author_Institution

Dept. of Inf. Technol., Lund Univ., Sweden

fYear

2003

fDate

25-27 March 2003

Firstpage

43

Lastpage

52

Abstract

New trellis constructions for compression of short data sequences are presented. Traditional low rate trellis source coding suffer from having a too small reproduction alphabet. Governed by alphabet-constrained rate-distortion theory a simple method was proposed for a source coding rate of 1 bit per sample that allows 2^m reconstruction values for a trellis with 2^m states. The proposed method is based on the maximum a posteriori probability criterion distortion measure and it employs tailbiting. Tailbiting makes the method suitable also for short data sequences. Simulation results are compared to TCQ-like methods.

Keywords

maximum likelihood estimation; rate distortion theory; sequences; source coding; trellis codes; MAP criterion; MMSE; TCQ-like method; VA; Viterbi algorithm; alphabet-constrained rate-distortion theory; data compression; lossy source coding; maximum a posteriori; minimum mean squared error; short data sequence; tail-biting BCJR algorithm; tailbiting; trellis coded quantization; trellis source coding; Data compression; Source coding;

fLanguage

English

Publisher

ieee

Conference_Titel

Data Compression Conference, 2003. Proceedings. DCC 2003

ISSN

1068-0314

Print_ISBN

0-7695-1896-6

Type

conf

DOI

10.1109/DCC.2003.1193995

Filename

1193995