CG-SCMA Codebook Design Based on Maximized Euclidian Distance-Reference-Cited by-同舟云学术

CG-SCMA Codebook Design Based on Maximized Euclidian Distance

Published:2023-03-31 Issue:2023 Volume:1 Page:18-24
ISSN:1899-8852
Container-title:Journal of Telecommunications and Information Technology
language:
Short-container-title:JTIT

Author:

Mohamed Sura S.,Abdullah Hikmat N.^ORCID

Abstract

Sparse code multiple access (SCMA) is a multi-dimensional codebook based on a class of non-orthogonal multiple access (NOMA) technologies enabling the delivery of non-orthogonal resource elements to numerous users in 5G wireless communications without increasing complexity. This paper proposes a computer-generated sparse code multiple access (CG-SCMA) technique, where the minimum Euclidian distance (MED) of a star 16-point quadrature amplitude modulation is maximized by CG-SCMA, thus creating a complex SCMA codebook based on optimizing the difference between the first and other radiuses over rotated constellations. To specify the most suitable values for this constellation, it is divided into four sub-constellations using trellis coded modulation (TCM) in an effort to optimize MED. The new codebook has four sub-constellations with MED values of 3.85, 2.26, 2.26, and 3.85, respectively. Application of the message passing algorithm (MPA) ensures low complexity of the decoding process.

Publisher

National Institute of Telecommunications

Subject

Electrical and Electronic Engineering,Computer Networks and Communications

Link

https://www.il-pib.pl/czasopisma/JTIT/2023/1/18.pdf

Reference14 articles.

1. [1] M. Rebhi, K. Hassan, K. Raoof, and P. Charge, “Sparse code multiple access: Potentials and challenges”, IEEE Open Journal of the Communications Society, vol. 2, pp. 1205– 1238, 2021 (https://doi.org/10.1109/OJCOMS.2021.3081166).

2. [2] L. Zhang, “Sparse code multiple access for downlink multiple access of 5G wireless networks”, Computer Communications, vol. 158, pp. 17–23, 2020 (https://doi.org/ 10.1016/j.comcom.2020.04.022).

3. [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. 58503 –58524, 2022 (https://doi.org/10.1109/ACCESS.2022.3178127).

4. [4] A. Kosasih, O. Setyawati, and R. Rahmadwati, “Low complexity multiuser MIMO detection for uplink SCMA system using expectation propagation algorithm”, TELKOMNIKA, Telecommunication Comput. Electron. Control, vol. 16, no. 1, p. 182, 2018 (https://doi.org/10.12928/telkomnika.v16.i1.7365).

5. [5] S. Lou, C. Gong, Q. Gao, and Z. Xu, “SCMA with low complexity symmetric codebook design for visible light communication”, 2018 IEEE International Conference on Communications (ICC), USA, 2018, pp. 1– 6 (https://doi.org/ 10.1109/ICC.2018.8422652).