A Method for Grouping Symbol Nodes of Group Shuffled BP Decoding Algorithm
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Efficient encoding of QC-LDPC codes related to cyclic MDS codes
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
High-throughput layered decoder implementation for quasi-cyclic LDPC codes
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
Convergence analysis of generalized serial message-passing schedules
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
Two-staged informed dynamic scheduling for sequential belief propagation decoding of LDPC codes
IEEE Communications Letters
Bounds on the number of iterations for turbo-like ensembles over the binary erasure channel
IEEE Transactions on Information Theory
Analysis of LDPC decoding schedules
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Iterative approximate linear programming decoding of LDPC codes with linear complexity
IEEE Transactions on Information Theory
Techniques and architectures for hazard-free semi-parallel decoding of LDPC codes
EURASIP Journal on Embedded Systems - Special issue on design and architectures for signal and image processing
Dynamic schedules based on variable nodes residual for LDPC codes
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
LDPC decoders with informed dynamic scheduling
IEEE Transactions on Communications
Serial scheduling algorithm of LDPC decoding
ICHIT'11 Proceedings of the 5th international conference on Convergence and hybrid information technology
Modified Shuffled Based Architecture for High-Throughput Decoding of LDPC Codes
Journal of Signal Processing Systems
| Hi-index | 754.96 |
Conventionally, in each low-density parity-check (LDPC) decoding iteration all the variable nodes and subsequently all the check nodes send messages to their neighbors (flooding schedule). An alternative, more efficient, approach is to update the nodes' messages serially (serial schedule). A theoretical analysis of serial message passing decoding schedules is presented. In particular, the evolution of the computation tree under serial scheduling is analyzed. It shows that the tree grows twice as fast in comparison to the flooding schedule's one, indicating that the serial schedule propagates information twice as fast in the code's underlying graph. Furthermore, an asymptotic analysis of the serial schedule's convergence rate is done using the density evolution (DE) algorithm. Applied to various ensembles of LDPC codes, it shows that for long codes the serial schedule is expected to converge in half the number of iterations compared to the standard flooding schedule, when working near the ensemble's threshold. This observation is generally proved for the binary erasure channel (BEC) under some natural assumptions. Finally, an accompanying concentration theorem is proved.