Tail-Biting Code/Error-Trellis Construction for Linear Block Codes

摘要

In this paper, we present a tail-biting error-trellis construction for linear block codes. The proposed construction is quite general and can be applied to tail-biting code-trellises as well. It is shown that our method is a kind of the BCJR-construction introduced by Nori and Shankar. Displacement vectors which are used for the construction of a tail-biting error-trellis are obtained in the natural manner. For a block code derived from a tail-biting convolutional code, we show that a displacement matrix for a tail-biting code-trellis can be directly computed using the corresponding scalar generator and parity-check matrices. In the same situation, displacement vectors for the construction of a tail-biting error-trellis are also derived in a similar way.