Learned Belief-Propagation Decoding with Simple Scaling and SNR Adaptation
arXiv:1901.08621 · doi:10.1109/ISIT.2019.8849419
Abstract
We consider the weighted belief-propagation (WBP) decoder recently proposed by Nachmani et al. where different weights are introduced for each Tanner graph edge and optimized using machine learning techniques. Our focus is on simple-scaling models that use the same weights across certain edges to reduce the storage and computational burden. The main contribution is to show that simple scaling with few parameters often achieves the same gain as the full parameterization. Moreover, several training improvements for WBP are proposed. For example, it is shown that minimizing average binary cross-entropy is suboptimal in general in terms of bit error rate (BER) and a new "soft-BER" loss is proposed which can lead to better performance. We also investigate parameter adapter networks (PANs) that learn the relation between the signal-to-noise ratio and the WBP parameters. As an example, for the (32,16) Reed-Muller code with a highly redundant parity-check matrix, training a PAN with soft-BER loss gives near-maximum-likelihood performance assuming simple scaling with only three parameters.
arXiv comment5 pages, 5 figures, submitted to ISIT 2019
References in corpus (1)
Cited by in corpus (13)
- End-to-End Learning for VCSEL-based Optical Interconnects: State-of-the-Art, Challenges, and Opportunities
- Reinforcement Learning for Channel Coding: Learned Bit-Flipping Decoding
- Recent Advances in Deep Learning for Channel Coding: A Survey
- Successive Cancellation Inactivation Decoding for Modified Reed-Muller and eBCH Codes
- Decoding Short LDPC Codes via BP-RNN Diversity and Reliability-Based Post-Processing
- Erasure Decoding for Quantum LDPC Codes via Belief Propagation with Guided Decimation
- perm2vec: Graph Permutation Selection for Decoding of Error Correction Codes using Self-Attention
- Quaternary Neural Belief Propagation Decoding of Quantum LDPC Codes with Overcomplete Check Matrices
- Learned Decimation for Neural Belief Propagation Decoders
- Neural-Network-Optimized Degree-Specific Weights for LDPC MinSum Decoding
- Structural Optimization of Factor Graphs for Symbol Detection via Continuous Clustering and Machine Learning
- PR-NN: RNN-based Detection for Coded Partial-Response Channels
- A Novel Sum-Product Detection Algorithm for Faster-than-Nyquist Signaling: A Deep Learning Approach