Exact Hamming Distortion Analysis of Viterbi Encoded Trellis Coded Quantizers

Details Exact Hamming Distortion Analysis of Viterbi Encoded Trellis Coded Quantizers Exact Hamming Distortion Analysis of Viterbi Encoded Trellis Coded Quantizers

2010-10-06

arxiv.org/abs/1010.1286v1

Computer Science

Information Theory

Scientific paper

Let G be a finite strongly connected aperiodic directed graph in which each edge carries a label from a finite alphabet A. Then G induces a trellis coded quantizer for encoding an alphabet A memoryless source. A source sequence of long finite length is encoded by finding a path in G of that length whose sequence of labels is closest in Hamming distance to the source sequence; finding the minimum distance path is a dynamic programming problem that is solved using the Viterbi algorithm. We show how a Markov chain can be used to obtain a closed form expression for the asymptotic expected Hamming distortion per sample that results as the number of encoded source samples increases without bound.

Affiliated with

Also associated with

No associations

Rating

Exact Hamming Distortion Analysis of Viterbi Encoded Trellis Coded Quantizers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Exact Hamming Distortion Analysis of Viterbi Encoded Trellis Coded Quantizers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Exact Hamming Distortion Analysis of Viterbi Encoded Trellis Coded Quantizers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-508479