Similar to the belief propagation decoder, linear programming decoding based on the alternating direction method of multipliers (ADMM) can also be seen as an iterative message-passing decoding algorithm. How to schedule messages efficiently is an important aspect since it will influence the convergence rate of iterative decoders. In this letter, we investigate the node-wise scheduling for ADMM decoders, named NS-ADMM. In particular, we propose a reduced-complexity method for the NS-ADMM decoder by avoiding Euclidean projections involved in the calculation of message residuals. Simulation results show that the proposed method converges much faster than the flooding and layered scheduling while keeping a lower complexity when compared with the NS-ADMM decoder.

Additional Metadata
Keywords Alternating direction method of multipliers (ADMM), convergence rate, low-density parity-check (LDPC) codes, message scheduling
Persistent URL dx.doi.org/10.1109/LCOMM.2016.2643629
Journal IEEE Communications Letters
Citation
Jiao, X. (Xiaopeng), Mu, J. (Jianjun), & Wei, H. (Haoyuan). (2017). Reduced Complexity Node-Wise Scheduling of ADMM Decoding for LDPC Codes. IEEE Communications Letters, 21(3), 472–475. doi:10.1109/LCOMM.2016.2643629