Approximate MAP Decoding on Tail-Biting Trellises

Simple item page
dc.creatorMadhu, A. S.
dc.creatorShankar, Priti
dc.date2005-06-03
dc.date.accessioned2026-07-07T08:15:27Z
dc.date.available2026-07-07T08:15:27Z
dc.descriptionWe 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.
dc.description5 pages, 2 figures, ISIT 2005
dc.identifierhttps://arxiv.org/abs/cs/0506009
dc.identifierhttp://arxiv.org/abs/cs/0506009
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133455
dc.subjectInformation Theory
dc.titleApproximate MAP Decoding on Tail-Biting Trellises
dc.typetext

Files

Collections

arXiv