On the complexity of exact maximum likelihood decoding on tail-biting trellises

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/sub t/ log(S/sub t/)) and where S/sub t/ is the total number of states of the tail-biting trellis.