One and Two Bit Message Passing for SC-LDPC Codes with Higher-Order Modulation

Fabian Steiner, Ben Yacoub, Emna, Balázs Matuz, Gianluigi Liva, Graell i Amat, Alexandre

Published Jan 1, 2019• 16 citations

Abstract

Low complexity decoding algorithms are necessary to meet data rate requirements in excess of 1 Tbps. In this paper, we study one and two bit message passing algorithms for belief propagation decoding of low-density parity-check (LDPC) codes and analyze them by density evolution. The variable nodes (VNs) exploit soft information from the channel output. To decrease the data flow, the messages exchanged between check nodes (CNs) and VNs are represented by one or two bits. The newly proposed quaternary message passing (QMP) algorithm is compared asymptotically and in finite length simulations to binary message passing (BMP) and ternary message passing (TMP) for spectrally efficient communication with higher-order modulation and probabilistic amplitude shaping (PAS). To showcase the potential for high throughput forward error correction, spatially coupled LDPC codes and a target spectral efficiency (SE) of 3 bits/QAM symbol are considered. Gains of about 0.7 dB and 0.1 dB are observed compared to BMP and TMP, respectively. The gap to unquantized belief propagation (BP) decoding is reduced to about 0.75 dB. For smaller code rates, the gain of QMP compared to TMP is more pronounced and amounts to 0.24 dB in the considered example.

Related papers

One and Two Bit Message Passing for SC-LDPC Codes With Higher-Order Modulation

Fabian Steiner, Emna Ben Yacoub, Balazs Matuz +2 more

arXiv:1902.10391Journal of Lightwave TechnologySep 24, 201921 citations

Quaternary Message Passing Decoding of LDPC Codes: Density Evolution Analysis and Error Floor

Emna Ben Yacoub, Balázs Matuz, Alexandre Graell i Amat +1 more

We revisit a coarsely quantized message passing decoding algorithm for low-density parity-check (LDPC) code ensembles, named quaternary message passing (QMP). Particularly, we analyze the performance of unstructured LDPC codes under QMP decoding by means of density evolution. The impact of degree-2 and degree-3 variable nodes on the error floor performance is also discussed. We design a code for QMP that performs within 0.55 dB of the 5G LDPC code at a block error rate of 10−4.

International Symposium on Turbo Codes and Iterative Information ProcessingAug 30, 20210 citations

Protograph-Based LDPC Code Design for Ternary Message Passing Decoding

Emna Ben Yacoub, Fabian Steiner, Balázs Matuz +1 more

A ternary message passing (TMP) decoding algorithm for low-density parity-check codes is developed. All messages exchanged between variable and check nodes have a ternary alphabet, and the variable nodes exploit soft information from the channel. A density evolution analysis is developed for unstructured and protograph-based ensembles. For unstructured ensembles the stability condition is derived. Optimized ensembles for TMP decoding show asymptotic gains of up to 0.6 dB with respect to ensembles optimized for binary message passing decoding. Finite length simulations of codes from TMP-optimized ensembles show gains of up to 0.5 dB under TMP compared to protograph-based codes designed for unquantized belief propagation decoding.

arXiv:1809.10910Sep 28, 201817 citations

Analysis of Binary and Ternary Message Passing Decoding for Generalized LDPC Codes

Emna Ben Yacoub, Gianluigi Liva

The performance of generalized low-density parity-check (GLDPC) codes under binary and ternary message passing decoding (BMP/TMP) is analyzed from a density evolution (DE) perspective. At the check nodes, two types of local decoders are considered, namely optimum a-posteriori probability (APP) soft-input soft-output decoding, and bounded distance decoding (BDD). The purpose is to shed light on the performance loss incurred by BMP and TMP decoding of GLDPC codes with respect to unquantized belief propagation (BP) decoding. A DE analysis for irregular code ensembles is developed for all the algorithms, which allows obtaining the scaling coefficients needed for the variable node operation of BMP and TMP decoders. The stability analysis for the case of bounded distance decoding at the check nodes is derived. The asymptotic DE analysis is confirmed by the finite-length simulation results. For the codes analyzed in this paper, which rely on extended Hamming component codes, the study shows that under BMP decoding, BDD at the check nodes yields almost the same performance as optimum APP check node processing, while under TMP decoding the loss incurred by the sub-optimum BDD at check nodes is within 0.7 dB, when compared with APP decoding at the check nodes.

IEEE Transactions on CommunicationsJul 5, 20231 citation

Analysis of Binary and Ternary Message Passing Decoding for Generalized LDPC Codes

Emna Ben Yacoub, Gianluigi Liva

Binary and a ternary message passing decoding algorithms for generalized low-density parity-check codes are defined and analyzed. In all algorithms, the variable nodes exploit soft channel information. However, the exchanged messages between variable and check nodes are binary or ternary. Two types of local decoders are assumed at the check nodes, namely an optimum a-posteriori probability soft-input soft-output decoder, and a more practical bounded distance decoder. A density evolution analysis for irregular code ensembles is developed for all the introduced algorithms, which allows obtaining the scaling coefficients needed for the variable node operation. Finite-length simulation results confirm the validity of the asymptotic analysis.

International Symposium on Problems of Redundancy in Information and Control Systems (REDUNDANCY)Oct 25, 20212 citations

Efficient Message Passing Decoding Using Vector-based Messages

Mikael Grimnell, Mats Tjäder

The family of Low Density Parity Check (LDPC) codes is a strong candidate to be used as Forward Error Correction (FEC) in future communication systems due to its strong error correction capability. Most LDPC decoders use the Message Passing algorithm for decoding, which is an iterative algorithm that passes messages between its variable nodes and check nodes. It is not until recently that computation power has become strong enough to make Message Passing on LDPC codes feasible. Although locally simple, the LDPC codes are usually large, which increases the required computation power. Earlier work on LDPC codes has been concentrated on the binary Galois Field, GF(2), but it has been shown that codes from higher order fields have better error correction capability. However, the most efficient LDPC decoder, the Belief Propagation Decoder, has a squared complexity increase when moving to higher order Galois Fields. Transmission over a channel with M-PSK signalling is a common technique to increase spectral efficiency. The information is transmitted as the phase angle of the signal. The focus in this Master’s Thesis is on simplifying the Message Passing decoding when having inputs from M-PSK signals transmitted over an AWGN channel. Symbols from higher order Galois Fields were mapped to M-PSK signals, since M-PSK is very bandwidth efficient and the information can be found in the angle of the signal. Several simplifications of the Belief Propagation has been developed and tested. The most promising is the Table Vector Decoder, which is a Message Passing Decoder that uses a table lookup technique for check node operations and vector summation as variable node operations. The table lookup is used to approximate the check node operation in a Belief Propagation decoder. Vector summation is used as an equivalent operation to the variable node operation. Monte Carlo simulations have shown that the Table Vector Decoder can achieve a performance close to the Belief Propagation. The capability of the Table Vector Decoder depends on the number of reconstruction points and the placement of them. The main advantage of the Table Vector Decoder is that its complexity is unaffected by the Galois Field used. Instead, there will be a memory space requirement which depends on the desired number of reconstruction points.

Jan 1, 20051 citation