Approximate MAP Decoding on Tail-Biting Trellises
Information Theory
2007-07-13 v1 math.IT
Abstract
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 Extended Golay Code and a rate 1/2 convolutional code with memory 6.
Cite
@article{arxiv.cs/0506009,
title = {Approximate MAP Decoding on Tail-Biting Trellises},
author = {A. S. Madhu and Priti Shankar},
journal= {arXiv preprint arXiv:cs/0506009},
year = {2007}
}
Comments
5 pages, 2 figures, ISIT 2005