Maximum Likelihood Decoding of Block Codes on their Tail-Biting Trellises
Priti Shankar, P.N.A. Kumar, K. Sasidharan and B.S. Rajan
IISc-CSA-TR-2003-3
(February 2003) Available formats: [ps] [ps.gz]
Filed on June 21, 2004
Updated on June 21, 2004
An exact maximum likelihood decoding algorithm is presented for tail-biting
trellises for block codes. The algorithm works in two phases. The first phase
is a Viterbi trial on the tail-biting trellis, which provides estimates that
the second phase which is an A$^*$ algorithm uses to compute the most likely
codeword. Detailed simulation results are presented for two block codes.
These indicate that the estimates computed in the first phase greatly reduce
the search space in the second phase.
Please bookmark this technical report as http://aditya.csa.iisc.ernet.in/TR/2003/3/.Problems ? Contact techrep@csa.iisc.ernet.in
[Updated at 2009-10-22T06:42Z]