Efficient Convergent Maximum Likelihood Decoding on Tail-Biting Trellises

Details Efficient Convergent Maximum Likelihood Decoding on Tail-Biting Trellises Efficient Convergent Maximum Likelihood Decoding on Tail-Biting Trellises

2006-01-09

arxiv.org/abs/cs/0601023v2

Computer Science

Information Theory

23 pages, 8 figures, Submitted to IEEE Transactions on Information Theory. Figures 7 and 8 replaced

Scientific paper

An algorithm for exact maximum likelihood(ML) decoding on tail-biting trellises is presented, which exhibits very good average case behavior. An approximate variant is proposed, whose simulated performance is observed to be virtually indistinguishable from the exact one at all values of signal to noise ratio, and which effectively performs computations equivalent to at most two rounds on the tail-biting trellis. The approximate algorithm is analyzed, and the conditions under which its output is different from the ML output are deduced. The results of simulations on an AWGN channel for the exact and approximate algorithms on the 16 state tail-biting trellis for the (24,12) Extended Golay Code, and tail-biting trellises for two rate 1/2 convolutional codes with memories of 4 and 6 respectively, are reported. An advantage of our algorithms is that they do not suffer from the effects of limit cycles or the presence of pseudocodewords.

Affiliated with

Also associated with

No associations

Rating

Efficient Convergent Maximum Likelihood Decoding on Tail-Biting Trellises 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 Efficient Convergent Maximum Likelihood Decoding on Tail-Biting Trellises, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient Convergent Maximum Likelihood Decoding on Tail-Biting Trellises will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-683645