LAUSR

About LAUSR
Donate
Contact Us

Follow us:

You are not signed in:

Sign Up!


   Articles with "protograph based" as a keyword



Design of Protograph-Based LDPC Codes with Limited Decoding Complexity

Sign Up to like & get
recommendations! Published in 2017 at "IEEE Communications Letters"

DOI: 10.1109/lcomm.2017.2757941

Abstract: In this letter, we present a design method to find good protograph-based low-density parity-check codes with the numbers of nonzero elements in the parity-check matrix and decoding iterations both strictly limited. We utilize the protograph-based… read more here.

Keywords: design protograph; based ldpc; protograph based; decoding complexity ... See more keywords

Optimization of Finite-Length Protograph-Based SC-LDPC Anytime Codes

Sign Up to like & get
recommendations! Published in 2024 at "IEEE Communications Letters"

DOI: 10.1109/lcomm.2023.3333219

Abstract: In this letter, we present an optimization method for designing Protograph-based spatially coupled low-density parity-check anytime (P-anytime) codes with outstanding finite-length performance. We first introduce two performance metrics, namely the delay-exponent and anytime mean parameters,… read more here.

Keywords: anytime codes; protograph based; finite length; optimization ... See more keywords

Protograph-Based LDPC Hadamard Codes

Sign Up to like & get
recommendations! Published in 2021 at "IEEE Transactions on Communications"

DOI: 10.1109/tcomm.2021.3077939

Abstract: In this paper, we propose a new method to design low-density parity-check Hadamard (LDPC-Hadamard) codes — a type of ultimate-Shannon-limit approaching channel codes. The technique is based on applying Hadamard constraints to the check nodes… read more here.

Keywords: protograph based; based ldpc; hadamard codes; hadamard ... See more keywords

Trapping and Absorbing Set Enumerators for Nonbinary Protograph-Based Low-Density Parity-Check Code Ensembles

Sign Up to like & get
recommendations! Published in 2023 at "IEEE Transactions on Communications"

DOI: 10.1109/tcomm.2023.3241149

Abstract: The finite-length trapping and (elementary) absorbing set enumerators for nonbinary protograph-based LDPC code ensembles are derived. Both constrained and unconstrained edge labeling approaches are considered. The normalized logarithmic asymptotic distributions of trapping and (elementary) absorbing… read more here.

Keywords: protograph based; absorbing set; code ensembles; set enumerators ... See more keywords