Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
The capacity of low-density parity-check codes under message-passing decoding
IEEE Transactions on Information Theory
Quasicyclic low-density parity-check codes from circulant permutation matrices
IEEE Transactions on Information Theory
TS-LDPC Codes: Turbo-Structured Codes With Large Girth
IEEE Transactions on Information Theory
Efficient Serial Message-Passing Schedules for LDPC Decoding
IEEE Transactions on Information Theory
Iterative decoding of compound codes by probability propagation in graphical models
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Schedule is the order of passing messages between vertices of the bipartite graph defining an LDPC code during decoding. Schedules may significantly differ in the rate of decoding convergence. New efficient generalized serial schedules are described and analyzed. They provide significant convergence rate speedup factors compared to previously known schedules. For the proposed schedules, combinatorial and probabilistic analysis is presented, explaining the fast convergence observed in simulations. Using it, LDPC ensembles for which significantly better convergence rates can be obtained are identified.