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