{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T23:56:54Z","timestamp":1772927814038,"version":"3.50.1"},"reference-count":25,"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":[[2026,3,1]]},"DOI":"10.1587\/transfun.2025tap0018","type":"journal-article","created":{"date-parts":[[2025,9,7]],"date-time":"2025-09-07T22:07:19Z","timestamp":1757282839000},"page":"414-423","source":"Crossref","is-referenced-by-count":0,"title":["End-to-End Machine-Learning-Aided Signature Code for Multi-Access Rayleigh Fading Channel"],"prefix":"10.1587","volume":"E109.A","author":[{"given":"Lantian","family":"WEI","sequence":"first","affiliation":[{"name":"Department of Computer Science, Nagoya Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shan","family":"LU","sequence":"additional","affiliation":[{"name":"Department of Information and Communication Engineering, Nagoya 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"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] Y. Polyanskiy, \u201cA perspective on massive random-access,\u201d 2017 IEEE International Symposium on Information Theory (ISIT), pp.2523-2527, IEEE, 2017. 10.1109\/isit.2017.8006984","DOI":"10.1109\/ISIT.2017.8006984"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] Z. Chen, F. Sohrabi, and W. Yu, \u201cSparse activity detection for massive connectivity,\u201d IEEE Trans. Signal Process., vol.66, no.7, pp.1890-1904, 2018. 10.1109\/tsp.2018.2795540","DOI":"10.1109\/TSP.2018.2795540"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] 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":"4","doi-asserted-by":"publisher","unstructured":"[4] 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":"5","doi-asserted-by":"publisher","unstructured":"[5] L. Wei, S. Lu, H. Kamabe, and J. Cheng, \u201cUser identification and channel estimation by iterative DNN-based decoder on multiple-access fading channel,\u201d IEICE Trans Fundamentals, vol.E105-A, no.3, pp.417-424, March 2022. 10.1587\/transfun.2021tap0008","DOI":"10.1587\/transfun.2021TAP0008"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] 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":"7","doi-asserted-by":"publisher","unstructured":"[7] 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":"8","doi-asserted-by":"crossref","unstructured":"[8] W. Yin, S. Morgan, J. Yang, and Y. Zhang, \u201cPractical compressive sensing with toeplitz and circulant matrices,\u201d Visual Communications and Image Processing 2010, pp.182-191, 2010. 10.1117\/12.863527","DOI":"10.1117\/12.863527"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] R.A. DeVore, \u201cDeterministic constructions of compressed sensing matrices,\u201d Journal of Complexity, vol.23, no.4-6, pp.918-925, 2007. 10.1016\/j.jco.2007.04.002","DOI":"10.1016\/j.jco.2007.04.002"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] X. Liu and L. Jia, \u201cDeterministic construction of compressed sensing matrices via vector spaces over finite fields,\u201d IEEE Access, vol.8, pp.203301-203308, 2020. 10.1109\/access.2020.3034912","DOI":"10.1109\/ACCESS.2020.3034912"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] R. Lu, \u201cOn the strong restricted isometry property of bernoulli random matrices,\u201d Journal of Approximation Theory, vol.245, pp.1-22, 2019. 10.1016\/j.jat.2019.04.005","DOI":"10.1016\/j.jat.2019.04.005"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] A. Felix, S. Cammerer, S. D\u00f6rner, J. Hoydis, and S. Ten Brink, \u201cOFDM-autoencoder for end-to-end learning of communications systems,\u201d 2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), pp.1-5, 2018. 10.1109\/spawc.2018.8445920","DOI":"10.1109\/SPAWC.2018.8445920"},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] 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":"14","doi-asserted-by":"publisher","unstructured":"[14] N. Kim, D. Kim, B. Shim, and K.B. Lee, \u201cDeep learning-based spreading sequence design and active user detection for massive machine-type communications,\u201d IEEE Wireless Commun. Lett., vol.10, no.8, pp.1618-1622, Aug. 2021. 10.1109\/lwc.2021.3071453","DOI":"10.1109\/LWC.2021.3071453"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] L. Wei, S. Lu, and H. Kamabe, \u201cBNNs- and TISTA- based signature code design for user identification and channel estimation over multiple-access channel with rayleigh fading,\u201d 2023 IEEE Information Theory Workshop (ITW), pp.147-152, IEEE, 2023. 10.1109\/itw55543.2023.10161674","DOI":"10.1109\/ITW55543.2023.10161674"},{"key":"16","doi-asserted-by":"publisher","unstructured":"[16] 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":"17","unstructured":"[17] I. Hubara, M. Courbariaux, D. Soudry, R. El-Yaniv, and Y. Bengio, \u201cBinarized neural networks,\u201d Advances in Neural Information Processing Systems, vol.29, 2016."},{"key":"18","doi-asserted-by":"publisher","unstructured":"[18] R. Gribonval, \u201cShould penalized least squares regression be interpreted as maximum a posteriori estimation?,\u201d IEEE Trans. Signal Process., vol.59, no.5, pp.2405-2410, 2011. 10.1109\/tsp.2011.2107908","DOI":"10.1109\/TSP.2011.2107908"},{"key":"19","unstructured":"[19] D.P. Kingma and J. Ba, \u201cAdam: A method for stochastic optimization,\u201d arXiv preprint arXiv:1412.6980, 2014. 10.48550\/arXiv.1412.6980"},{"key":"20","unstructured":"[20] 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":"21","doi-asserted-by":"publisher","unstructured":"[21] 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":"22","doi-asserted-by":"crossref","unstructured":"[22] 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","DOI":"10.1109\/ACSSC.1993.342465"},{"key":"23","doi-asserted-by":"publisher","unstructured":"[23] E. Candes and T. Tao, \u201cDecoding by linear programming,\u201d IEEE Trans. Inf. Theory, vol.51, no.12, pp.4203-4215, 2005. 10.1109\/tit.2005.858979","DOI":"10.1109\/TIT.2005.858979"},{"key":"24","doi-asserted-by":"publisher","unstructured":"[24] J.A. Tropp and S.J. Wright, \u201cComputational methods for sparse solution of linear inverse problems,\u201d Proc. IEEE, vol.98, no.6, pp.948-958, 2010. 10.1109\/jproc.2010.2044010","DOI":"10.1109\/JPROC.2010.2044010"},{"key":"25","doi-asserted-by":"publisher","unstructured":"[25] S. Gleichman and Y.C. Eldar, \u201cBlind compressed sensing,\u201d IEEE Trans. Inf. Theory, vol.57, no.10, pp.6958-6975, 2011. 10.1109\/tit.2011.2165821","DOI":"10.1109\/TIT.2011.2165821"}],"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\/E109.A\/3\/E109.A_2025TAP0018\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T04:11:41Z","timestamp":1772856701000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E109.A\/3\/E109.A_2025TAP0018\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,1]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2025tap0018","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,1]]},"article-number":"2025TAP0018"}}