Reducing the Error Floor of the Sign-Preserving Min-Sum LDPC Decoder via Message Weighting of Low-Degree Variable Nodes

06/23/2022
by   Lotte Paulissen, et al.
0

Some low-complexity LDPC decoders suffer from error floors. We apply iteration-dependent weights to the degree-3 variable nodes to solve this problem. When the 802.3ca EPON LDPC code is considered, an error floor decrease of more than 3 orders of magnitude is achieved.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/14/2020

A Reconstruction-Computation-Quantization (RCQ) Approach to Node Operations in LDPC Decoding

In this paper, we propose a finite-precision decoding method that featur...
research
10/15/2020

Matched Quantized Min-Sum Decoding of Low-Density Parity-Check Codes

A quantized message passing decoding algorithm for low-density parity-ch...
research
03/02/2018

Low-Complexity Concatenated LDPC-Staircase Codes

A low-complexity soft-decision concatenated FEC scheme, consisting of an...
research
03/22/2022

The neighbour sum distinguishing edge-weighting with local constraints

A k-edge-weighting of G is a mapping ω:E(G)⟶{1,…,k}. The edge-weighting ...
research
07/09/2021

Neural-Network-Optimized Degree-Specific Weights for LDPC MinSum Decoding

Neural Normalized MinSum (N-NMS) decoding delivers better frame error ra...
research
06/14/2018

Fast Decoding of Low Density Lattice Codes

Low density lattice codes (LDLC) are a family of lattice codes that can ...
research
01/21/2023

Is Signed Message Essential for Graph Neural Networks?

Message-passing Graph Neural Networks (GNNs), which collect information ...

Please sign up or login with your details

Forgot password? Click here to reset