On the Complexity of Exact Maximum Likelihood Decoding on Tail-Biting Trellises

Shankar, Priti (2004) On the Complexity of Exact Maximum Likelihood Decoding on Tail-Biting Trellises. In: International Symposium on Information Theory, 2004. ISIT 2004, 27 June-2 July, Chicago, 104 -104.

Preview

PDF On_the_complexity.pdf Download (219kB)

Abstract

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

Item Type:	Conference Paper
Publisher:	IEEE
Additional Information:	©1990 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	09 Dec 2005
Last Modified:	19 Sep 2010 04:21
URI:	http://eprints.iisc.ac.in/id/eprint/4344

Actions (login required)

View Item