嵌入法构造线性分组码咬尾网格

An Embedding Method to Construct Tail-Biting Trellises for Linear Block Codes

给出一种新的咬尾网格构造方法——嵌入法.该方法把一个线性分组码的咬尾网格嵌入到另一个线性分组码的传统网格中,从而很多咬尾网格问题可以转化为传统网格问题.证明每个咬尾网格都可以通过反复使用嵌入法从传统BCJR网格得到.最后讨论在网格中含有1个峰值情形时,采用嵌入法如何将峰值减半.

Embedding construction of tail-biting trellises for linear block codes is presented. With the new approach of con- structing tail-biting trellises,most of the study of tail-biting trellises can be converted into that of conventional trellises.It is proved that any minimal tail-biting trellis can be constructed by the recursive process of embedding constructions from the weU-known Bahl-Cocke-Jelinek-Raviv（BCJR）constructed conventional trellises. Fanlhermore, several properties of embedding constructions of tail-biting trellises are discussed. Finally, we give a sufficient condition to reduce the maximum state-complexity of a trellis with one peak.