Approximate MAP Decoding on Tail-Biting Trellises
<|reference_start|>Approximate MAP Decoding on Tail-Biting Trellises: 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.<|reference_end|>
@article{madhu2005approximate,
    title={Approximate MAP Decoding on Tail-Biting Trellises},
    author={A. S. Madhu, Priti Shankar},
    journal={arXiv preprint arXiv:cs/0506009},
    year={2005},
    archivePrefix={arXiv},
    eprint={cs/0506009},
    primaryClass={cs.IT math.IT}
}