DeepAI AI Chat
Log In Sign Up

Learning to Decode Linear Codes Using Deep Learning

by   Eliya Nachmani, et al.
Tel Aviv University

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.


page 1

page 2

page 3

page 4


Near Maximum Likelihood Decoding with Deep Learning

A novel and efficient neural decoder algorithm is proposed. The proposed...

Deep Learning Methods for Improved Decoding of Linear Codes

The problem of low complexity, close to optimal, channel decoding of lin...

Learned Decimation for Neural Belief Propagation Decoders

We introduce a two-stage decimation process to improve the performance o...

Belief propagation generalizes backpropagation

The two most important algorithms in artificial intelligence are backpro...

Learned Belief-Propagation Decoding with Simple Scaling and SNR Adaptation

We consider the weighted belief-propagation (WBP) decoder recently propo...

Loopy Belief Propagation for Approximate Inference: An Empirical Study

Recently, researchers have demonstrated that loopy belief propagation - ...

Active Deep Decoding of Linear Codes

High quality data is essential in deep learning to train a robust model....