The Improvement of TB-MASSEY Trellis Algorithm for Linear Codes

The well-known Forney algorithm, Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm and product construction for minimal linear conventional trellises have all successfully extended to tail-biting trellises. As first author of this paper, one of my paper, in a way, popularized Massey construction of minimal linear conventional trellises to tail-biting trellises, just referred as TB-Massey trellises. In this paper, we make some necessary and important optimization and improvement of TB-Massey trellises, mainly via elaborately constricting vertexes of the trellis graph as far as possible. Then display performance of all kinds of the extended tail-biting trellises by comparison. Though having not found the thorough generalized tail-biting Massey trellises, we get some positive progress and results.