{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T14:19:02Z","timestamp":1772893142634,"version":"3.50.1"},"reference-count":24,"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":[[2022,3,1]]},"DOI":"10.1587\/transfun.2021tap0008","type":"journal-article","created":{"date-parts":[[2021,8,31]],"date-time":"2021-08-31T22:10:08Z","timestamp":1630447808000},"page":"417-424","source":"Crossref","is-referenced-by-count":3,"title":["User Identification and Channel Estimation by Iterative DNN-Based Decoder on Multiple-Access Fading Channel"],"prefix":"10.1587","volume":"E105.A","author":[{"given":"Lantian","family":"WEI","sequence":"first","affiliation":[{"name":"Graduate School of Engineering, Gifu University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shan","family":"LU","sequence":"additional","affiliation":[{"name":"Department of Electrical, Electronic and Computer Engineering, Gifu University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroshi","family":"KAMABE","sequence":"additional","affiliation":[{"name":"Department of Electrical, Electronic and Computer Engineering, Gifu University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"CHENG","sequence":"additional","affiliation":[{"name":"Department of Intelligent Information Engineering and Sciences, Doshisha University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] J. Cheng, K. Kamoi, and Y. Watanabe, \u201cError-correcting signature code for multiple-access adder channel,\u201d Proc. International Symposium on Information Theory, 2005. ISIT 2005., pp.2036-2039, 2005. 10.1109\/isit.2005.1523703","DOI":"10.1109\/ISIT.2005.1523703"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] J. Cheng, K. Kamoi, and Y. Watanabe, \u201cUser identification by signature code for noisy multiple-access adder channel,\u201d 2006 IEEE International Symposium on Information Theory, pp.1974-1977, 2006. 10.1109\/isit.2006.261894","DOI":"10.1109\/ISIT.2006.261894"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] S. Lu, W. Hou, and J. Cheng, \u201cA family of (<i>k<\/i>+1)-ary signature codes for noisy multiple-access adder channel,\u201d IEEE Trans. Inf. Theory, vol.61, no.11, pp.5848-5853, 2015. 10.1109\/tit.2015.2479219","DOI":"10.1109\/TIT.2015.2479219"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] I. Daubechies, M. Defrise, and C. De Mol, \u201cAn iterative thresholding algorithm for linear inverse problems with a sparsity constraint,\u201d Commun. Pur. Appl. Math., vol.57, no.11, pp.1413-1457, 2004. 10.1002\/cpa.20042","DOI":"10.1002\/cpa.20042"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] S.J. Kim, K. Koh, M. Lustig, S. Boyd, and D. Gorinevsky, \u201cAn interior-point method for large-scale <i>\u2113<\/i><sub>1<\/sub>-regularized least squares,\u201d IEEE J. Sel. Top. Signal Process., vol.1, no.4, pp.606-617, 2007. 10.1109\/jstsp.2007.910971","DOI":"10.1109\/JSTSP.2007.910971"},{"key":"6","unstructured":"[6] Y.C. Pati, R. Rezaiifar, and P.S. Krishnaprasad, \u201cOrthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition,\u201d Proc. 27th Asilomar Conference on Signals, Systems and Computers, pp.40-44, 1993. 10.1109\/acssc.1993.342465"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] J.A. Tropp and A.C. Gilbert, \u201cSignal recovery from random measurements via orthogonal matching pursuit,\u201d IEEE Trans. Inf. Theory, vol.53, no.12, pp.4655-4666, 2007. 10.1109\/tit.2007.909108","DOI":"10.1109\/TIT.2007.909108"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] L. Liu, E.G. Larsson, W. Yu, P. Popovski, C. Stefanovic, and E. de Carvalho, \u201cSparse signal processing for grant-free massive connectivity: A future paradigm for random access protocols in the internet of things,\u201d IEEE Signal Process. Mag., vol.35, no.5, pp.88-99, 2018. 10.1109\/msp.2018.2844952","DOI":"10.1109\/MSP.2018.2844952"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] T. Hara and K. Ishibashi, \u201cGrant-free non-orthogonal multiple access with multiple-antenna base station and its efficient receiver design,\u201d IEEE Access, vol.7, pp.175717-175726, 2019. 10.1109\/access.2019.2956817","DOI":"10.1109\/ACCESS.2019.2956817"},{"key":"10","unstructured":"[10] I. Goodfellow, Y. Bengio, and A. Courville, Deep Learning, MIT Press, 2016."},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] E. Nachmani, Y. Be&apos;ery, and D. Burshtein, \u201cLearning to decode linear codes using deep learning,\u201d 2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton), pp.341-346, 2016. 10.1109\/allerton.2016.7852251","DOI":"10.1109\/ALLERTON.2016.7852251"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[12] M. Kim, N.I. Kim, W. Lee, and D.H. Cho, \u201cDeep learning-aided SCMA,\u201d IEEE Commun. Lett., vol.22, no.4, pp.720-723, 2018. 10.1109\/lcomm.2018.2792019","DOI":"10.1109\/LCOMM.2018.2792019"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] J. Zhang and B. Ghanem, \u201cISTA-Net: Interpretable optimization-inspired deep network for image compressive sensing,\u201d Proc. IEEE Conference on Computer Vision and Pattern Recognition, pp.1828-1837, 2018. 10.1109\/cvpr.2018.00196","DOI":"10.1109\/CVPR.2018.00196"},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] D. Ito, S. Takabe, and T. Wadayama, \u201cTrainable ISTA for sparse signal recovery,\u201d IEEE Trans. Signal Process., vol.67, no.12, pp.3113-3125, 2019. 10.1109\/tsp.2019.2912879","DOI":"10.1109\/TSP.2019.2912879"},{"key":"15","doi-asserted-by":"publisher","unstructured":"[15] W. Kim, Y. Ahn, and B. Shim, \u201cDeep neural network-based active user detection for grant-free noma systems,\u201d IEEE Trans. Commun., vol.68, no.4, pp.2143-2155, 2020. 10.1109\/tcomm.2020.2969184","DOI":"10.1109\/TCOMM.2020.2969184"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] L. Wei, S. Lu, H. Kamabe, and J. Cheng, \u201cUser identification and channel estimation by DNN-based decoder on multiple-access channel,\u201d GLOBECOM 2020-2020 IEEE Global Communications Conference, pp.1-6, 2020. 10.1109\/globecom42002.2020.9322258","DOI":"10.1109\/GLOBECOM42002.2020.9322258"},{"key":"17","unstructured":"[17] X. Glorot, A. Bordes, and Y. Bengio, \u201cDeep sparse rectifier neural networks,\u201d Proc. Fourteenth International Conference on Artificial Intelligence and Statistics, pp.315-323, 2011."},{"key":"18","unstructured":"[18] S. Ioffe and C. Szegedy, \u201cBatch normalization: Accelerating deep network training by reducing internal covariate shift,\u201d arXiv preprint arXiv:1502.03167, 2015."},{"key":"19","unstructured":"[19] S. Santurkar, D. Tsipras, A. Ilyas, and A. Madry, \u201cHow does batch normalization help optimization?,\u201d Advances in Neural Information Processing Systems, pp.2483-2493, 2018."},{"key":"20","unstructured":"[20] D.P. Kingma and J. Ba, \u201cAdam: A method for stochastic optimization,\u201d arXiv preprint arXiv:1412.6980, 2014."},{"key":"21","unstructured":"[21] T. Tieleman and G. Hinton, \u201cLecture 6.5-rmsprop: Divide the gradient by a running average of its recent magnitude,\u201d COURSERA: Neural networks for machine learning, vol.4, no.2, pp.26-31, 2012."},{"key":"22","unstructured":"[22] X. Glorot and Y. Bengio, \u201cUnderstanding the difficulty of training deep feedforward neural networks,\u201d Proc. thirteenth International Conference on Artificial Intelligence and Statistics, pp.249-256, 2010."},{"key":"23","doi-asserted-by":"publisher","unstructured":"[23] S.S. Chen, D.L. Donoho, and M.A. Saunders, \u201cAtomic decomposition by basis pursuit,\u201d SIAM Rev., vol.43, no.1, pp.129-159, 2001. 10.1137\/s003614450037906x","DOI":"10.1137\/S003614450037906X"},{"key":"24","doi-asserted-by":"crossref","unstructured":"[24] M. Grant, S. Boyd, and Y. Ye, \u201cDisciplined convex programming,\u201d in Global optimization, pp.155-210, Springer, 2006. 10.1007\/0-387-30528-9_7","DOI":"10.1007\/0-387-30528-9_7"}],"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\/E105.A\/3\/E105.A_2021TAP0008\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,5]],"date-time":"2022-03-05T03:21:07Z","timestamp":1646450467000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E105.A\/3\/E105.A_2021TAP0008\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,1]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2021tap0008","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,1]]},"article-number":"2021TAP0008"}}