On the performance evaluation of trellis codes
On the performance evaluation of trellis codes
复制标题
网格编码的性能评估
DOI：
10.1109/tit.1987.1057292
复制
发表时间：
1987
期刊：
影响因子：
--
通讯作者：
J. Wolf
中科院分区：
文献类型：
--
作者：
E. Zehavi;J. Wolf
考虑了用于分析错误事件的生成功能技术和格子码的位纠纷概率。线性代码的常规状态图方法，其中状态数量等于网格状态的数量不能直接应用于任意格子码，而是状态图等于状态的数量等于等于平方的状态图。必须使用格子状态。结果表明，对于一类有趣的格子代码，可以定义修改的生成函数，用于该函数的数量{\ em等于}格子状态的数量。所考虑的代码类包括速率r =（n-1）/n的格式代码。相互距离。计算此修改的生成函数的复杂性与具有相同数量的格子状态的卷积代码的普通生成函数相同。基于此方法给出了一些有趣代码的性能的界限。
Generating function techniques for analyzing the error event and the bit-error probabilities for trellis codes are considered. The conventional state diagram approach for linear codes where the number of states is equal to the number of trellis states cannot be applied directly to arbitrary trellis codes, and instead, a state diagram where the number of states is equal to the square of the number of trellis states must be used. It is shown that for an interesting class of trellis codes a modified generating function can be defined for which the number of states {\em is equal to} the number of trellis states. The class of codes considered includes trellis codes of rate R=(n-1)/n based upon set partitioning whenever the first partition breaks the signal constellation into two subsets which have the same "configuration matrix," i.e., the same ordered set of mutual distances. The complexity of calculating this modified generating function is the same as for the ordinary generating function of a convolutional code with the same number of trellis states. Bounds on the performance of some interesting codes are given based upon this method.
影响因子：
2.5
作者：
UNGERBOECK, G
通讯作者：
UNGERBOECK, G