Skip to Main Content
The convergence speed of layered message-passing decoding (LMPD) is faster than that of standard two phase message passing (TPMP) decoding. We propose to use dynamic scheduling and early termination to reduce computational complexity for a modified LMPD algorithm which was proposed for quasi-cyclic low-density parity-check (QC-LDPC) codes. We dynamically skip or redo the decoding operations for some layers based on appropriate criteria. An early termination strategy which is efficient in hardware implementation is also proposed in this paper. The modified MPD using these two techniques simultaneously can reduce the computational complexity with similar error performance as compared to the case of not using these two techniques.
Date of Conference: 24-27 May 2009