{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,25]],"date-time":"2026-07-25T16:45:23Z","timestamp":1784997923797,"version":"3.55.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,4,16]],"date-time":"2024-04-16T00:00:00Z","timestamp":1713225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,4,16]],"date-time":"2024-04-16T00:00:00Z","timestamp":1713225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["EURASIP J. Adv. Signal Process."],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In the paper, we investigate a massive machine-type communication (mMTC), where numerous single-antenna users communicate with a single-antenna base station while being active. However, the status of user can undergoes multiple transitions between active and inactive states across whole consecutive intervals. Then, we formulate the problem of joint user activity detection and channel estimation within the dynamic compressed sensing (DCS) framework, considering the temporally-correlated user activity across the entire consecutive intervals. To be specific, we introduce a new hybrid vector approximate message passing algorithm for DCS (HyVAMP-DCS). The proposed algorithm comprises a VAMP block for estimating channel and a loopy belief propagation (LBP) block for detecting user activity. Moreover, these two blocks can exchange messages, enhancing the performance of both channel estimation and user activity detection. Importantly, compared to the fragile GAMP algorithm, VAMP is robust and applicable to a much broader class of large random matrices. Furthermore, the fixed points of VAMP\u2019s state evolution align with the replica prediction of the minimum mean-squared error. The simulation results illustrate the superiority of HyVAMP-DCS, demonstrating its significant outperformance over HyGAMP-DCS.<\/jats:p>","DOI":"10.1186\/s13634-024-01151-1","type":"journal-article","created":{"date-parts":[[2024,4,16]],"date-time":"2024-04-16T17:01:47Z","timestamp":1713286907000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Temporally-correlated massive access: joint user activity detection and channel estimation via vector approximate message passing"],"prefix":"10.1186","volume":"2024","author":[{"given":"Yueyue","family":"Xiong","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wei","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,4,16]]},"reference":[{"key":"1151_CR1","doi-asserted-by":"crossref","unstructured":"Y. Wu, S. Tang, L. Zhang, Resilient machine learning based semantic-aware MEC networks for sustainable next-G consumer electronics. IEEE Trans. Consumer Electron. 99, 1\u201310 (2023)","DOI":"10.1109\/TCE.2023.3338819"},{"key":"1151_CR2","unstructured":"S. Tang, Q. Yang, L. Fan, Contrastive learning based semantic communications. IEEE Trans. Commun. 99, 1\u201312 (2024)"},{"issue":"3","key":"1151_CR3","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1109\/JSAC.2020.3019724","volume":"39","author":"X Chen","year":"2020","unstructured":"X. Chen, D.W.K. Ng, W. Yu, E.G. Larsson, N. Al-Dhahir, R. Schober, Massive access for 5G and beyond. IEEE J. Sel. Areas Commun. 39(3), 615\u2013637 (2020)","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"9","key":"1151_CR4","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1109\/MCOM.2016.7565189","volume":"54","author":"C Bockelmann","year":"2016","unstructured":"C. Bockelmann, N. Pratas, H. Nikopour, K. Au, T. Svensson, C. Stefanovic, P. Popovski, A. Dekorsy, Massive machine-type communications in 5G: physical and MAC-layer solutions. IEEE Commun. Mag. 54(9), 59\u201365 (2016)","journal-title":"IEEE Commun. Mag."},{"issue":"5","key":"1151_CR5","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1109\/MSP.2018.2844952","volume":"35","author":"L Liu","year":"2018","unstructured":"L. Liu, E.G. Larsson, W. Yu, P. Popovski, C. Stefanovic, E. De Carvalho, Sparse signal processing for grant-free massive connectivity: a future paradigm for random access protocols in the Internet of Things. IEEE Signal Process. Mag. 35(5), 88\u201399 (2018)","journal-title":"IEEE Signal Process. Mag."},{"issue":"11","key":"1151_CR6","doi-asserted-by":"publisher","first-page":"2933","DOI":"10.1109\/TSP.2018.2818082","volume":"66","author":"L Liu","year":"2018","unstructured":"L. Liu, W. Yu, Massive connectivity with massive MIMO-part I: device activity detection and channel estimation. IEEE Trans. Signal Process. 66(11), 2933\u20132946 (2018)","journal-title":"IEEE Trans. Signal Process."},{"issue":"12","key":"1151_CR7","doi-asserted-by":"publisher","first-page":"6164","DOI":"10.1109\/TCOMM.2018.2866559","volume":"66","author":"K Senel","year":"2018","unstructured":"K. Senel, E.G. Larsson, Grant-free massive MTC-enabled massive MIMO: a compressive sensing approach. IEEE Trans. Commun. 66(12), 6164\u20136175 (2018)","journal-title":"IEEE Trans. Commun."},{"issue":"12","key":"1151_CR8","doi-asserted-by":"publisher","first-page":"12000","DOI":"10.1109\/TVT.2019.2947214","volume":"68","author":"Z Zhang","year":"2019","unstructured":"Z. Zhang, Y. Li, C. Huang, Q. Guo, C. Yuen, Y.L. Guan, DNN-aided block sparse Bayesian learning for user activity detection and channel estimation in grant-free non-orthogonal random access. IEEE Trans. Veh. Technol. 68(12), 12000\u201312012 (2019)","journal-title":"IEEE Trans. Veh. Technol."},{"issue":"3","key":"1151_CR9","doi-asserted-by":"publisher","first-page":"1988","DOI":"10.1109\/TWC.2019.2901482","volume":"18","author":"Y Li","year":"2019","unstructured":"Y. Li, M. Xia, Y.-C. Wu, Activity detection for massive connectivity under frequency offsets via first-order algorithms. IEEE Trans. Wireless Commun. 18(3), 1988\u20132002 (2019)","journal-title":"IEEE Trans. Wireless Commun."},{"key":"1151_CR10","doi-asserted-by":"crossref","unstructured":"H.F. Schepker, C. Bockelmann, A. Dekorsy, Exploiting sparsity in channel and data estimation for sporadic multi-user communication. In: Proc. 10th Int. Symp. Wireless Commun. Syst., pp. 1\u20135 (2013). VDE","DOI":"10.1109\/VTCSpring.2013.6692494"},{"issue":"7","key":"1151_CR11","doi-asserted-by":"publisher","first-page":"1890","DOI":"10.1109\/TSP.2018.2795540","volume":"66","author":"Z Chen","year":"2018","unstructured":"Z. Chen, F. Sohrabi, W. Yu, Sparse activity detection for massive connectivity. IEEE Trans. Signal Process. 66(7), 1890\u20131904 (2018)","journal-title":"IEEE Trans. Signal Process."},{"key":"1151_CR12","doi-asserted-by":"publisher","first-page":"1290","DOI":"10.1109\/LSP.2020.3008550","volume":"27","author":"Q Zou","year":"2020","unstructured":"Q. Zou, H. Zhang, D. Cai, H. Yang, A low-complexity joint user activity, channel and data estimation for grant-free massive MIMO systems. IEEE Signal Process. Lett. 27, 1290\u20131294 (2020)","journal-title":"IEEE Signal Process. Lett."},{"key":"1151_CR13","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1109\/LSP.2020.2979534","volume":"27","author":"Q Zou","year":"2020","unstructured":"Q. Zou, H. Zhang, D. Cai, H. Yang, Message passing based joint channel and user activity estimation for uplink grant-free massive MIMO systems with low-precision ADCs. IEEE Signal Process. Lett. 27, 506\u2013510 (2020)","journal-title":"IEEE Signal Process. Lett."},{"issue":"2","key":"1151_CR14","doi-asserted-by":"publisher","first-page":"967","DOI":"10.1109\/TCOMM.2021.3126619","volume":"70","author":"S Liu","year":"2021","unstructured":"S. Liu, H. Zhang, Q. Zou, Decentralized channel estimation for the uplink of grant-free massive machine-type communications. IEEE Trans. Commun. 70(2), 967\u2013979 (2021)","journal-title":"IEEE Trans. Commun."},{"key":"1151_CR15","doi-asserted-by":"crossref","unstructured":"D. Angelosante, G.B. Giannakis, E. Grossi, Compressed sensing of time-varying signals. In: Proc. 16th Int. Conf. Digit. Signal Process., pp. 1\u20138 (2009). IEEE","DOI":"10.1109\/ICDSP.2009.5201168"},{"issue":"21","key":"1151_CR16","doi-asserted-by":"publisher","first-page":"5270","DOI":"10.1109\/TSP.2013.2273196","volume":"61","author":"J Ziniel","year":"2013","unstructured":"J. Ziniel, P. Schniter, Dynamic compressive sensing of time-varying signals via approximate message passing. IEEE Trans. Signal Process. 61(21), 5270\u20135284 (2013)","journal-title":"IEEE Trans. Signal Process."},{"issue":"11","key":"1151_CR17","doi-asserted-by":"publisher","first-page":"2320","DOI":"10.1109\/LCOMM.2016.2602264","volume":"20","author":"B Wang","year":"2016","unstructured":"B. Wang, L. Dai, Y. Zhang, T. Mir, J. Li, Dynamic compressive sensing-based multi-user detection for uplink grant-free NOMA. IEEE Commun. Lett. 20(11), 2320\u20132323 (2016)","journal-title":"IEEE Commun. Lett."},{"issue":"9","key":"1151_CR18","doi-asserted-by":"publisher","first-page":"4595","DOI":"10.1109\/TSP.2010.2051150","volume":"58","author":"N Vaswani","year":"2010","unstructured":"N. Vaswani, W. Lu, Modified-CS: modifying compressive sensing for problems with partially known support. IEEE Trans. Signal Process. 58(9), 4595\u20134607 (2010)","journal-title":"IEEE Trans. Signal Process."},{"key":"1151_CR19","doi-asserted-by":"crossref","unstructured":"D. Angelosante, S.I. Roumeliotis, G.B. Giannakis, Lasso-kalman smoother for tracking sparse signals. In: Proc. Asilomar Conf. Signals, Syst., Comput., pp. 181\u2013185 (2009). IEEE","DOI":"10.1109\/ACSSC.2009.5470133"},{"issue":"7","key":"1151_CR20","doi-asserted-by":"publisher","first-page":"4541","DOI":"10.1109\/TWC.2021.3060451","volume":"20","author":"J-C Jiang","year":"2021","unstructured":"J.-C. Jiang, H.-M. Wang, Massive random access with sporadic short packets: Joint active user detection and channel estimation via sequential message passing. IEEE Trans. Wireless Commun. 20(7), 4541\u20134555 (2021)","journal-title":"IEEE Trans. Wireless Commun."},{"key":"1151_CR21","doi-asserted-by":"crossref","unstructured":"Q. Wang, L. Liu, S. Zhang, F.C. Lau, On massive IoT connectivity with temporally-correlated user activity. In: IEEE Int. Symp. on Inf. Theory., pp. 3020\u20133025 (2021). IEEE","DOI":"10.1109\/ISIT45174.2021.9517805"},{"key":"1151_CR22","doi-asserted-by":"crossref","unstructured":"J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference, (1988)","DOI":"10.1016\/B978-0-08-051489-5.50008-4"},{"key":"1151_CR23","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2023.3261382","volume-title":"Message Passing-Based Joint User Activity Detection and Channel Estimation for Temporally-Correlated Massive Access","author":"W Zhu","year":"2023","unstructured":"W. Zhu, M. Tao, X. Yuan, Y. Guan, Message Passing-Based Joint User Activity Detection and Channel Estimation for Temporally-Correlated Massive Access (IEEE Trans, Commun, 2023)"},{"issue":"45","key":"1151_CR24","doi-asserted-by":"publisher","first-page":"18914","DOI":"10.1073\/pnas.0909892106","volume":"106","author":"DL Donoho","year":"2009","unstructured":"D.L. Donoho, A. Maleki, A. Montanari, Message-passing algorithms for compressed sensing. Proc. Nat. Acad. Sci. 106(45), 18914\u201318919 (2009)","journal-title":"Proc. Nat. Acad. Sci."},{"issue":"43","key":"1151_CR25","doi-asserted-by":"publisher","first-page":"11111","DOI":"10.1088\/0305-4470\/36\/43\/030","volume":"36","author":"Y Kabashima","year":"2003","unstructured":"Y. Kabashima, A CDMA multiuser detection algorithm on the basis of belief propagation. J. Phys. A: Math. Gen. 36(43), 11111 (2003)","journal-title":"J. Phys. A: Math. Gen."},{"key":"1151_CR26","doi-asserted-by":"crossref","unstructured":"S. Rangan, Generalized approximate message passing for estimation with random linear mixing. In: Proc. IEEE Int. Symp. Inf. Theory., pp. 2168\u20132172 (2011). IEEE","DOI":"10.1109\/ISIT.2011.6033942"},{"issue":"10","key":"1151_CR27","doi-asserted-by":"publisher","first-page":"6664","DOI":"10.1109\/TIT.2019.2916359","volume":"65","author":"S Rangan","year":"2019","unstructured":"S. Rangan, P. Schniter, A.K. Fletcher, Vector approximate message passing. IEEE Trans. Inf. Theory 65(10), 6664\u20136684 (2019)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1151_CR28","doi-asserted-by":"crossref","unstructured":"H. He, C.-K. Wen, S. Jin, Generalized expectation consistent signal recovery for nonlinear measurements. In: IEEE Int. Symp. on Inf. Theory., pp. 2333\u20132337 (2017). IEEE","DOI":"10.1109\/ISIT.2017.8006946"},{"issue":"3","key":"1151_CR29","doi-asserted-by":"publisher","first-page":"726","DOI":"10.1109\/JSAC.2020.3018799","volume":"39","author":"Y Cheng","year":"2020","unstructured":"Y. Cheng, L. Liu, L. Ping, Orthogonal AMP for massive access in channels with spatial and temporal correlations. IEEE J. Sel. Areas Commun. 39(3), 726\u2013740 (2020)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"1151_CR30","unstructured":"T.P. Minka, Expectation propagation for approximate Bayesian inference. arXiv preprint arXiv:1301.2294 (2013)"},{"key":"1151_CR31","unstructured":"M. Opper, O. Winther, M.J. Jordan, Expectation consistent approximate inference. J. Mach. Learn. Res. 6(12) (2005)"},{"key":"1151_CR32","unstructured":"K. Murphy, Y. Weiss, M.I. Jordan, Loopy belief propagation for approximate inference: An empirical study. arXiv preprint arXiv:1301.6725 (2013)"},{"key":"1151_CR33","doi-asserted-by":"crossref","unstructured":"P. Schniter, S. Rangan, A.K. Fletcher, Vector approximate message passing for the generalized linear model. In: Proc. Asilomar Conf. Signals, Syst., Comput., pp. 1525\u20131529 (2016). IEEE","DOI":"10.1109\/ACSSC.2016.7869633"}],"container-title":["EURASIP Journal on Advances in Signal Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13634-024-01151-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s13634-024-01151-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13634-024-01151-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,16]],"date-time":"2024-11-16T10:43:52Z","timestamp":1731753832000},"score":1,"resource":{"primary":{"URL":"https:\/\/asp-eurasipjournals.springeropen.com\/articles\/10.1186\/s13634-024-01151-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,16]]},"references-count":33,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,12]]}},"alternative-id":["1151"],"URL":"https:\/\/doi.org\/10.1186\/s13634-024-01151-1","relation":{},"ISSN":["1687-6180"],"issn-type":[{"value":"1687-6180","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,16]]},"assertion":[{"value":"3 January 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 April 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 April 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"All authors disclosed no relevant relationships. The authors declared no potential conflicts of interest.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"52"}}