Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

Study of Adaptive Reliability-Driven Conditional Innovation Decoding for LDPC Codes

Hassan Touati, Rodrigo C. de Lamare

TL;DR

Simulation results for several examples of LDPC codes indicate that the proposed AR-CID decoding algorithm outperforms competing decoding techniques and has an extremely fast convergence, making it particularly suitable for low-delay applications.

Abstract

In this work, we present an adaptive reliability-driven conditional innovation (AR-CID) decoding algorithm for low-density parity check (LDPC) codes. The proposed AR-CID decoding algorithm consists of one stage of message quality checking and another stage of message passing refinement, which are incorporated into a residual belief propagation decoding strategy. An analysis of the AR-CID decoding algorithm is carried out along with a study of its computational complexity and latency characteristics. Simulation results for several examples of LDPC codes, including short and medium-length codes over an extended range of channel conditions, indicate that the proposed AR-CID decoding algorithm outperforms competing decoding techniques and has an extremely fast convergence, making it particularly suitable for low-delay applications.

Study of Adaptive Reliability-Driven Conditional Innovation Decoding for LDPC Codes

TL;DR

Simulation results for several examples of LDPC codes indicate that the proposed AR-CID decoding algorithm outperforms competing decoding techniques and has an extremely fast convergence, making it particularly suitable for low-delay applications.

Abstract

In this work, we present an adaptive reliability-driven conditional innovation (AR-CID) decoding algorithm for low-density parity check (LDPC) codes. The proposed AR-CID decoding algorithm consists of one stage of message quality checking and another stage of message passing refinement, which are incorporated into a residual belief propagation decoding strategy. An analysis of the AR-CID decoding algorithm is carried out along with a study of its computational complexity and latency characteristics. Simulation results for several examples of LDPC codes, including short and medium-length codes over an extended range of channel conditions, indicate that the proposed AR-CID decoding algorithm outperforms competing decoding techniques and has an extremely fast convergence, making it particularly suitable for low-delay applications.
Paper Structure (31 sections, 44 equations, 7 figures, 2 tables, 3 algorithms)

This paper contains 31 sections, 44 equations, 7 figures, 2 tables, 3 algorithms.

Table of Contents

  1. Introduction
  2. System Model and Problem Statement
  3. LDPC Code Structure and Encoding
  4. Channel Model and Modulation
  5. Demodulation and LLR Computation
  6. Problem Statement
  7. Proposed AR-CID Decoding Algorithm
  8. Reliability-Based Subset Selection
  9. Contextual Information Transition
  10. Combined Reliability Metric
  11. Modified Residual Belief Propagation
  12. AR-CID Algorithm Description
  13. Complexity and Latency Analysis
  14. Convergence Analysis
  15. Computational Complexity
  16. ...and 16 more sections

Figures (7)

  • Figure 1: Block diagram of an LDPC-coded digital communication system with encoding, modulation, channel transmission, demodulation, and iterative decoding stages.
  • Figure 2: Adaptive Reliability-Driven Conditional Innovation Decoder Architecture showing two-stage processing: Message Quality Checking ($O_1$) and Message Passing Refinement ($O_2$) with modified RBP.
  • Figure 3: BER vs. $E_b/N_0$ for LDPC decoding algorithms with parity-check matrix size (2048, 1024) and maximum 7 iterations. AR-CID achieves superior performance across the entire SNR range, with BER of $10^{-4}$ at $E_b/N_0 = 4.2$ dB
  • Figure 4: BER vs. $E_b/N_0$ for LDPC decoding algorithms with parity-check matrix size (512, 256) and maximum 5 iterations. AR-CID demonstrates rapid convergence even with limited iterations.
  • Figure 5: BER vs. $E_b/N_0$ for LDPC decoding algorithms with parity-check matrix size (512, 256) and maximum 10 iterations.
  • ...and 2 more figures