Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
184 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Design and Analysis of Massive Uncoupled Unsourced Random Access with Bayesian Joint Decoding (2405.03196v1)

Published 6 May 2024 in cs.IT and math.IT

Abstract: In this paper, we investigate unsourced random access for massive machine-type communications (mMTC) in the sixth-generation (6G) wireless networks. Firstly, we establish a high-efficiency uncoupled framework for massive unsourced random access without extra parity check bits. Then, we design a low-complexity Bayesian joint decoding algorithm, including codeword detection and stitching. In particular, we present a Bayesian codeword detection approach by exploiting Bayes-optimal divergence-free orthogonal approximate message passing in the case of unknown priors. The output long-term channel statistic information is well leveraged to stitch codewords for recovering the original message. Thus, the spectral efficiency is improved by avoiding the use of parity bits. Moreover, we analyze the performance of the proposed Bayesian joint decoding-based massive uncoupled unsourced random access scheme in terms of computational complexity and error probability of decoding. Furthermore, by asymptotic analysis, we obtain some useful insights for the design of massive unsourced random access. Finally, extensive simulation results confirm the effectiveness of the proposed scheme in 6G wireless networks.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (34)
  1. X. Chen, D. W. K. Ng, W. Yu, E. G. Larsson, N. Al-Dhahir, and R. Schober, “Massive access for 5G and beyond,” IEEE J. Sel. Areas Commun., vol. 39, no. 3, pp. 615-637, Mar. 2021.
  2. Z. Gao, M. Ke, Y. Mei, L. Qiao, S. Chen, D. W. K. Ng, H. V. Poor, “Compressive sensing-based grant-free massive access for 6G massive communication,” IEEE Internet of Things J., vol. 11, no. 5, pp. 7411-7435, Mar. 2024.
  3. L. Liu, E. G. Larsson, W. Yu, P. Popovski, C. Stefanovic, and 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., vol. 35, no. 5, pp. 88-99, Sep. 2018.
  4. Z. Zhang, X. Wang, Y. Zhang, and Y. Chen, “Grant-free rateless multiple access: A novel massive access scheme for internet of things,” IEEE Commun. Lett., vol. 20, no. 10, pp. 2019-2022, Oct. 2016.
  5. K. Senel and E. G. Larsson, “Grant-free massive MTC-enabled massive MIMO: A compressive sensing approach,” IEEE Trans. Commun., vol. 66, no. 12, pp. 6164-6175, Dec. 2018.
  6. M. Ke, Z. Gao, Y. Wu, X. Gao, and R. Schober, “Compressive sensing-based adaptive active user detection and channel estimation: Massive access meets massive MIMO,” IEEE Trans. Signal Process., vol. 68, pp. 764-779, 2020.
  7. Y. Polyanskiy, “A perspective on massive random access,” in Proc. IEEE International Symposium on Information Theory (ISIT), pp. 2523-2527, Aug. 2017.
  8. V. K. Amalladinne, J. Chamberland, and K. R. Narayanan, “A coupled compressive sensing scheme for unsourced multiple access,” in Proc. IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 6628-6632, Sep. 2018.
  9. V. K. Amalladinne, A. K. Pradhan, C. Rush, J. Chamberland, and K. R. Narayanan, “On approximate message passing for unsourced access with coded compressed sensing,” in Proc. IEEE International Symposium on Information Theory (ISIT), Aug. 2020.
  10. Y. Wu, X. Gao, S. Zhou, W. Yang, Y. Polyanskiy, and G. Caire, “Massive access for future wireless communication system,” IEEE Wireless Commun., vol. 27, no. 4, pp. 148-156, Apr. 2020.
  11. A. K. Pradhan, V. K. Amalladinne, K. R. Narayanan, and J. Chamberland, “Polar coding and random spreading for unsourced multiple access,” in Proc. IEEE International Conference on Communications (ICC), Jul. 2020.
  12. F. Tian, X. Chen, L. Liu, and D. W. K. Ng, “Massive unsourced random access over rician fading channels: Design, analysis, and optimization,” IEEE Internet Things J., vol. 9, no. 18, pp. 17675-17688, Sep. 2022.
  13. A. Fengler, G. Caire, P. Jung, and S. Haghighatshoar, “Massive MIMO unsourced random access,” arXiv:1901.00828, 2019.
  14. A. Fengler, P. Jung, and G. Caire, “SPARCs for unsourced random access,” IEEE Trans. Info. Theory, vol. 67, no. 10, pp.6894-6915, Oct. 2021.
  15. A. Fengler, S. Haghighatshoar, P. Jung, and G. Caire, “Non-Bayesian activity detection, large-scale fading coefficient estimation, and unsourced random access with a massive MIMO receiver,” IEEE Trans. Info. Theory, vol. 67, no. 5, pp. 2925-2951, Mar. 2021.
  16. J. Che, Z. Zhang, Z. Yang, X. Chen, C. Zhong, and D. W. K. Ng, “Unsourced random massive access with beam-space tree decoding,” IEEE J. Sel. Areas Commun., vol. 40, no.4, pp. 1146-1161, Apr. 2022.
  17. V. K. Amalladinne, A. K. Pradhan, C. Rush, and J. Chamberland, “Unsourced random access with coded compressed sensing: Integrating AMP and belief propagation,” IEEE Trans. Info. Theory, vol. 68, no. 4, pp. 2384-2409, Apr. 2022.
  18. A. K. Pradhan, V. Amalladinne, A. Vem, K. R. Narayanan, and J-F. Chamberland, “Sparse IDMA: A joint graph-based coding scheme for unsourced random access,” IEEE Trans. Commun., vol. 70, no. 11, pp. 7124-7133, Nov. 2022.
  19. V. Shyianov, F. Bellili, A. Mezghani, and E. Hossain, “Massive unsourced random access based on uncoupled compressive sensing: Another blessing of massive MIMO,” IEEE J. Sel. Areas Commun., vol. 39, no. 3, pp. 820-834, Aug. 2020.
  20. X. Xie, Y. Wu, J. An, J. Gao, W. Zhang, C. Xing, K-K. Wong, and C. Xiao, “Massive unsourced random access: exploiting angular domain sparsity,” IEEE Trans. Commun., vol. 70, no. 4, pp. 2480-2498, Apr. 2022.
  21. T. Li, Y. Wu, M. Zheng, W. Zhang, C. Xing, J. An, X. Xia, and C. Xiao, “Joint device detection, channel estimation, and data decoding with collision resolution for MIMO massive unsourced random access,” IEEE J. Sel. Areas Commun., vol. 40, no. 5, pp. 1535-1555, May 2022.
  22. J. Ziniel and P. Schniter, “Efficient high-dimensional inference in the multiple measurement vector problem,” IEEE Trans. Signal Process., vol. 61, no. 2, pp. 340-354, Jan. 2013.
  23. J. Ma and L. Ping, “Orthogonal AMP,” IEEE Access, vol. 5, pp. 2020-2033, 2017.
  24. S. Rangan, P. Schniter, and A. K. Fletcher, “Vector approximate message passing,” IEEE Trans. Info. Theory, vol. 65, no. 10, pp. 6664-6684, Oct. 2019.
  25. Y. Cheng, L. Liu, and L. Ping, “Orthogonal AMP for massive access in channels with spatial and temporal correlations,” IEEE J. Sel. Areas Commun., vol. 39, no. 3, pp. 726-740, Mar. 2021.
  26. J. P. Vila and P. Schniter, “Expectation-maximization Gaussian-mixture approximate message passing,” IEEE Trans. Signal Process., vol. 61, no. 19, pp. 4658-4672, Oct. 2013.
  27. F. Tian, L. Liu, and X. Chen, “Generalized memory approximate message passing for generalized linear model,” IEEE Trans. Signal Process., vol. 70, pp. 6404-6418, 2022.
  28. A. H. Jahromi and M. Taheri, “A non-parametric mixture of Gaussian naive Bayes classifiers based on local independent features,” in Proc. 2017 Artificial Intelligence and Signal Processing Conference (AISP), Mar. 2018.
  29. M. Ontivero-Ortega, A. Lage-Castellanos, G. Valente, R. Goebel, and M. Valdes-Sosa, “Fast Gaussian Naive Bayes for searchlight classification analysis,” NeuroImage, vol. 163, pp. 471-479, Dec. 2017.
  30. L. Liu and W. Yu, “Massive connectivity with massive MIMO-Part 1: Device activity detection and channel estimation,” IEEE Trans. Signal Process., vol. 66, no. 11, pp. 2933-2946, Jun. 2018.
  31. W. Gautschi, “The incomplete Gamma functions since Tricomi,” Atti dei Convegni Linci, no. 1998, pp. 203-237, 2011.
  32. H. Q. Ngo, E. G. Larsson, and T. L. Marzetta, “Energy and spectral efficiency of very large multiuser MIMO systems,” IEEE Trans. Commun., vol. 61, no. 4, pp. 1436-1449, Apr. 2013.
  33. M. Gkagkos, K. R. Narayanan, J.-F. Chamberland, and C. N. Georghiades, “FASURA: A scheme for quasi-static fading unsourced random access channels,” IEEE Trans. Commun., vol. 71, no. 11, pp. 6391-6401, Nov. 2023.
  34. M. Ke, Z. Gao, M. Zhou, D. Zheng, D. W. K. Ng, and H. V. Poor, “Next-generation URLLC with massive devices: A unified semi-blind detection framework for sourced and unsourced random access,” IEEE J. Sel. Areas Commun., vol. 41, no. 7, pp. 2223-2244, Jul. 2023.
Citations (1)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now