A construction of high rate punctured convolutional codes
A construction of high rate punctured convolutional codes
复制标题
DOI：
--
复制
发表时间：
2012-10
期刊：
影响因子：
--
通讯作者：
H. Sasano;S. Moriya
中科院分区：
文献类型：
--
作者：
H. Sasano;S. Moriya
我们考虑了两种构造高速删截卷积码的方法。首先，我们提出了最佳高码率R=(n-1)/n穿孔卷积码，当n=5，6，··，16时，我们通过穷举搜索找到了它们。为了得到最优码，我们使用一个规则卷积码，它的重量谱与每个删截卷积码的重量谱相等。我们搜索这些规则等价码，以寻找最好的一个。接下来，我们提出了一种通过部分搜索来搜索良好穿孔卷积码的方法。该方法搜索从第一种方法中获得的R=1/2个原始码派生的码。通过这种方法，我们得到了一些性能优于最优码的删截卷积码。
We consider two methods that construct high rate punctured convolutional codes. First, we present best high rate R = (n-1)/n punctured convolutional codes, for n = 5,6, · · ·, 16, which are found by exhaustive searches. To obtain the best code, we use a regular convolutional code whose weight spectrum is equivalent to that of each punctured convolutional code. We search these regular equivalent codes for the best one. Next, we present a method that searches for good punctured convolutional codes by partial searches. This method searches the codes that are derived from R = 1/2 original codes obtained in the first method. By this method, we obtain some good punctured convolutional codes that have superior performance compared with that of the best codes.