Decoding of Moderate Length LDPC Codes via Learned Clustered Check Node Scheduling

2021 ◽  
Author(s):  
Salman Habib ◽  
Allison Beemer ◽  
Jorg Kliewer
Keyword(s):  
Ldpc Codes ◽  
Node Scheduling ◽  
Check Node ◽  
Moderate Length

scholarly journals A Construction of High Performance Quasicyclic LDPC Codes: A Combinatoric Design Approach

2019 ◽  
Vol 2019 ◽  
pp. 1-10 ◽  
Author(s):  
Muhammad Asif ◽  
Wuyang Zhou ◽  
Muhammad Ajmal ◽  
Zain ul Abiden Akhtar ◽  
Nauman Ali Khan
Keyword(s):  
Iterative Decoding ◽  
High Performance ◽  
Linear Complexity ◽  
Signal To Noise Ratio ◽  
Additive White Gaussian Noise ◽  
Ldpc Codes ◽  
Combinatorial Designs ◽  
Parity Check ◽  
Excellent Performance ◽  
Moderate Length

This correspondence presents a construction of quasicyclic (QC) low-density parity-check (LDPC) codes based on a special type of combinatorial designs known as block disjoint difference families (BDDFs). The proposed construction of QC-LDPC codes gives parity-check matrices with column weight three and Tanner graphs having a girth lower-bounded by 6. The proposed QC-LDPC codes provide an excellent performance with iterative decoding over an additive white Gaussian-noise (AWGN) channel. Performance analysis shows that the proposed short and moderate length QC-LDPC codes perform as well as their competitors in the lower signal-to-noise ratio (SNR) region but outperform in the higher SNR region. Also, the codes constructed are quasicyclic in nature, so the encoding can be done with simple shift-register circuits with linear complexity.

scholarly journals UEP Concepts in Modulation and Coding

2010 ◽  
Vol 2010 ◽  
pp. 1-14 ◽  
Author(s):  
Werner Henkel ◽  
Khaled Hassan ◽  
Neele von Deetzen ◽  
Sara Sandberg ◽  
Lucile Sassatelli ◽  
...  
Keyword(s):  
Turbo Codes ◽  
Arbitrary Number ◽  
Ldpc Codes ◽  
Unequal Error Protection ◽  
Multicarrier Modulation ◽  
Multimedia Data ◽  
Turbo Coding ◽  
Bit Loading ◽  
Check Node ◽  
Number Of Classes

First unequal error protection (UEP) proposals date back to the 1960's (Masnick and Wolf; 1967), but now with the introduction of scalable video, UEP develops to a key concept for the transport of multimedia data. The paper presents an overview of some new approaches realizing UEP properties in physical transport, especially multicarrier modulation, or with LDPC and Turbo codes. For multicarrier modulation, UEP bit-loading together with hierarchical modulation is described allowing for an arbitrary number of classes, arbitrary SNR margins between the classes, and arbitrary number of bits per class. In Turbo coding, pruning, as a counterpart of puncturing is presented for flexible bit-rate adaptations, including tables with optimized pruning patterns. Bit- and/or check-irregular LDPC codes may be designed to provide UEP to its code bits. However, irregular degree distributions alone do not ensure UEP, and other necessary properties of the parity-check matrix for providing UEP are also pointed out. Pruning is also the means for constructing variable-rate LDPC codes for UEP, especially controlling the check-node profile.

On Construction of Moderate-Length LDPC Codes over Correlated Erasure Channels

2009 ◽  
Author(s):  
G. Liva ◽  
B. Matuz ◽  
Z. Katona ◽  
E. Paolini ◽  
M. Chiani
Keyword(s):  
Ldpc Codes ◽  
Erasure Channels ◽  
Moderate Length

Hybrid Decoding Algorithm for LDPC Codes with Circles

2011 ◽  
Vol 271-273 ◽  
pp. 258-263
Author(s):  
Li Shuang Hu ◽  
Ming Shan Liu ◽  
Yuan Zhou ◽  
Yang Sun
Keyword(s):  
Error Rate ◽  
Belief Propagation ◽  
Additive White Gaussian Noise ◽  
Ldpc Codes ◽  
Error Correcting Codes ◽  
Parity Check ◽  
Likelihood Ratios ◽  
Decoding Algorithms ◽  
Variable Node ◽  
Check Node

At present, Low-Density Parity-Check (LDPC) codes widely used in many fields of communications have the best performance of all the Error Correcting Codes (ECC). This paper mainly studies the decoding algorithms of LDPC. It proposes an improved algorithm which is named Check-Variable nodes Hybrid(CVH) algorithm on the basis of the existing algorithms. The CVH algorithm can reduce the computational complexity during the check-node update while overcome with the correlation between the variable-node news in a code with circles. As well as, comparing with the original algorithms the performance of the new one saves 0.1 and 0.3 dB than Log-likelihood Ratios (LLR) Belief Propagation (BP) and BP - based algorithms under Additive White Gaussian Noise (AWGN) channel when the Bit Error Rate (BER) falls to through the simulation. This point shows that this algorithm can increase the decoding performance and reduce the error rate effectively.

Sign in / Sign up

Export Citation Format

Share Document