ADMM Penalized Decoding with Layered Scheduling for LDPC Codes Based on Improved Penalty Function

doi:10.3969/j.issn.0372-2112.2020.04.025

PDF(806 KB)

ACTA ELECTRONICA SINICA ›› 2020, Vol. 48 ›› Issue (4) : 827-832. DOI: 10.3969/j.issn.0372-2112.2020.04.025

ADMM Penalized Decoding with Layered Scheduling for LDPC Codes Based on Improved Penalty Function

WANG Biao^1,2, MU Jian-jun¹, JIAO Xiao-peng¹, WANG Zhong-fei²

Author information +

History +

Abstract

By making the pseudocodewords more costly,the penalized decoding method based on alternating direction method of multipliers (ADMM) can improve the decoding performance for low-density parity-check (LDPC) codes at low signal-to-noise ratios and also has low decoding complexity.Reducing the number of Euclidean projection in ADMM penalized decoding,selecting the appropriate message scheduling strategy and designing effective penalty function are three important methods to increase the ADMM penalized decoding speed.In order to increase the ADMM penalized decoding speed further,by using the method proposed by Wei et al to reduce the number of Euclidean projections,this paper designs two kinds of ADMM penalized decoding methods with the horizontal layered scheduling and the vertical layered scheduling strategy for LDPC codes based on the I-l₁-PF penalty function.Simulation results show that the designed methods not only have better decoding performance but also significantly reduce the average number of iterations and the average decoding time compared with the existing ADMM penalized decoding methods.

Key words

low-density parity-check (LDPC) codes / alternating direction method of multipliers (ADMM) / penalty function / penalized decoding / layered scheduling

Cite this article

EndNote

Ris (Procite)

Bibtex

Download Citations

WANG Biao, MU Jian-jun, JIAO Xiao-peng, WANG Zhong-fei. ADMM Penalized Decoding with Layered Scheduling for LDPC Codes Based on Improved Penalty Function[J]. Acta Electronica Sinica, 2020, 48(4): 827-832. https://doi.org/10.3969/j.issn.0372-2112.2020.04.025

References

[1] 陈海强,梁奇,黎相成,等.瑞利信道下基于广义阈值函数的LDPC译码算法[J].电子学报,2017,45(1):16-21. CHEN Hai-qiang,LIANG Qi,LI Xiang-cheng,et al.LDPC decoding algorithm with generalized threshold-function over Rayleigh fading channel[J].Acta Electronica Sinica,2017,45(1):16-21.(in Chinese)
[2] 孙友明,陈海强,黎相成,等.基于节点子集和k阶信息截断的多元LDPC译码算法[J].电子学报,2017,45(8):1925-1930. SUN You-ming,CHEN Hai-qiang,LI Xiang-cheng,et al.Decoding algorithm for non-binary LDPC codes based on node-subset and k-order message truncation[J].Acta Electronica Sinica,2017,45(8):1925-1930.(in Chinese)
[3] 陈海强,罗灵山,孙友明,等.基于大数逻辑可译LDPC码的译码算法研究[J].电子学报,2015,43(6):1169-1173. CHEN Hai-qiang,LUO Ling-shan,SUN You-ming,et al.Decoding algorithms for majority-logic decodable LDPC codes[J].Acta Electronica Sinica,2015,43(6):1169-1173.(in Chinese)
[4] Kschischang F R,Frey B J,Loeliger H A.Factor graphs and the sum-product algorithm[J].IEEE Transactions on Information Theory,2001,47(2):498-519.
[5] Barman S,Liu Xi-shuo,Draper S C,et al.Decomposition methods for large scale LP decoding[J].IEEE Transactions on Information Theory,2013,59(11):7870-7886.
[6] Zhang Xiao-jie,Siegel P H.Efficient iterative LP decoding of LDPC codes with alternating direction method of multipliers[A].Proceedings of IEEE International Symposium on Information Theory[C].Turkey:IEEE,2013.1501-1505.
[7] Zhang Guo-qiang,Heusdens R,Kleijn W B.Large scale LP decoding with low complexity[J].IEEE Communications Letters,2013,17(11):2152-2155.
[8] Wei Hao-yuan,Jiao Xiao-peng,Mu Jian-jun.Reduced-complexity linear programming decoding based on ADMM for LDPC codes[J].IEEE Communications Letters,2015,19(6):909-912.
[9] Jiao Xiao-peng,Mu Jian-jun,He Yu-Cheng,et al.Efficient ADMM decoding of LDPC codes using look-up tables[J].IEEE Transactions on Communications,2017,65(4):1425-1437.
[10] Debbabi I,Gal B L,Khouja N,et al.Fast converging ADMM penalized algorithm for LDPC decoding[J].IEEE Communications Letters,2016,20(4):644-647.
[11] Debbabi I,Gal B L,Khouja N,et la.Comparison of different schedulings for the ADMM based LDPC decoding[A].Proceedings of 9th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)[C].France:IEEE,2016.51-55.
[12] Jiao Xiao-peng,Mu Jian-jun,Wei Hao-yuan.Reduced complexity node-wise scheduling of ADMM decoding for LDPC codes[J].IEEE Communications Letters,2017,21(3):472-475.
[13] Boyd S,Parikh N,Chu E,et al.Distributed optimization and statistical learning via the alternating direction method of multipliers[J].Foundations and Trends in Machine Learning,2011,3(1):1-122.
[14] Liu Xi-shuo,Draper S C.The ADMM penalized decoder for LDPC codes[J].IEEE Transactions on Information Theory,2016,62(6):2966-2984.
[15] Jiao Xiao-peng,Wei Hao-yuan,Mu Jian-jun,et al.Improved ADMM penalized decoder for irregular low-density parity-check codes[J].IEEE Communications Letters,2015,19(6):913-916.
[16] Wang Biao,Mu Jian-jun,Jiao Xiao-peng,et al.Improved penalty functions of ADMM penalized decoder for LDPC codes[J].IEEE Communications Letters,2017,21(2):234-237.
[17] LDPC Coding for OFDMA PHY.IEEE Standard C802.16e-05/0066r3[S].2005.
[18] Hu Xiao-yu,Eleftheriou E,Arnold D M,et al.Efficient implementations of the sum-product algorithm for decoding LDPC codes[A].Proceedings of IEEE Global Telecommunications Conference[C].USA:IEEE,2001.1036-1036E.

Funding

National Natural Science Foundation of China (No.61971322, No.61977051, No.61602010); Open Fund of Chongqing Key Laboratory of Computer Network and Communication Technology, Chongqing Municipal Information Industry Bureau (No.CY-CNCL-2017-03); Natural Science Basic Research Program of Shaanxi Province (No.2014JM1027); Research Project of Education Department of Shaanxi Province (No.17JK0047); Baoji Science and Technology Project (No.15RKX-1-5-8, 2018JH-18); Key project of Baoji College of Arts and Science (No.ZK12094, No.ZK2017001)