{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T02:54:04Z","timestamp":1744858444088},"reference-count":15,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"11","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2020,11,1]]},"DOI":"10.1587\/transfun.2020eal2020","type":"journal-article","created":{"date-parts":[[2020,5,7]],"date-time":"2020-05-07T22:06:47Z","timestamp":1588889207000},"page":"1304-1307","source":"Crossref","is-referenced-by-count":2,"title":["Fast Converging ADMM Penalized Decoding Method Based on Improved Penalty Function for LDPC Codes"],"prefix":"10.1587","volume":"E103.A","author":[{"given":"Biao","family":"WANG","sequence":"first","affiliation":[{"name":"School of Mathematics and Information Science, Baoji University of Arts and Sciences"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] J. Feldman, M.J. Wainwright, and D.R. Karger, \u201cUsing linear programming to decode binary linear codes,\u201d IEEE Trans. Inf. Theory, vol.51, no.3, pp.954-972, March 2005. 10.1109\/tit.2004.842696","DOI":"10.1109\/TIT.2004.842696"},{"key":"2","unstructured":"[2] S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein, \u201cDistributed optimization and statistical learning via the alternating direction method of multipliers,\u201d Found. Trends Mach. Learn., vol.3, no.1, pp.1-122, Jan. 2011."},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] S. Barman, X.S. Liu, S.C. Draper, and B. Recht, \u201cDecomposition methods for large scale LP decoding,\u201d IEEE Trans. Inf. Theory, vol.59, no.12, pp.7870-7886, Dec. 2013. 10.1109\/tit.2013.2281372","DOI":"10.1109\/TIT.2013.2281372"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] X.J. Zhang and P.H. Siegel, \u201cEfficient iterative LP decoding of LDPC codes with alternating direction method of multipliers,\u201d Proc. IEEE International Symposium on Information Theory, pp.1501-1505, Istanbul, Turkey, July 2013. 10.1109\/isit.2013.6620477","DOI":"10.1109\/ISIT.2013.6620477"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] G.Q. Zhang, R. Heusdens, and W.B. Kleijn, \u201cLarge scale LP decoding with low complexity,\u201d IEEE Commun. Lett., vol.17, no.11, pp.2152-2155, Nov. 2013. 10.1109\/lcomm.2013.101413.130826","DOI":"10.1109\/LCOMM.2013.101413.130826"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] X.P. Jiao, J.J. Mu, Y.C. He, and C. Chen, \u201cEfficient ADMM decoding of LDPC codes using lookup tables,\u201d IEEE Trans. Commun., vol.65, no.4, pp.1425-1436, April 2017. 10.1109\/tcomm.2017.2659733","DOI":"10.1109\/TCOMM.2017.2659733"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] H.Y. Wei and A.H. Banihashemi, \u201cAn iterative check polytope projection algorithm for ADMM-based LP decoding of LDPC codes,\u201d IEEE Commun. Lett., vol.22, no.1, pp.29-32, Oct. 2018. 10.1109\/lcomm.2017.2766223","DOI":"10.1109\/LCOMM.2017.2766223"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] Z.B. Liang, X. Chen, X.H. Sun, and L.J. Zhai, \u201cA reduced-complexity ADMM based decoding algorithm for LDPC codes,\u201d Proc. International Conference on Wireless Communications and Signal Processing (WCSP), pp.1-6, Xi'an, China, Oct. 2019. 10.1109\/wcsp.2019.8928121","DOI":"10.1109\/WCSP.2019.8928121"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] H.Y. Wei, X.P. Jiao, and J.J. Mu, \u201cReduced-complexity linear programming decoding based on ADMM for LDPC codes,\u201d IEEE Commun. Lett., vol.19, no.6, pp.909-912, June 2015. 10.1109\/lcomm.2015.2418261","DOI":"10.1109\/LCOMM.2015.2418261"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] X.S. Liu and S.C. Draper, \u201cThe ADMM penalized decoder for LDPC codes,\u201d IEEE Trans. Inf. Theory, vol.62, no.6, pp.2966-2984, June 2016. 10.1109\/tit.2016.2555847","DOI":"10.1109\/TIT.2016.2555847"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] X.P. Jiao, H.Y. Wei, J.J. Mu, and C. Chen, \u201cImproved ADMM penalized decoder for irregular low-density parity-check codes,\u201d IEEE Commun. Lett., vol.19, no.6, pp.913-916, June 2015. 10.1109\/lcomm.2015.2421445","DOI":"10.1109\/LCOMM.2015.2421445"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] B. Wang and Z.F. Wang, \u201cADMM penalized decoding method based on improved penalty function for LDPC codes in the IoTs,\u201d Comput. Commun., vol.154, pp.197-203, March 2020. 10.1016\/j.comcom.2020.02.063","DOI":"10.1016\/j.comcom.2020.02.063"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] I. Debbabi, B.L. Gal, N. Khouja, F. Tlili, and C. Jego, \u201cComparison of different schedulings for the ADMM based LDPC decoding,\u201d Proc. International Symposium on Turbo Codes and Iterative Information Processing (ISTC), pp.51-55, Brest, France, Oct. 2016. 10.1109\/istc.2016.7593075","DOI":"10.1109\/ISTC.2016.7593075"},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] X.P. Jiao, J.J. Mu, and H.Y. Wei, \u201cReduced complexity node-wise scheduling of ADMM decoding for LDPC codes,\u201d IEEE Commun. Lett., vol.21, no.3, pp.472-475, March 2017. 10.1109\/lcomm.2016.2643629","DOI":"10.1109\/LCOMM.2016.2643629"},{"key":"15","unstructured":"[15] LDPC Coding for OFDMA PHY, IEEE Standard C802.16e-05\/0066r3, Jan. 2005."}],"container-title":["IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E103.A\/11\/E103.A_2020EAL2020\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,7]],"date-time":"2020-11-07T03:31:30Z","timestamp":1604719890000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E103.A\/11\/E103.A_2020EAL2020\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,1]]},"references-count":15,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2020]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2020eal2020","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,11,1]]}}}