MAP criterion trellis source coding for short data sequences

• 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.

Subject headings

TEKNIK OCH TEKNOLOGIER  -- Elektroteknik och elektronik (hsv//swe)

ENGINEERING AND TECHNOLOGY  -- Electrical Engineering, Electronic Engineering, Information Engineering (hsv//eng)

Keyword

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

Publication and Content Type

kon (subject category)

ref (subject category)