论文标题
关于使用本地图搜索解码芦苇毛刺代码
On Decoding of Reed-Muller Codes Using a Local Graph Search
论文作者
论文摘要
我们提出了一种用于Reed-Muller（RM）代码的新型迭代解码算法，该算法利用了代码的图表。所考虑的图的顶点对应于编码字，当且仅当相应的编码字之间的锤击距离等于代码的最小距离时，两个顶点由边缘连接。该算法使用贪婪的本地搜索来找到一个优化度量的节点，例如接收的向量与相应的代码字之间的相关性。此外，一旦找到有效的密码字，可以使用环状冗余检查来终止搜索，从而改善算法的平均计算复杂性。 Simulation results for both binary symmetric channel and additive white Gaussian noise channel show that the presented decoder approaches the performance of maximum likelihood decoding for RM codes of length less than 1024 and for the second-order RM codes of length less than 4096. Moreover, it is demonstrated that the considered decoding approach outperforms state-of-the-art decoding algorithms of RM codes with similar computational complexity for a wide range of块长度和费率。
We present a novel iterative decoding algorithm for Reed-Muller (RM) codes, which takes advantage of a graph representation of the code. Vertices of the considered graph correspond to codewords, with two vertices being connected by an edge if and only if the Hamming distance between the corresponding codewords equals the minimum distance of the code. The algorithm uses a greedy local search to find a node optimizing a metric, e.g. the correlation between the received vector and the corresponding codeword. In addition, the cyclic redundancy check can be used to terminate the search as soon as a valid codeword is found, leading to an improvement in the average computational complexity of the algorithm. Simulation results for both binary symmetric channel and additive white Gaussian noise channel show that the presented decoder approaches the performance of maximum likelihood decoding for RM codes of length less than 1024 and for the second-order RM codes of length less than 4096. Moreover, it is demonstrated that the considered decoding approach outperforms state-of-the-art decoding algorithms of RM codes with similar computational complexity for a wide range of block lengths and rates.
