Learning to decode linear codes using deep learning

By Eliya Nachmani, Yair Be’ery, David Burshtein. Allerton Conference on Communication, Control, and Computing, 2016

521 citations recorded by the source corpus.

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 codewords. Improvements over the belief propagation algorithm are demonstrated for various high density parity check codes.

Subfields: Computer Networks and Communications, Molecular Biology

View Paper: https://www.semanticscholar.org/paper/1ddd174935c7bb4f0c341273f541da14cf8aa5d8

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

  1. Geoffrey Y. Li
  2. Jakob Hoydis
  3. Rui Zhang
  4. Emil Björnson
  5. Gan Zheng
  6. Jiangzhou Wang
  7. Le Liang
  8. Biing-Hwang Fred Juang

In Molecular Biology

  1. Geoffrey Y. Li
  2. Biing-Hwang Fred Juang
  3. Hao Ye
  4. Neev Samuel
  5. Ami Wiesel
  6. Tzvi Diskin
  7. Tim O'Shea
  8. Nariman Farsad

Citations in the corpus