Approximate Linear Time ML Decoding on Tail-Biting Trellises in Two Rounds

Details Approximate Linear Time ML Decoding on Tail-Biting Trellises in Two Rounds Approximate Linear Time ML Decoding on Tail-Biting Trellises in Two Rounds

2006-01-30

arxiv.org/abs/cs/0601126v1

Proc. ISIT 2006, pp.2245-2249

Computer Science

Information Theory

Scientific paper

A linear time approximate maximum likelihood decoding algorithm on tail-biting trellises is prsented, that requires exactly two rounds on the trellis. This is an adaptation of an algorithm proposed earlier with the advantage that it reduces the time complexity from O(mlogm) to O(m) where m is the number of nodes in the tail-biting trellis. A necessary condition for the output of the algorithm to differ from the output of the ideal ML decoder is reduced and simulation results on an AWGN channel using tail-biting rrellises for two rate 1/2 convoluational codes with memory 4 and 6 respectively are reported

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-14141