Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 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

Joint Activity-Delay Detection and Channel Estimation for Asynchronous Massive Random Access: A Free Probability Theory Approach (2402.17996v1)

Published 28 Feb 2024 in eess.SP, cs.IT, and math.IT

Abstract: Grant-free random access (RA) has been recognized as a promising solution to support massive connectivity due to the removal of the uplink grant request procedures. While most endeavours assume perfect synchronization among users and the base station, this paper investigates asynchronous grant-free massive RA, and develop efficient algorithms for joint user activity detection, synchronization delay detection, and channel estimation. Considering the sparsity on user activity, we formulate a sparse signal recovery problem and propose to utilize the framework of orthogonal approximate message passing (OAMP) to deal with the non-independent and identically distributed (i.i.d.) Gaussian pilot matrices caused by the synchronization delays. In particular, an OAMP-based algorithm is developed to fully harness the common sparsity among received pilot signals from multiple base station antennas. To reduce the computational complexity, we further propose a free probability AMP (FPAMP)-based algorithm, which exploits the rectangular free cumulants to make the cost-effective AMP framework compatible to general pilot matrices. Simulation results demonstrate that the two proposed algorithms outperform various baselines, and the FPAMP-based algorithm reduces 40% of the computations while maintaining comparable detection/estimation accuracy with the OAMP-based algorithm.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (27)
  1. X. Bian, Y. Mao, and J. Zhang, “Joint activity-delay detection and channel estimation for asynchronous massive random access,” in Proc. IEEE Global Commun. Conf. (GLOBECOM), Kuala Lumpur, Malaysia, Dec. 2023.
  2. M. T. Islam, A. E. M. Taha, and S. Akl, “A survey of access management techniques in machine type communications,” IEEE Commun. Mag., vol. 52, no. 4, pp. 74–81, Apr. 2014.
  3. 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.
  4. E. Björnson, E. Carvalho, J. H. Sørensen, E. G. Larsson, and P. Popovski, “A random access protocol for pilot allocation in crowded massive MIMO systems,” IEEE Trans. Wireless Commun., vol. 16, no. 4, pp. 2220-2234, Apr. 2017.
  5. J. Choi, J. Ding, N. Le, and Z. Ding, “Grant-free random access in machine-type communication: Approaches and challenges,” IEEE Wireless Commun., vol. 29, no. 1, pp. 151-158, Feb. 2022.
  6. Z. Chen, F. Sohrabi, Y.-F. Liu, and W. Yu, “Covariance based joint activity and data detection for massive access with massive MIMO,” in Proc. IEEE Int. Conf. Commun. (ICC), Shanghai, China, May 2019.
  7. S. Haghighatshoar, P. Jung, and G. Caire, “Improved scaling law for activity detection in massive MIMO systems,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Vail, CO, USA, Jun. 2018.
  8. Z. Chen, F. Sohrabi, and W. Yu, “Sparse activity detection for massive connectivity,” IEEE Trans. Signal Process., vol. 66, no. 7, pp. 1890–1904, Apr. 2018.
  9. 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.
  10. X. Bian, Y. Mao, and J. Zhang, “Joint activity detection, channel estimation, and data decoding for grant-free massive random access,” IEEE Internet Things J., vol. 10, no. 16, pp. 14042-14057, Aug. 2023.
  11. X. Bian, Y. Mao, and J. Zhang, “Grant-free massive random access with retransmission: Receiver optimization and performance analysis,” IEEE Trans. Commun., vol. 72, no. 2, pp. 786-800, Feb. 2024.
  12. Y. Qiang, X. Shao and X. Chen, “A model-driven deep learning algorithm for joint activity detection and channel estimation,” IEEE Commun. Lett., vol. 24, no. 11, pp. 2508-2512, Nov. 2020.
  13. Y. Cui, S. Li and W. Zhang, “Jointly sparse signal recovery and support recovery via deep learning with applications in MIMO-based grant-free random access,” IEEE J. Sel. Areas Commun., vol. 39, no. 3, pp. 788-803, Mar. 2021.
  14. L. Liu, and Y. Liu, “An efficient algorithm for device detection and channel estimation in asynchronous IoT systems,” in Proc. IEEE Int. Conf. Acoustics, Speech Signal Process. (ICASSP), Toronto, ON, Canada, Jun. 2021.
  15. Z. Wang, Y. Liu, and L. Liu, “Covariance-based joint device activity and delay detection in asynchronous mMTC,” IEEE Signal Process. Lett., vol. 29, pp. 538-542, Jan. 2022.
  16. Y. Guo, Z. Liu, and Y. Sun, “Low-complexity joint activity detection and channel estimation with partially orthogonal pilot for asynchronous massive access,” IEEE Internet Things J., vol. 11, no. 1, pp. 1773-1783, Jan. 2024.
  17. M. Qiu, K. Cao, D. Cai, Z. Dong and Y. Cui, “Low-complexity joint estimation for asynchronous massive internet of things: An ADMM approach,” in Proc. Int. Conf. Intell. Techn. Embedded Syst. (ICITES), Chengdu, China, Sept. 2022.
  18. W. Zhu, M. Tao, X. Yuan, and Y. Guan, “Deep-learned approximate message passing for asynchronous massive connectivity,” IEEE Trans. Wireless Commun., vol. 20, no. 8, pp. 5434-5448, Mar. 2021.
  19. J. Ma and L. Ping, “Orthogonal AMP,” IEEE Access, vol. 5, pp. 2020–2033, 2017.
  20. R. Speicher, “Lecture notes on free probability theory,” arXiv: 1908.08125, 2019. https://arxiv.org/pdf/1908.08125.
  21. D. Voiculescu, “Addition of certain noncommuting random variables,” J. Funct. Anal., vol. 66, no. 3, pp. 323-346, May 1986.
  22. M. Opper, B. Cakmak, and O. Winther, “A theory of solving TAP equations for Ising models with general invariant random matrices,” J. Phys. A: Math. Theor., vol. 49, no. 11, p. 114002, Feb. 2016.
  23. Z. Fan, “Approximate message passing algorithms for rotationally invariant matrices,” Ann. Stats., vol. 50, no. 1, pp. 197-224, 2022.
  24. F. B. Georges, “Rectangular random matrices, related convolution,” Probab. Theory Relat. Fields, vol. 144, pp. 471–515, Apr. 2009.
  25. R. Venkataramanan, K. Kögler, and M. Mondelli, “Estimation in rotationally invariant generalized linear models via approximate message passing,” in Proc. Int. Conf. Mach. Learn. (ICML), Baltimore MD, USA, Jul. 2022.
  26. C. Villani. Optimal Transport: Old and New. Springer, 2009.
  27. O. Y. Feng, R. Venkataramanan, C. Rush, and R. J. Samworth, “A unifying tutorial on approximate message passing,” Fdn. Trends® Mach. Learn., vol. 15, no. 4, pp. 335–536, 2022.

Summary

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

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

Tweets