{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T15:52:12Z","timestamp":1774540332807,"version":"3.50.1"},"reference-count":27,"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":[[2023,3,1]]},"DOI":"10.1587\/transfun.2022tap0002","type":"journal-article","created":{"date-parts":[[2022,8,31]],"date-time":"2022-08-31T22:22:13Z","timestamp":1661984533000},"page":"359-367","source":"Crossref","is-referenced-by-count":7,"title":["Proximal Decoding for LDPC Codes"],"prefix":"10.1587","volume":"E106.A","author":[{"given":"Tadashi","family":"WADAYAMA","sequence":"first","affiliation":[{"name":"Department of Computer Science, Nagoya Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satoshi","family":"TAKABE","sequence":"additional","affiliation":[{"name":"Department of Mathematical and Computing Science, Tokyo Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","unstructured":"[2] J. Feldman, \u201cDecoding error-correcting codes via linear programming,\u201d Massachusetts Institute of Technology, Ph.D. thesis, 2003."},{"key":"2","doi-asserted-by":"publisher","unstructured":"[3] J. Feldman, M.T. Wainwright, and D.R. Karger, \u201cUsing linear programming to decoding binary linear codes,\u201d IEEE Trans. Inf. Theory, vol.51, no.1, pp.954-972, 2005. 10.1109\/tit.2004.842696","DOI":"10.1109\/TIT.2004.842696"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[4] T. Wadayama, K. Nakamura, M. Yagita, Y. Funahashi, S. Usami, and I. Takumi, \u201cGradient descent bit flipping algorithms for decoding LDPC codes,\u201d IEEE Trans. Commun., vol.58, no.6, pp.1610-1614, 2010. 10.1109\/tcomm.2010.06.090046","DOI":"10.1109\/TCOMM.2010.06.090046"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[5] G. Sundararajan, C. Winstead, and E. Boutillon, \u201cNoisy gradient descent bit-flip decoding for LDPC codes,\u201d IEEE Trans. Commun., vol.62, no.10, pp.3385-3400, 2014. 10.1109\/tcomm.2014.2356458","DOI":"10.1109\/TCOMM.2014.2356458"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[6] P.O. Vontobel, \u201cInterior-point algorithms for linear-programming decoding,\u201d IEEE Information Theory and Applications Workshop, 2008. 10.1109\/ita.2008.4601085","DOI":"10.1109\/ITA.2008.4601085"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[7] T. Wadayama, \u201cInterior point decoding for linear vector channels based on convex optimization,\u201d IEEE Trans. Inf. Theory, vol.56, no.10, pp.4905-4921, 2010. 10.1109\/tit.2010.2060030","DOI":"10.1109\/TIT.2010.2060030"},{"key":"7","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 IEEE International Symposium on Information Theory (ISIT), 2013. 10.1109\/isit.2013.6620477","DOI":"10.1109\/ISIT.2013.6620477"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[9] 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, 2016. 10.1109\/TIT.2016.2555847","DOI":"10.1109\/TIT.2016.2555847"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[10] X. Liu and S.C. Draper, \u201cADMM LP decoding of non-binary LDPC codes in F<sub>2<i><sup>m<\/sup><\/i><\/sub>,\u201d IEEE Trans. Inf. Theory, vol.62, no.6, pp.2985-3010, 2016. 10.1109\/tit.2016.2554598","DOI":"10.1109\/TIT.2016.2554598"},{"key":"10","unstructured":"[11] Y. Wang and J. Bai, \u201cProximal-ADMM decoder for nonbinary LDPC codes,\u201d arXiv preprint arXiv:2010.09534, 2020. 10.48550\/arXiv.2010.09534"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[12] N. Parikh and S. Boyd, Proximal algorithms (Foundations and Trends in Optimization), Now Publisher, 2014.","DOI":"10.1561\/2400000003"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[14] I. Daubechies, M. Defrise, and C.D. Mol, \u201cAn iterative thresholding algorithm for linear inverse problems with a sparsity constraint,\u201d Comm. Pure Appl. Math., vol.57, no.11, pp.1413-1457, 2004. 10.1002\/cpa.20042","DOI":"10.1002\/cpa.20042"},{"key":"13","doi-asserted-by":"publisher","unstructured":"[15] R. Tibshirani, \u201cRegression shrinkage and selection via the lasso,\u201d J. Royal Stat. Society, Series B, vol.58, pp.267-288, 1996. 10.1111\/j.2517-6161.1996.tb02080.x","DOI":"10.1111\/j.2517-6161.1996.tb02080.x"},{"key":"14","doi-asserted-by":"publisher","unstructured":"[16] E.G. Larsson, O. Edfors, F. Tufvesson, and T.L. Marzetta, \u201cMassive MIMO for next generation wireless systems,\u201d IEEE Commun. Mag., vol.52, no.2, pp.186-195, 2014. 10.1109\/mcom.2014.6736761","DOI":"10.1109\/MCOM.2014.6736761"},{"key":"15","doi-asserted-by":"publisher","unstructured":"[17] S. Takabe, M. Imanishi, T. Wadayama, R. Hayakawa, and K. Hayashi, \u201cTrainable projected gradient detector for massive overloaded MIMO channels: Data-driven tuning approach,\u201d IEEE Access, vol.7, pp.93326-93338, 2019. 10.1109\/access.2019.2927997","DOI":"10.1109\/ACCESS.2019.2927997"},{"key":"16","unstructured":"[18] I. Goodfellow, Y. Bengio, and A. Courville, Deep Learning, MIT Press, 2017."},{"key":"17","unstructured":"[19] D.J.C. MacKay, \u201cEncyclopedia of sparse graph codes [online],\u201d Available: http:\/\/www.inference.phy.cam.ac.uk\/mackay\/codes\/data.html"},{"key":"18","doi-asserted-by":"publisher","unstructured":"[20] D.S. Shiu, G.J. Foschini, M.J. Gans, and J.M. Kahn, \u201cFading correlation and its effect on the capacity of multielement antenna systems,\u201d IEEE Trans. Commun., vol.48, no.3, pp.502-513, 2000. 10.1109\/26.837052","DOI":"10.1109\/26.837052"},{"key":"19","doi-asserted-by":"publisher","unstructured":"[21] D. Divsalar, M.K. Simon, and D. Raphaeli, \u201cImproved parallel interference cancellation for CDMA,\u201d IEEE Trans. Commun., vol.46, no.2, pp.258-268, 1998. 10.1109\/26.659484","DOI":"10.1109\/26.659484"},{"key":"20","doi-asserted-by":"publisher","unstructured":"[22] J. Ma, L. Liu, X. Yuan, and L. Ping, \u201cOn orthogonal amp in coded linear vector systems,\u201d IEEE Trans. Wireless Commun., vol.18, no.12, pp.5658-5672, 2019. 10.1109\/twc.2019.2938170","DOI":"10.1109\/TWC.2019.2938170"},{"key":"21","doi-asserted-by":"publisher","unstructured":"[23] A. Sanderovich, M. Peleg, and S.S Shamai, \u201cLDPC coded MIMO multiple access with iterative joint decoding,\u201d IEEE Trans. Inf. Theory, vol.51, no.4, pp.1437-1450, 2005. 10.1109\/tit.2005.844064","DOI":"10.1109\/TIT.2005.844064"},{"key":"22","doi-asserted-by":"publisher","unstructured":"[24] I. Hwang, H.J. Park, and J.W. Lee, \u201cLDPC coded massive MIMO systems,\u201d Entropy, vol.21, no.3, 231, 2019. 10.3390\/e21030231","DOI":"10.3390\/e21030231"},{"key":"23","unstructured":"[25] T. Wadayama, \u201cAn iterative decoding algorithm for channels with additive linear dynamical noise,\u201d IEICE Trans. Fundamentals, vol.E86-A, no.10, pp.2452-2460, Oct. 2003."},{"key":"24","unstructured":"[26] P. Ramachandran, B.Z. Barret, and Q.V. Le, \u201cSwish: A self-gated activation function,\u201d arXiv preprint arXiv:1710.05941, 2017."},{"key":"25","doi-asserted-by":"publisher","unstructured":"[27] M. Innes, \u201cFlux: Elegant machine learning with Julia,\u201d Journal of Open Source Software, vol.3, no.25, 602, 2018. 10.21105\/joss.00602","DOI":"10.21105\/joss.00602"},{"key":"26","unstructured":"[28] J. Bezanson, S. Karpinski, B. Viral, and A. Edelman, \u201cJulia: A fast dynamic language for technical computing,\u201d arXiv preprint arXiv:1209.5145, 2012. 10.48550\/arXiv.1209.5145"},{"key":"27","doi-asserted-by":"crossref","unstructured":"[29] T. Wadayama and S. Takabe, \u201cProximal decoding for LDPC-coded massive MIMO channels,\u201d IEEE International Symposium on Information Theory, 2021. 10.1109\/isit45174.2021.9517988","DOI":"10.1109\/ISIT45174.2021.9517988"}],"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\/E106.A\/3\/E106.A_2022TAP0002\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,4]],"date-time":"2023-03-04T03:20:48Z","timestamp":1677900048000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E106.A\/3\/E106.A_2022TAP0002\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,1]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2022tap0002","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,1]]},"article-number":"2022TAP0002"}}