线性分组码网格图状态复杂度研究

Study of State-Complexty of Trellises for Linear Block Codes

介绍线性分组码的传统网格和咬尾网格定义,给出一种新的构造咬尾网格方法--陪集归并法,该方法能一次减少几个连续时刻的状态数。举例说明如何用这种方法构造咬尾网格。讨论在网格中含有1个峰值情形下,采用陪集归并法如何将峰值减半,且具体给出网格中含有2到4个连续峰值时如何将峰值减半的方法。

The definitions of conventional BC3R trellis and tail-biting trellis are started with. Next, a new way, called coset merge, to construct tail-biting trellises is shown. By using this method, half of the number of several continuous vertex-states can be reduced. How to construct tail-biting trellises by examples is also shown. Finally, how to reduce half of the state-complexity of a trellis with one peak is considered and an approach for trellises with 2 to 4 continuous peaks is also given.