Comments on “Edge-Based Dynamic Scheduling for Belief-Propagation Decoding of LDPC Codes”
Qiyou Xie · IEEE Transactions on Communications · 2017
In this paper, we provide comments on the recent paper by Aslam et al. that proposed two low-complexity edge-based scheduling schemes for belief-propagation (BP) decoding of low-density parity-check (LDPC) codes. In their schemes, the check-node reliability threshold (τ) is important to select the updating edges. However, it is found that the selected value of τ in the above literature is not optimal. In this comment, we present a method that leads to a better choice of τ.