Binary Message Passing Decoding of Product-Like Codes

Sheikh, Alireza; Amat, Alexandre Graell i; Liva, Gianluigi

doi:10.1109/tcomm.2019.2940180

Cited by 38 publications

(44 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Practical decoder implementations may also quantize the weighting factors or share the same weighting factors for several iterations. Similar decoding approaches for product codes [6] suggest only minimal performance degradation in this case [33].…”

Section: B Initialization Of Density Evolution For Different Bit Chamentioning

confidence: 92%

“…For the described algorithms, we denote by m ( ) c→v the message sent from CN c to its neighboring VN v at theth iteration. Similarly, m ( ) v→c is the message sent from VN v to CN c. The soft information at the input of the decoder for the j-th coded bit is denoted by l dec,j and calculated according to (6).…”

Section: E Protograph-based Spatially Coupled Ldpc Codesmentioning

confidence: 99%

“…To exploit the soft-information from the channel, while still only exchanging binary messages during the iterations of BDD, the authors of [6] weight the HD output of the component decoders and recombine it with the soft-information from the channel, after which another HD is made. Similar approaches were also considered in [7], [8], where soft information from the channel is used to exploit particularly reliable and unreliable bits to improve the miscorrection-detection capability of the BDD decoder.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

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

Steiner

Yacoub

Matuz

et al. 2019

J. Lightwave Technol.

Self Cite

View full text Add to dashboard Cite

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.Index Terms-Quantized LDPC decoders, binary message passing, ternary message passing, quaternary message passing, higher-order modulation, probabilistic amplitude shaping

show abstract

Section: B Initialization Of Density Evolution For Different Bit Chamentioning

confidence: 92%

Section: E Protograph-based Spatially Coupled Ldpc Codesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

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

Steiner

Yacoub

Matuz

et al. 2019

J. Lightwave Technol.

Self Cite

View full text Add to dashboard Cite

show abstract

“…Therefore, in order to reduce the optimization search space, we only consider vectors w with monotonically increasing entries. iBDD-SR also requires scaling factors (see [12], [19]). In this case, the scaling factors can be derived using density evolution [13], [19].…”

Section: Numerical Resultsmentioning

confidence: 99%

“…We remark that the performance of iBDD-SR inFig. 3is improved compared to[15], since in this paper we use the optimized scaling factors based on the density evolution derived in[19], rather than based on Monte-Carlo simulations as in[15].…”

mentioning

confidence: 99%

Binary Message Passing Decoding of Product Codes Based on Generalized Minimum Distance Decoding : (Invited Paper)

Sheikh

Amat

Liva

2019

2019 53rd Annual Conference on Information Sciences and Systems (CISS)

Self Cite

View full text Add to dashboard Cite

We propose a binary message passing decoding algorithm for product codes based on generalized minimum distance decoding (GMDD) of the component codes, where the last stage of the GMDD makes a decision based on the Hamming distance metric. The proposed algorithm closes half of the gap between conventional iterative bounded distance decoding (iBDD) and turbo product decoding based on the Chase-Pyndiah algorithm, at the expense of some increase in complexity. Furthermore, the proposed algorithm entails only a limited increase in data flow compared to iBDD.

show abstract