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 $O(S_thspace{5 mm}log {(S_t)})$ and where $S_t$ is the total number of states of the tail-biting trellis.