Tail-biting massey trellis construction for block codes

摘要

It was Aditya V. Nori and Priti Shankar's achievement to extend the well-known BCJR and Forney construction algorithms for minimal conventional trellis to tail-biting trellis respectively. In this artical, based on the Massey construction we present an effective and significative algorithm for constructing TB-Massey trellis, a key step in our work is discoverying that in effect V0 = Vn(mod n), where V0 is the vertex set for i=0 in the trellis. This renews the work of Nori and Shankar in aspect of other noted construction algorithm for minimal conventional trellis. We also show the properties of resultant trellis and discuss its performance by comparing with T-BCJR trellis and T-Forney trellis