Approximate MAP Decoding on Tail-Biting Trellises

Details Approximate MAP Decoding on Tail-Biting Trellises Approximate MAP Decoding on Tail-Biting Trellises

2005-06-03

arxiv.org/abs/cs/0506009v1

Computer Science

Information Theory

5 pages, 2 figures, ISIT 2005

Scientific paper

We propose two approximate algorithms for MAP decoding on tail-biting
trellises. The algorithms work on a subset of nodes of the tail-biting trellis,
judiciously selected. We report the results of simulations on an AWGN channel
using the approximate algorithms on tail-biting trellises for the $(24,12)$
Extended Golay Code and a rate 1/2 convolutional code with memory 6.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-403161