论文标题
具有最佳双向距离轮廓的卷积代码
Convolutional Codes with Optimum Bidirectional Distance Profile
论文作者
论文摘要
我们将卷积代码的双向距离轮廓（BDP）定义为代码的距离配置文件的最小值及其相应的“反向”代码。我们以最佳的BDP（OBDP）为代码表，该表使双向顺序解码算法的平均复杂性最小化。较大内存的最佳距离概况（ODP）代码必须具有较小的内存的ODP代码作为“前缀”，并且可以通过“将” ODP和反向ODP代码获得较小的较小内存。我们通过模拟比较OBDP代码和其他代码的性能。
We define the bidirectional distance profile (BDP) of a convolutional code as the minimum of the distance profiles of the code and its corresponding "reverse" code. We present tables of codes with the optimum BDP (OBDP), which minimize the average complexity of bidirectional sequential decoding algorithms. The computer search is accelerated by the facts that optimum distance profile (ODP) codes of larger memory must have ODP codes of smaller memory as their "prefixes", and that OBDP codes can be obtained by "concatenating" ODP and reverse ODP codes of smaller memory. We compare the performance of OBDP codes and other codes by simulation.
