Design of Capacity-Approaching Low-Density Parity-Check Codes using Recurrent Neural Networks
This work addresses a domain-specific problem in coding theory for communication systems, offering a configurable and efficient design method, though it is incremental as it builds on existing DE and RNN techniques.
The paper tackles the problem of designing capacity-approaching irregular Low-Density Parity-Check (LDPC) codes for binary erasure channels by modeling Density Evolution (DE) with Recurrent Neural Networks (RNNs), resulting in improved asymptotic performance and complexity compared to traditional differential evolution methods.
In this paper, we model Density Evolution (DE) using Recurrent Neural Networks (RNNs) with the aim of designing capacity-approaching Irregular Low-Density Parity-Check (LDPC) codes for binary erasure channels. In particular, we present a method for determining the coefficients of the degree distributions, characterizing the structure of an LDPC code. We refer to our RNN architecture as Neural Density Evolution (NDE) and determine the weights of the RNN that correspond to optimal designs by minimizing a loss function that enforces the properties of asymptotically optimal design, as well as the desired structural characteristics of the code. This renders the LDPC design process highly configurable, as constraints can be added to meet applications' requirements by means of modifying the loss function. In order to train the RNN, we generate data corresponding to the expected channel noise. We analyze the complexity and optimality of NDE theoretically, and compare it with traditional design methods that employ differential evolution. Simulations illustrate that NDE improves upon differential evolution both in terms of asymptotic performance and complexity. Although we focus on asymptotic settings, we evaluate designs found by NDE for finite codeword lengths and observe that performance remains satisfactory across a variety of channels.