Nori, Aditya V and Shankar, Priti (2006) Unifying Views of Tail-Biting Trellis Constructions for Linear Block Codes. In: IEEE Transactions on Information Theory, 52 (10). pp. 4431-4443.
In this paper, we present new ways of describing and constructing linear tail-biting trellises for block codes. We extend the well-known Bahl–Cocke–Jelinek–Raviv (BCJR) construction for conventional trellises to tail-biting trellises. The BCJR-like labeling scheme yields a simple specification for the tail-biting trellis for the dual code, with the dual trellis having the same state-complexity profile as that of the primal code . Finally, we show that the algebraic specification of Forney for state spaces of conventional trellises has a natural extension to tail-biting trellises.
|Item Type:||Journal Article|
|Additional Information:||Copyright 2006 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.|
|Keywords:||Terms—Block codes;Displacement matrix;Duality;Linear trellises;Nonmergeable trellises;Tail-biting trellises|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)|
|Date Deposited:||25 Aug 2008|
|Last Modified:||19 Sep 2010 04:32|
Actions (login required)