On the error exponent of trellis source coding

In this paper, we develop a single-letter lower bound on the error exponent for the problem of trellis source coding. We demonstrate that for the case of a binary source with the Hamming distortion measure, and for rates close to the rate-distortion curve, this bound is superior to Marton's block-coding exponent, for the same computational complexity.

[1]  Thomas R. Fischer.  On the rate-distortion efficiency of subband coding , 1992, IEEE Trans. Inf. Theory.

[2]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[3]  Michael W. Marcellin,et al.  On entropy-constrained trellis coded quantization , 1994, IEEE Trans. Commun..

[4]  Robert M. Gray,et al.  Sliding-block joint source/noisy-channel coding theorems , 1976, IEEE Trans. Inf. Theory.

[5]  David L. Neuhoff,et al.  Process definitions of distortion-rate functions and source coding theorems , 1975, IEEE Trans. Inf. Theory.

[6]  Gottfried Ungerboeck,et al.  Channel coding with multilevel/phase signals , 1982, IEEE Trans. Inf. Theory.

[7]  Nader Moayeri,et al.  Trellis coded vector quantization , 1992, IEEE Trans. Commun..

[8]  Katalin Marton,et al.  Error exponent for source coding with a fidelity criterion , 1974, IEEE Trans. Inf. Theory.

[9]  Robert M. Gray,et al.  Time-invariant trellis encoding of ergodic discrete-time sources with a fidelity criterion , 1977, IEEE Trans. Inf. Theory.

[10]  V.W.S. Chan,et al.  Principles of Digital Communication and Coding , 1979 .

[11]  Andrew J. Viterbi,et al.  Principles of Digital Communication and Coding , 1979 .

[12]  R. Gray,et al.  Vector quantization , 1984, IEEE ASSP Magazine.

[13]  Toby Berger,et al.  Rate distortion theory : a mathematical basis for data compression , 1971 .

[14]  Michael W. Marcellin,et al.  Trellis coded quantization of memoryless and Gauss-Markov sources , 1990, IEEE Trans. Commun..

[15]  Andrew J. Viterbi,et al.  Error bounds for convolutional codes and an asymptotically optimum decoding algorithm , 1967, IEEE Trans. Inf. Theory.

[16]  Min Wang,et al.  Trellis-coded quantization designed for noisy channels , 1994, IEEE Trans. Inf. Theory.

[17]  Zhen Zhang,et al.  Variable-Rate Trellis Source Encoding , 1998, IEEE Trans. Inf. Theory.

[18]  Min Wang,et al.  Entropy-constrained trellis-coded quantization , 1992, IEEE Trans. Inf. Theory.

[20]  Neri Merhav,et al.  On the error exponent of trellis source coding , 2005, ISIT.

[21]  Thomas R. Fischer,et al.  A New Trellis Source Code for Memoryless Sources , 1998, IEEE Trans. Inf. Theory.

[22]  Amir Dembo,et al.  Large Deviations Techniques and Applications , 1998 .

[23]  Robert M. Gray,et al.  The Design of Trellis Waveform Coders , 1982, IEEE Trans. Commun..

[24]  Andrew J. Viterbi,et al.  Trellis Encoding of memoryless discrete-time sources with a fidelity criterion , 1974, IEEE Trans. Inf. Theory.

[25]  Rudolf Ahlswede,et al.  Extremal properties of rate distortion functions , 1990, IEEE Trans. Inf. Theory.

[26]  Robert M. Gray,et al.  Sliding-block source coding , 1975, IEEE Trans. Inf. Theory.

[27]  Zhen Zhang,et al.  The redundancy of source coding with a fidelity criterion: 1. Known statistics , 1997, IEEE Trans. Inf. Theory.

[28]  Zhen Zhang,et al.  On the redundancy of trellis lossy source coding , 2002, IEEE Trans. Inf. Theory.

[29]  Frederick Jelinek.  Tree encoding of memoryless time-discrete sources with a fidelity criterion , 1969, IEEE Trans. Inf. Theory.

[30]  Zhen Zhang,et al.  Variable rate trellis source encoding , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[31]  R. Gray,et al.  Nonblock Source Coding with a Fidelity Criterion , 1975 .