Learning to Decode Linear Codes Using Deep Learning

07/16/2016
by   Eliya Nachmani, et al.
0

A novel deep learning method for improving the belief propagation algorithm is proposed. The method generalizes the standard belief propagation algorithm by assigning weights to the edges of the Tanner graph. These edges are then trained using deep learning techniques. A well-known property of the belief propagation algorithm is the independence of the performance on the transmitted codeword. A crucial property of our new method is that our decoder preserved this property. Furthermore, this property allows us to learn only a single codeword instead of exponential number of code-words. Improvements over the belief propagation algorithm are demonstrated for various high density parity check codes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/08/2018

Near Maximum Likelihood Decoding with Deep Learning

A novel and efficient neural decoder algorithm is proposed. The proposed...
research
06/21/2017

Deep Learning Methods for Improved Decoding of Linear Codes

The problem of low complexity, close to optimal, channel decoding of lin...
research
05/09/2023

Check Belief Propagation Decoding of LDPC Codes

Variant belief-propagation (BP) algorithms are applied to low-density pa...
research
10/02/2022

Belief propagation generalizes backpropagation

The two most important algorithms in artificial intelligence are backpro...
research
01/24/2019

Learned Belief-Propagation Decoding with Simple Scaling and SNR Adaptation

We consider the weighted belief-propagation (WBP) decoder recently propo...
research
01/23/2013

Loopy Belief Propagation for Approximate Inference: An Empirical Study

Recently, researchers have demonstrated that loopy belief propagation - ...
research
01/05/2015

Inverse Renormalization Group Transformation in Bayesian Image Segmentations

A new Bayesian image segmentation algorithm is proposed by combining a l...

Please sign up or login with your details

Forgot password? Click here to reset