2 research outputs found
On the Complexity of Exact Maximum Likelihood Decoding on Tail-Biting Trellises
We analyze an algorithm for exact maximum likelihood decoding on tail-biting trellises is analyzed and shows that under certain conditions exact maximum likelihood decoding has time complexity and where is the total number of states of the tail-biting trellis