Papers
Topics
Authors
Recent
Search
2000 character limit reached

A Novel HARQ-CC Assisted SCMA Scheme

Published 15 Apr 2024 in cs.IT and math.IT | (2404.09814v1)

Abstract: This letter proposes a novel hybrid automatic repeat request with chase combining assisted sparse code multiple access (HARQ-CC-SCMA) scheme. Depending on whether the same superimposed packet are retransmitted, synchronous and asynchronous modes are considered for retransmissions. Moreover, factor graph aggregation (FGA) and Log-likelihood ratio combination (LLRC) are proposed for multi-user detection. Regarding FGA, a large-scale factor graph is constructed by combining all the received superimposed signals and message passing algorithm (MAP) is applied to calculate log-likelihood ratio (LLR). Whereas, owing to the same unsuccessful messages required to be retransmitted, LLRC adds up LLRs of erroneously received packets in previous HARQ rounds together with currently received packets for channel decoding and saves the LLRs for failed users. Finally, Monte Carlo simulations are preformed to show that FGA surpasses LLRC and HARQ with incremental redundancy (HARQ-IR) in synchronous mode. However, LLRC performs better than FGA at low signal-to-noise ratio (SNR) in asynchronous mode. This is because failed messages after the maximum allowable HARQ rounds in this mode can yield significant error propagation in low SNR regime.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (11)
  1. M. Chafii, L. Bariah, S. Muhaidat, and M. Debbah, “Twelve scientific challenges for 6G: Rethinking the foundations of communications theory,” IEEE Commun. Surveys & Tuts., vol. 25, no. 2, pp. 868–904, Feb. 2023.
  2. L. Yu, Z. Liu, M. Wen, D. Cai, S. Dang, Y. Wang, and P. Xiao, “Sparse code multiple access for 6G wireless communication networks: Recent advances and future directions,” IEEE Commun. Stand. Mag., vol. 5, no. 2, pp. 92–99, Jun. 2021.
  3. S. Chaturvedi, Z. Liu, V. A. Bohara, A. Srivastava, and P. Xiao, “A tutorial on decoding techniques of sparse code multiple access,” IEEE Access, vol. 10, pp. 58 503–58 524, Jun. 2022.
  4. Y. Long, Z. Chen, Z. Guo, and J. Fang, “A novel HARQ scheme for SCMA systems,” IEEE Wireless Commun. Lett., vol. 5, no. 5, pp. 452–455, Oct. 2016.
  5. J. Lian, S. Zhou, X. Zhang, and Y. Wang, “An improved HARQ scheme for SCMA under random access,” in Proc. IEEE Int. Conf. Comput. Commun. (ICCC), Chengdu, China, Dec. 2017, pp. 1163–1167.
  6. K. Lai, Z. Liu, J. Lei, G. Chen, P. Xiao, and L. Wen, “Sparse code multiple access with enhanced K-repetition scheme: Analysis and Design,” IEEE Trans. Wireless Commun., vol. 99, no. 99, pp. 1–1, Oct. 2023.
  7. M. Zhu, Q. He, R. Zhang, and B. Bai, “Rateless coding based incremental redundancy HARQ scheme for SCMA systems,” Mob. Netw. Appl., vol. 23, pp. 1028–1034, Aug. 2018.
  8. M. Guan, M. Zhu, and B. Bai, “Windowed joint detection and decoding with IR-HARQ for asynchronous SCMA systems,” Entropy, vol. 25, no. 6, pp. 1–13, 2023.
  9. H. Zhang, Z. Liao, Z. Shi, G. Yang, Q. Dou, and S. Ma, “Performance analysis of MIMO-HARQ assisted V2V communications with keyhole effect,” IEEE Trans. Commun., vol. 70, no. 5, pp. 3034–3046, May 2022.
  10. K. Deka, M. Priyadarsini, S. Sharma, and B. Beferull-Lozano, “Design of SCMA codebooks using differential evolution,” in Proc. IEEE Int. Conf. Commun. Workshops (ICC Workshops), Dublin, Ireland, Jun. 2020, pp. 1–7.
  11. C. Zhang, C. Yang, X. Pang, W. Song, W. Xu, S. Zhang, Z. Zhang, and X. You, “Efficient sparse code multiple access decoder based on deterministic message passing algorithm,” IEEE Trans. Veh. Technol., vol. 69, no. 4, pp. 3562–3574, Apr. 2020.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.