Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
166 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 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

Asynchronous MIMO-OFDM Massive Unsourced Random Access with Codeword Collisions (2405.11883v2)

Published 20 May 2024 in cs.IT, eess.SP, and math.IT

Abstract: This paper investigates asynchronous multiple-input multiple-output (MIMO) massive unsourced random access (URA) in an orthogonal frequency division multiplexing (OFDM) system over frequency-selective fading channels, with the presence of both timing and carrier frequency offsets (TO and CFO) and non-negligible codeword collisions. The proposed coding framework segregates the data into two components, namely, preamble and coding parts, with the former being tree-coded and the latter LDPC-coded. By leveraging the dual sparsity of the equivalent channel across both codeword and delay domains (CD and DD), we develop a message-passing-based sparse Bayesian learning algorithm, combined with belief propagation and mean field, to iteratively estimate DD channel responses, TO, and delay profiles. Furthermore, by jointly leveraging the observations among multiple slots, we establish a novel graph-based algorithm to iteratively separate the superimposed channels and compensate for the phase rotations. Additionally, the proposed algorithm is applied to the flat fading scenario to estimate both TO and CFO, where the channel and offset estimation is enhanced by leveraging the geometric characteristics of the signal constellation. Extensive simulations reveal that the proposed algorithm achieves superior performance and substantial complexity reduction in both channel and offset estimation compared to the codebook enlarging-based counterparts, and enhanced data recovery performances compared to state-of-the-art URA schemes.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (30)
  1. T. Li, Y. Wu, W. Zhang, X. -G. Xia, and C. Xiao, “A graph-based collision resolution scheme for asynchronous unsourced random access,” in Proc. IEEE Global Commun. Conf. (GLOBECOM), Kuala Lumpur, Malaysia, Dec. 2023, pp. 4014-4019.
  2. Y. Wu, X. Gao, S. Zhou, W. Yang, Y. Polyanskiy, and G. Caire, “Massive access for future wireless communication systems,” IEEE Wireless Commun., vol. 27, no. 4, pp. 148-156, Aug. 2020.
  3. J. Gao, Y. Wu, S. Shao, W. Yang, and H. V. Poor, “Energy efficiency of massive random access in MIMO quasi-static Rayleigh fading channels with finite blocklength,” IEEE Trans. Inf. Theory, vol. 69, no. 3, pp. 1618-1657, Mar. 2023.
  4. Y. Polyanskiy, “A perspective on massive random-access,” in Proc. IEEE Int. Symp. Inform. Theory (ISIT), Aachen, Germany, Jun. 2017, pp. 2523–2527.
  5. J. Che, Z. Zhang, Z. Yang, X. Chen, and C. Zhong, “Massive unsourced random access for NGMA: Architectures, opportunities, and challenges,” IEEE Network, vol. 37, no. 1, pp. 28-35, Jan. 2023.
  6. A. Fengler, P. Jung, and G. Caire, “SPARCs for unsourced random access,” IEEE Trans. Inf. Theory, vol. 67, no. 10, pp. 6894-6915, Oct. 2021.
  7. 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. Inf. Theory, vol. 67, no. 5, pp. 2925-2951, May 2021.
  8. V. K. Amalladinne, J. -F. Chamberland, and K. R. Narayanan, “A coded compressed sensing scheme for unsourced multiple access,” IEEE Trans. Inf. Theory, vol. 66, no. 10, pp. 6509-6533, Oct. 2020.
  9. 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, Mar. 2021.
  10. L. Liu and W. Yu, “Massive connectivity with massive MIMO–Part I: Device activity detection and channel estimation,” IEEE Trans. Signal Process., vol. 66, no. 11, pp. 2933–2946, Jun. 2018.
  11. 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, Jan. 2020.
  12. J. -C. Jiang and H. -M. Wang, “A fully Bayesian approach for massive MIMO unsourced random access,” IEEE Trans. Commun., vol. 71, no. 8, pp. 4620-4635, Aug. 2023.
  13. Y. Zhang, Q. Guo, Z. Wang, J. Xi, and N. Wu, “Block sparse Bayesian learning based joint user activity detection and channel estimation for grant-free NOMA systems,” IEEE Trans. Veh. Technol., vol. 67, no. 10, pp. 9631-9640, Oct. 2018.
  14. A. Vem, K. R. Narayanan, J. Chamberland, and J. Cheng, “A user-independent successive interference cancellation based coding scheme for the unsourced random access Gaussian channel,” IEEE Trans. Commun., vol. 67, no. 12, pp. 8258-8272, Dec. 2019.
  15. 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.
  16. M. J. Ahmadi, M. Kazemi, and T. M. Duman, “Unsourced random access using multiple stages of orthogonal pilots: MIMO and single-antenna structures,” IEEE Trans. Wireless Commun., vol. 23, no. 2, pp. 1343-1355, Feb. 2024.
  17. S. S. Kowshik, K. Andreev, A. Frolov, and Y. Polyanskiy, “Short-packet low-power coded access for massive MAC,” in Proc. Asilomar Conf. Signals, Syst., Comput., Pacific Grove, CA, USA, Nov. 2019, pp. 827–832.
  18. V. K. Amalladinne, K. R. Narayanan, J.-F. Chamberland, and D. Guo, “Asynchronous neighbor discovery using coupled compressive sensing,” in Proc. IEEE Int. Conf. Acoust., Speech Signal Process. (ICASSP), Brighton, UK, May, 2019, pp. 4569–4573.
  19. A. Decurninge, P. Ferrand, and M. Guillaud, “Massive random access with tensor-based modulation in the presence of timing offsets,” in Proc. IEEE Global Commun. Conf. (GLOBECOM), Rio de Janeiro, Brazil, Dec. 2022, pp. 1061-1066.
  20. S. Salari and F. Chan, “Joint CFO and channel estimation in OFDM systems using sparse Bayesian learning,” IEEE Commun. Lett., vol. 25, no. 1, pp. 166-170, Jan. 2021.
  21. G. Sun, Y. Li, X. Yi, W. Wang, X. Gao, L. Wang, F. Wei, and Y. Chen, “Massive grant-free OFDMA with timing and frequency offsets,” IEEE Trans. Wireless Commun., vol. 21, no. 5, pp. 3365– 3380, May 2022.
  22. Z. Zhang, Y. Chi, Q. Guo, Y. Li, G. Song, and C. Huang, “Asynchronous grant-free random access: Receiver design with partially uni-directional message passing and interference suppression analysis,” IEEE Internet Things J., early access, 2023.
  23. 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, 1 Jan.1, 2024.
  24. W. Jiang, M. Yue, X. Yuan, and Y. Zuo, “Massive connectivity over MIMO-OFDM: Joint activity detection and channel estimation with frequency selectivity compensation,” IEEE Trans. Wireless Commun., vol. 21, no. 9, pp. 6920-6934, Sep. 2022.
  25. M. Ozates and T. M. Duman, “Unsourced random access over frequency-selective channels,” IEEE Commun. Lett., vol. 27, no. 4, pp. 1230-1234, Apr. 2023.
  26. H. C. Nguyen, E. de Carvalho, and R. Prasad, “Multi-user interference cancellation schemes for carrier frequency offset compensation in uplink OFDMA,” IEEE Trans. Wireless Commun., vol. 13, no. 3, pp. 1164-1171, Mar. 2014.
  27. L. Wu, X. -D. Zhang, and P. -S. Li, “A low-complexity blind carrier frequency offset estimator for MIMO-OFDM systems,” IEEE Signal Process. Lett., vol. 15, pp. 769-772, Nov. 2008.
  28. L. Ping, L. Liu, K. Wu, and W. K. Leung, “Interleave division multiple access,” IEEE Trans. Wireless Commun., vol. 5, no. 4, pp. 938–947, Apr. 2006.
  29. M. Luo, Q. Guo, M. Jin, Y. C. Eldar, D. Huang, and X. Meng, “Unitary approximate message passing for sparse Bayesian learning,” IEEE Trans. Signal Process., vol. 69, pp. 6023-6039, Sep. 2021.
  30. N. Harel and T. Routtenberg, “Bayesian post-model-selection estimation,” IEEE Signal Process. Lett., vol. 28, pp. 175-179, Jan. 2021.

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