{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T17:16:57Z","timestamp":1648660617681},"reference-count":17,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2018]]},"DOI":"10.1587\/transfun.e101.a.623","type":"journal-article","created":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T22:26:44Z","timestamp":1519943204000},"page":"623-626","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Early Termination Criterion for ADMM Penalized LDPC Decoder"],"prefix":"10.1587","volume":"E101.A","author":[{"given":"Biao","family":"WANG","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Xidian University"},{"name":"School of Mathematics and Information Science, Baoji University of Arts and Sciences"}]},{"given":"Xiaopeng","family":"JIAO","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Xidian University"},{"name":"Chongqing Key Lab of Computer Network and Communication Technology, Chongqing University of Posts and Telecommunications"}]},{"given":"Jianjun","family":"MU","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Xidian University"},{"name":"Chongqing Key Lab of Computer Network and Communication Technology, Chongqing University of Posts and Telecommunications"}]},{"given":"Zhongfei","family":"WANG","sequence":"additional","affiliation":[{"name":"School of Mathematics and Information Science, Baoji University of Arts and Sciences"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] 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":"2","doi-asserted-by":"publisher","unstructured":"[2] 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":"3","doi-asserted-by":"publisher","unstructured":"[3] B. Wang, J.J. Mu, X.P. Jiao, and Z.F. Wang, \u201cImproved penalty functions of ADMM penalized decoder for LDPC codes,\u201d IEEE Commun. Lett., vol.21, no.2, pp.234-237, Feb. 2017. 10.1109\/lcomm.2016.2627575","DOI":"10.1109\/LCOMM.2016.2627575"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] 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":"5","doi-asserted-by":"crossref","unstructured":"[5] X.J. 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, Istanbul, Turkey, July 2013. 10.1109\/isit.2013.6620477","DOI":"10.1109\/ISIT.2013.6620477"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] 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":"7","doi-asserted-by":"publisher","unstructured":"[7] 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":"8","doi-asserted-by":"publisher","unstructured":"[8] 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":"9","doi-asserted-by":"publisher","unstructured":"[9] 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, Jan. 2018. 10.1109\/lcomm.2017.2766223","DOI":"10.1109\/LCOMM.2017.2766223"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] I. Debbabi, B.L. Gal, N. Khouja, F. Tlili, and C. Jego, \u201cFast converging ADMM-penalized algorithm for LDPC decoding,\u201d IEEE Commun. Lett., vol.20, no.4, pp.644-647, April 2016. 10.1109\/lcomm.2016.2531040","DOI":"10.1109\/LCOMM.2016.2531040"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] 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":"12","doi-asserted-by":"publisher","unstructured":"[12] I. Debbabi, B.L. Gal, N. Khouja, F. Tlili, and C. Jego, \u201cReal time LP decoding of LDPC codes for high correction performance applications,\u201d IEEE Wireless Commun. Lett., vol.5, no.6, pp.676-679, Dec. 2016. 10.1109\/lwc.2016.2615304","DOI":"10.1109\/LWC.2016.2615304"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] I. Debbabi, B.L. Gal, N. Khouja, F. Tlili, and C. Jego, \u201cMulticore and manycore implementations of ADMM-based decoders for LDPC decoding,\u201d J. Signal Process. Syst., pp.1-17, Sept. 2017. 10.1007\/s11265-017-1284-0","DOI":"10.1007\/s11265-017-1284-0"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] Y.H. Chen, Y.J. Chen, X.Y. Shih, and A.Y. Wu, \u201cA channel-adaptive early termination strategy for LDPC decoders,\u201d Proc. IEEE Workshop on Signal Processing Systems, pp.226-231, Tampere, Finland, Oct. 2009. 10.1109\/sips.2009.5336256","DOI":"10.1109\/SIPS.2009.5336256"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] J. Li, G. He, H. Hou, Z. Zhang, and J. Ma, \u201cMemory efficient layered decoder design with early termination for LDPC codes,\u201d Proc. IEEE Int. Symp. Circuits and Systems, pp.2697-2700, Rio de Janeiro, Brazil, May 2011. 10.1109\/iscas.2011.5938161","DOI":"10.1109\/ISCAS.2011.5938161"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] C.H. Lin, T.H. Huang, C.C. Chen, and S.Y. Lin, \u201cEfficient layer stopping technique for layered LDPC decoding,\u201d Electron. Lett., vol.49, no.16, pp.994-996, Aug. 2013.","DOI":"10.1049\/el.2013.1843"},{"key":"17","doi-asserted-by":"publisher","unstructured":"[17] M. Ferrari, S. Belini, and A. Tomasoni, \u201cSafe early stopping of layered LDPC decoding,\u201d IEEE Commun. Lett., vol.19, no.3, pp.315-318, March 2015. 10.1109\/lcomm.2014.2386853","DOI":"10.1109\/LCOMM.2014.2386853"}],"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\/E101.A\/3\/E101.A_623\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,12]],"date-time":"2019-10-12T03:55:03Z","timestamp":1570852503000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E101.A\/3\/E101.A_623\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.e101.a.623","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}