2014
DOI: 10.1109/tcomm.2014.2349943
|View full text |Cite
|
Sign up to set email alerts
|

LDPC Decoding Scheduling for Faster Convergence and Lower Error Floor

Abstract: This paper presents a maximum mutual information increase (M 2 I 2 )-based algorithm that can be used to arrange low-density parity-check (LDPC) decoding schedules for faster convergence, where the increase is used to guide the arrangement of the fixed decoding schedule. The predicted mutual information for the messages to be updated is used in the calculation of the increase. By looking ahead for several decoding stages, a high-order prediction can be realized, which can then be used to devise a schedule with… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
14
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
4
3

Relationship

1
6

Authors

Journals

citations
Cited by 28 publications
(14 citation statements)
references
References 26 publications
0
14
0
Order By: Relevance
“…This is a protograph-based code, and here, augmentation is compared to the performance of a serial decoder employing schedule diversity [14] (note that this type of decoder only works for protograph-based codes). This decoder first attempts decoding with an optimized message passing schedule; if decoding fails, then it iteratively reattempts decoding using a scrambled schedule up to a maximum of T attempts.…”
Section: Margulismentioning
confidence: 99%
See 1 more Smart Citation
“…This is a protograph-based code, and here, augmentation is compared to the performance of a serial decoder employing schedule diversity [14] (note that this type of decoder only works for protograph-based codes). This decoder first attempts decoding with an optimized message passing schedule; if decoding fails, then it iteratively reattempts decoding using a scrambled schedule up to a maximum of T attempts.…”
Section: Margulismentioning
confidence: 99%
“…If the BP messages are limited to a small number of bits, then modifying the quantization scheme can improve the performance [11]. The scheduling of message passing in a BP decoder can also be altered, giving rise to serial decoders [12][13][14]. It is also possible to identify particular trapping sets and apply an appropriate perturbation if a known trapping set is present [15].…”
Section: Introductionmentioning
confidence: 99%
“…The arrangement process will progress until the value of the cumulative mutual information I CMI (j) for each variable node converges to one. The detail computations for the value of I E,C (i, j), I p E,C (i, j) and I CMI (j) are presented in [8], [9] and [10].…”
Section: B Decoding Schedule Arrangement Using the M 2 I 2 -Based Almentioning
confidence: 99%
“…A higher order increment can be recursively generated in the form of this order-2 increment, which is presented in detail in Algorithm 2 of [10]. With the assistance of the high-order prediction, the sequence S can be more precisely determined for an even faster convergence.…”
Section: B Decoding Schedule Arrangement Using the M 2 I 2 -Based Almentioning
confidence: 99%
See 1 more Smart Citation