Isomorphic Constructions of Tail-Biting Trellises for Linear Block Codes
Jianqin Zhou, Tomoaki Otsuki Ohtsuki · 2007
In this paper, a new approach of constructing tail- biting trellises for linear block codes is presented. It is proved that any minimal tail-biting trellis can be constructed by the recursive process of uniting two isomorphic subgraphs from the well-known Bahl-Cocke-Jelinek-Raviv(BCJR) constructed conventional trellises. Furthermore, several properties of isomorphic constructions of tail-biting trellises are discussed.