Loading [a11y]/accessibility-menu.js
Learning to Decode LDPC Codes with Finite-Alphabet Message Passing | IEEE Conference Publication | IEEE Xplore

Learning to Decode LDPC Codes with Finite-Alphabet Message Passing


Abstract:

In this paper, we discuss the perspectives of utilizing deep neural networks (DNN) to decode Low-Density Parity Check (LDPC) codes. The main idea is to build a neural net...Show More

Abstract:

In this paper, we discuss the perspectives of utilizing deep neural networks (DNN) to decode Low-Density Parity Check (LDPC) codes. The main idea is to build a neural network to learn and optimize a conventional iterative decoder of LDPC codes. A DNN is based on Tanner graph, and the activation functions emulate message update functions in variable and check nodes. We impose a symmetry on weight matrices which makes it possible to train the DNN on a single codeword and noise realizations only. Based on the trained weights and the bias, we further quantize messages in such DNN-based decoder with 3-bit precision while maintaining no loss in error performance compared to the min-sum algorithm. We use examples to present that the DNN framework can be applied to various code lengths. The simulation results show that, the trained weights and bias make the iterative DNN decoder converge faster and thus achieve higher throughput at the cost of trivial additional decoding complexity.
Date of Conference: 11-16 February 2018
Date Added to IEEE Xplore: 25 October 2018
ISBN Information:
Conference Location: San Diego, CA, USA

Contact IEEE to Subscribe

References

References is not available for this document.