论文标题
卷积代码位的上限和下限
Upper and Lower Bounds on Bit-Error Rate for Convolutional Codes
论文作者
论文摘要
在本文中，我们为二进制对称通道（BSC）中VITERBI解码的卷积代码进行了卷积代码的分析估计提供了一种新方法。我们为上下BER边界获得的表达式基于代码的主动距离及其距离频谱。估计值是针对具有速率$ r = \ frac {1} {2} $的卷积代码得出的，但是可以轻松地将任何卷积代码概括为带有速率$ r = \ frac 1n $的卷积代码和系统编码器。对于BSC通道和卷积代码内存的任何交叉概率而言，建议的方法在计算上并不昂贵，并且可以获得BER的精确估计。
In this paper, we provide a new approach to the analytical estimation of the bit-error rate (BER) for convolutional codes for Viterbi decoding in the binary symmetric channel (BSC). The expressions we obtained for lower and upper BER bounds are based on the active distances of the code and their distance spectrum. The estimates are derived for convolutional codes with the rate $R=\frac{1}{2}$ but can be easily generalized for any convolutional code with rate $R=\frac 1n$ and systematic encoder. The suggested approach is not computationally expensive for any crossover probability of BSC channel and convolutional code memory, and it allows to obtain precise estimates of BER.
