pith. sign in

arxiv: 2002.07601 · v1 · pith:FKV2E2IWnew · submitted 2020-02-14 · 💻 cs.IT · cs.LG· eess.SP· math.IT· stat.ML

ADMM-based Decoder for Binary Linear Codes Aided by Deep Learning

classification 💻 cs.IT cs.LGeess.SPmath.ITstat.ML
keywords deepcodesdecoderlinearnetworkaidedbinarydecoding
0
0 comments X
read the original abstract

Inspired by the recent advances in deep learning (DL), this work presents a deep neural network aided decoding algorithm for binary linear codes. Based on the concept of deep unfolding, we design a decoding network by unfolding the alternating direction method of multipliers (ADMM)-penalized decoder. In addition, we propose two improved versions of the proposed network. The first one transforms the penalty parameter into a set of iteration-dependent ones, and the second one adopts a specially designed penalty function, which is based on a piecewise linear function with adjustable slopes. Numerical results show that the resulting DL-aided decoders outperform the original ADMM-penalized decoder for various low density parity check (LDPC) codes with similar computational complexity.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.