arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1701.05931cs.ITcs.LGmath.IT
收藏

神经偏移最小和译码

Neural Offset Min-Sum Decoding

McGill University(麦吉尔大学)

Loren Lugosch, Warren J. Gross

摘要:

最近,已经表明,如果将乘法权重分配给置信传播解码中使用的Tanner图的边缘,则可以使用深度学习技术来找到提高解码器的纠错性能的权重值。不幸的是,这种方法需要许多乘法,这通常是昂贵的操作。在本文中,我们提出了一个更硬件友好的方法,其中偏移最小和解码增强与可学习的偏移参数。我们的方法不使用乘法,并且具有小于乘法算法的一半的参数计数。这既加快了训练速度,又为硬件架构提供了可行的路径。在描述了我们的方法之后,我们比较了两种神经解码算法的性能,并表明我们的方法在乘法方法的0.1 dB内实现了纠错性能,并且对于所考虑的代码,比传统的置信传播好多达1 dB。

英文摘要:

Recently, it was shown that if multiplicative weights are assigned to the edges of a Tanner graph used in belief propagation decoding, it is possible to use deep learning techniques to find values for the weights which improve the error-correction performance of the decoder. Unfortunately, this approach requires many multiplications, which are generally expensive operations. In this paper, we suggest a more hardware-friendly approach in which offset min-sum decoding is augmented with learnable offset parameters. Our method uses no multiplications and has a parameter count less than half that of the multiplicative algorithm. This both speeds up training and provides a feasible path to hardware architectures. After describing our method, we compare the performance of the two neural decoding algorithms and show that our method achieves error-correction performance within 0.1 dB of the multiplicative approach and as much as 1 dB better than traditional belief propagation for the codes under consideration.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑