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

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

Hua Xiao

Published Jan 1, 2002• 2 citations
Publisher
DOI
10.22215/etd/2002-05223

Related papers

Irregular Low-Density Parity-Check Code Decoder Using Message-Passing Algorithm

Yu Yi, Moon Ho Lee, Ju Yong Park

한국통신학회 학술대회논문집•Nov 1, 2001•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 Low-Density Parity-Check Codes

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

River Publishers eBooks•Sep 1, 2022•0 citations

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

Junho Cho

•Jan 1, 2010•0 citations

Reliability-based schedule for decoding low-density parity-check codes

A. Nouh, Amir H. Banihashemi

A reliability-based message-passing schedule for iterative decoding of low-density parity-check codes is proposed. Simulation results for bit-flipping algorithms (with binary messages) show that reliability-based schedule can provide considerable improvement in performance and decoding speed over the so-called flooding (parallel) schedule as well as the existing graph-based schedules. The cost associated with this improvement is negligible and is equivalent to having a 2-bit representation for initial messages, instead of the standard 1-bit for hard-decision algorithms, only at the first iteration (all the exchanged messages are still binary).

International Conference on Communications•Jan 1, 2004•0 citations

A construction of low-density parity-check codes

李铁楠, 单秀玲

•Jan 1, 2013•2 citations
A reliability-based message-passing schedule for iterative decoding of low-density parity-check codes is proposed. Simulation results for bit-flipping algorithms (with binary messages) show that reliability-based schedule can provide considerable improvement in performance and decoding speed over the so-called flooding (parallel) schedule as well as the existing graph-based schedules. The cost associated with this improvement is negligible and is equivalent to having a 2-bit representation for initial messages, instead of the standard 1-bit for hard-decision algorithms, only at the first iteration (all the exchanged messages are still binary).