Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

River Publishers eBooks

Decoding Scheduling for Low-Density Parity-Check Codes

Huang–Chang Lee, Yen‐Ming Chen, Yeong-Luh Ueng

Published Sep 1, 2022• 0 citations
Publisher
DOI
10.1201/9781003339212-4

Related papers

Message-passing schedules for decoding low-density parity-check codes

Hua Xiao

•Jan 1, 2002•2 citations

Horizontal-Shuffled Scheduling for the Low Density Parity Check Codes Decoding for WiMAX Application

Mouhcine Razi, Anas Mansouri, Abdessalam Aït Madi +1 more

Lecture notes in electrical engineering•Aug 1, 2018•1 citation

Bootstrap algorithms and reliability based schedule for decoding low-density parity-check codes

Ahmed Nouh

•Jan 1, 2002•0 citations

Decoding low-density parity-check codes with probabilistic scheduling

Yongyi Mao, Amir H. Banihashemi

We present a new message-passing schedule for the decoding of low-density parity-check (LDPC) codes. This approach, designated "probabilistic schedule", takes into account the structure of the Tanner graph (TG) of the code. We show by simulation that the new schedule offers a much better performance/complexity trade-off. This work also suggests that scheduling plays an important role in iterative decoding and that a schedule that matches the structure of the TG is desirable.

IEEE Communications Letters•Oct 1, 2001•67 citations

Decoding Scheduling for Unequal Error Protection Quasi-Cyclic Low-Density Parity-Check Codes

Jia-Jyun Wu, Chung-Hsuan Wang, Chi-chao Chao

Algebraic constructions of quasi-cyclic (QC) low-density parity-check (LDPC) codes with unequal error protection (UEP) capabilities have recently been proposed, which can provide different error-correcting capabilities for different parts of the coded bits. However, conventional decoding algorithms are not designed for LDPC codes with UEP. In this paper, we propose three decoding schemes for UEP QC-LDPC codes extended from existing scheduling strategies, tailored to the special structures of the parity-check matrices. Simulation results show that the proposed schemes can provide improved error rate performance especially for coded bits on low protection levels. The decoding convergence can also be accelerated, thereby reducing the computational complexity.

International Workshop on Signal Design and its Applications in Communications•Oct 1, 2019•1 citation

Improvement of decoding algorithms for low-density parity-check codes

Junho Cho

•Jan 1, 2010•0 citations
Algebraic constructions of quasi-cyclic (QC) low-density parity-check (LDPC) codes with unequal error protection (UEP) capabilities have recently been proposed, which can provide different error-correcting capabilities for different parts of the coded bits. However, conventional decoding algorithms are not designed for LDPC codes with UEP. In this paper, we propose three decoding schemes for UEP QC-LDPC codes extended from existing scheduling strategies, tailored to the special structures of the parity-check matrices. Simulation results show that the proposed schemes can provide improved error rate performance especially for coded bits on low protection levels. The decoding convergence can also be accelerated, thereby reducing the computational complexity.