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.

PDF file

In: IEEE Transactions on Information Theory

Publisher: IEEE Communications Society
Copyright © 2007 IEEE. Reprinted from IEEE Communications Society. This material is posted here with permission of the IEEE. Internal or 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 must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.

Details