Approximate MAP Decoding on Tail-Biting Trellises
classification
💻 cs.IT
math.IT
keywords
tail-bitingalgorithmsapproximatetrellisescodedecodingawgnchannel
read the original 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 $(24,12)$ Extended Golay Code and a rate 1/2 convolutional code with memory 6.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.