{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,4]],"date-time":"2024-08-04T00:16:49Z","timestamp":1722730609070},"reference-count":16,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"8","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2024,8,1]]},"DOI":"10.1587\/transfun.2023eal2104","type":"journal-article","created":{"date-parts":[[2024,3,17]],"date-time":"2024-03-17T22:15:23Z","timestamp":1710713723000},"page":"1364-1368","source":"Crossref","is-referenced-by-count":0,"title":["Triangle Projection Algorithm in ADMM-LP Decoding of LDPC Codes"],"prefix":"10.1587","volume":"E107.A","author":[{"given":"Yun","family":"JIANG","sequence":"first","affiliation":[{"name":"College of Physical Science and Technology, Central China Normal University"}]},{"given":"Huiyang","family":"LIU","sequence":"additional","affiliation":[{"name":"College of Physical Science and Technology, Central China Normal University"}]},{"given":"Xiaopeng","family":"JIAO","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Xidian University"}]},{"given":"Ji","family":"WANG","sequence":"additional","affiliation":[{"name":"College of Physical Science and Technology, Central China Normal University"}]},{"given":"Qiaoqiao","family":"XIA","sequence":"additional","affiliation":[{"name":"College of Physical Science and Technology, Central China Normal University"}]}],"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. 10.1561\/2200000016"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] S. Barman, X. 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":"publisher","unstructured":"[4] F.R. Kschischang, B.J. Frey, and H.-A. Loeliger, \u201cFactor graphs and the sum-product algorithm,\u201d IEEE Trans. Inf. Theory, vol.47, no.2, pp.498-519, Feb. 2001. 10.1109\/18.910572","DOI":"10.1109\/18.910572"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] X. 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":"6","doi-asserted-by":"publisher","unstructured":"[6] Y. Wei, M.-M. Zhao, M.-J. Zhao, and M. Lei, \u201cADMM-based decoder for binary linear codes aided by deep learning,\u201d IEEE Commun. Lett., vol.24, no.5, pp.1028-1032, May 2020. 10.1109\/lcomm.2020.2974199","DOI":"10.1109\/LCOMM.2020.2974199"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] X. Guo, T.-H. Chang and Y. Wang, \u201cModel-driven deep learning ADMM decoder for irregular binary LDPC codes,\u201d IEEE Commun. Lett., vol.27, no.2, pp.571-575, Feb. 2023. 10.1109\/lcomm.2022.3223114","DOI":"10.1109\/LCOMM.2022.3223114"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] X. Zhang and P.H. Siegel, \u201cEfficient iterative LP decoding of LDPC codes with alternating direction method of multipliers,\u201d Proc. IEEE Int. Symp. Inf. Theory, pp.1501-1505, July 2013. 10.1109\/isit.2013.6620477","DOI":"10.1109\/ISIT.2013.6620477"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] G. 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":"10","doi-asserted-by":"publisher","unstructured":"[10] F. Gensheimer, T. Dietz, K. Kraft, S. Ruzika, and N. Wehn, \u201cA reduced-complexity projection algorithm for ADMM-based LP decoding,\u201d IEEE Trans. Inf. Theory, vol.66, no.8, pp.4819-4833, Aug. 2020. 10.1109\/tit.2020.2984247","DOI":"10.1109\/TIT.2020.2984247"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] Q. Xia, X. Wang, H. Liu, and Q.L. Zhang, \u201cA hybrid check polytope projection algorithm for ADMM decoding of LDPC codes,\u201d IEEE Commun. Lett., vol.25, no.1, pp.108-112, 2020. 10.1109\/lcomm.2020.3023600","DOI":"10.1109\/LCOMM.2020.3023600"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] Y. Zheng, Y. Lin, Z. Zhang, Q. Zhang, and Q. Xia, \u201cAn enhanced HDPC-EVA decoder based on ADMM,\u201d IEICE Trans. Fundamentals, vol.E104-A, no.10, pp.1425-1429, Oct. 2021. 10.1587\/transfun.2020eal2116","DOI":"10.1587\/transfun.2020EAL2116"},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] Q. Xia, Y. Lin, S. Tang, and Q. Zhang, \u201cA fast approximate check polytope projection algorithm for ADMM decoding of LDPC codes,\u201d IEEE Commun. Lett., vol.23, no.9, pp.1520-1523, Sept. 2019. 10.1109\/lcomm.2019.2926085","DOI":"10.1109\/LCOMM.2019.2926085"},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] Q. Xia, P. He, X. Wang, H. Liu, and Q. Zhang, \u201cNode-wise scheduling algorithm of ADMM decoding based on line segment projection,\u201d IEEE Commun. Lett., vol.26, no.4, pp.738-742, April 2022. 10.1109\/lcomm.2022.3143235","DOI":"10.1109\/LCOMM.2022.3143235"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] A. Asadzadeh, M. Barakatain, S.C. Draper, and J. Mitra, \u201cSAPA: Sparse affine projection algorithm in ADMM-LP decoding of LDPC codes,\u201d 2022 17th Canadian Workshop on Information Theory (CWIT), Ottawa, ON, Canada, pp.27-32, 2022. 10.1109\/cwit55308.2022.9817674","DOI":"10.1109\/CWIT55308.2022.9817674"},{"key":"16","unstructured":"[16] LDPC Coding for OFDMA PHY, Standard IEEE Std. C802.16e-05\/0066r3, 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\/E107.A\/8\/E107.A_2023EAL2104\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,3]],"date-time":"2024-08-03T03:25:37Z","timestamp":1722655537000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E107.A\/8\/E107.A_2023EAL2104\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,1]]},"references-count":16,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2024]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2023eal2104","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"type":"print","value":"0916-8508"},{"type":"electronic","value":"1745-1337"}],"subject":[],"published":{"date-parts":[[2024,8,1]]},"article-number":"2023EAL2104"}}