Advertisement

Group-Based Layered Scheduling of ADMM Decoding for LDPC Codes

  • Xing-Long Zhang
  • Meng Niu
  • Luo-Hui Su
  • Ke-Pu Song
Conference paper
Part of the Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering book series (LNICST, volume 237)

Abstract

For low-density parity-check (LDPC) codes decoding by alternating direction method of multipliers (ADMM), the layered scheduling sequentially updates the messages of check nodes one by one. Though the layered scheduling can speed up the convergence rates, it may limit the throughput when implementing the ADMM decoder with multi-core systems due to its serial style. To circumvent this problem, a group-based layered scheduling is proposed by updating a group of check node messages at one time. Extensive simulation results for the proposed scheme over two typical LDPC codes with the ADMM penalized decoding algorithm are provided.

Keywords

ADMM decoding LDPC codes Message scheduling Convergence rate 

References

  1. 1.
    Feldman, J., Wainwright, M.J., Karger, D.R.: Using linear programming to decode binary linear codes. IEEE Trans. Inf. Theory 51, 954–972 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Barman, S., Liu, X., Draper, S.C., Recht, B.: Decomposition methods for large scale LP decoding. IEEE Trans. Inf. Theory 59, 7870–7886 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Zhang, X., Siegel, P.H.: Efficient iterative LP decoding of LDPC codes with alternating direction method of multipliers. In: 2013 IEEE International Symposium on Information Theory, pp. 1501–1505. IEEE Press, New York (2013)Google Scholar
  4. 4.
    Liu, X., Draper, S.C.: The ADMM penalized decoder for LDPC codes. IEEE Trans. Inf. Theory 62, 2966–2984 (2016)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Debbabi, I., Khouja, N., Tlili, F., Gal, B.L., Jego, C.: Multicore implementation of LDPC decoders based on ADMM algorithm. In: 2016 IEEE International Conference on Acoustics, Speech and Signal Processing, pp. 971–975. IEEE Press, New York (2016)Google Scholar
  6. 6.
    Zhang, G., Heusdens, R., Kleijn, W.B.: Large scale LP decoding with low complexity. IEEE Commun. Lett. 17, 2152–2155 (2013)CrossRefGoogle Scholar
  7. 7.
    Jiao, X., Mu, J., He, Y., Chen, C.: Efficient ADMM decoding of LDPC codes using look-up tables. IEEE Trans. Commun. 65, 1425–1437 (2017)CrossRefGoogle Scholar
  8. 8.
    Wei, H., Jiao, X., Mu, J.: Reduced-complexity linear programming decoding based on ADMM for LDPC codes. IEEE Commun. Lett. 19, 909–912 (2015)CrossRefGoogle Scholar
  9. 9.
    Debbabi, I., Gal, B.L., Khouja, N., Tlili, F., Jego, C.: Fast converging ADMM penalized algorithm for LDPC decoding. IEEE Commun. Lett. 20, 644–647 (2016)CrossRefGoogle Scholar
  10. 10.
    Jiao, X., Mu, J., Wei, H.: Reduced complexity node-wise scheduling of ADMM decoding for LDPC codes. IEEE Commun. Lett. 21, 472–475 (2017)CrossRefGoogle Scholar
  11. 11.
    Jiao, X., Wei, H., Mu, J., Chen, C.: Improved ADMM penalized decoder for irregular low-density parity-check codes. IEEE Commun. Lett. 19, 913–916 (2015)CrossRefGoogle Scholar
  12. 12.
    Wang, B., Mu, J., Jiao, X., Wang, Z.: Improved penalty functions of ADMM penalized decoder for LDPC codes. IEEE Commun. Lett. 21, 234–237 (2017)CrossRefGoogle Scholar
  13. 13.
    MacKay, D.J.C.: Encyclopedia of spare graph codes. http://www.inference.phy.cam.ac.uk/mackay/codes/data.html
  14. 14.
    LDPC coding for OFDMA PHY: IEEE standard C802.16e-05/0066r3 (2005)Google Scholar

Copyright information

© ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2018

Authors and Affiliations

  • Xing-Long Zhang
    • 1
  • Meng Niu
    • 1
  • Luo-Hui Su
    • 1
  • Ke-Pu Song
    • 1
  1. 1.AVIC Xi’an Flight Automatic Control Research InstituteXi’anChina

Personalised recommendations