Design Low Complexity SCMA Codebook Using Arnold’s Cat Map

Authors

  • Sura S. Mohamed
  • Hikmat N. Abdullah

DOI:

https://doi.org/10.26636/jtit.2022.164422

Keywords:

chaotic interleaving, codebook design, dimension rotation, Euclidean distance, sparse code multiple access

Abstract

In 5G wireless communications, sparse code multiple access (SCMA) – a multi-dimensional codebook based on a specific category of the non-orthogonal multiple access (NOMA) technique - enables many users to share non-orthogonal resource components with a low level of detection complexity. The multi-dimensional SCMA (MD-SCMA) codebook design presented in this study is based on the constellation rotation and interleaving method. Initially, a subset of the lattice Z 2 is used to form the mother constellation’s initial dimension. The first dimension is then rotated to produce other dimensions. Additionally, interleaving is employed for even dimensions to enhance fading channel performance. Arnold’s chaotic cat map is proposed as the interleaving method to reduce computational complexity. Performance of the SCMA codebook based on interleaving is evaluated by comparing it with selected codebooks for SCMA multiplexing. The metrics used for performance evaluation purposes include bit error rate (BER), peak to average power ratio (PAPR), and minimum Euclidean distance (MED), as well as complexity. The results demonstrate that the suggested codebook with chaotic interleaving offers performance that is equivalent to that of the conventional codebook based on interleaving. It is characterized by lower MED and higher BER compared to computer-generated and 16-star QAM codebook design approaches, but its complexity is lower than that of the conventional codebook based on interleaving.

Downloads

Download data is not yet available.

Downloads

Published

2022-12-30

Issue

Section

ARTICLES FROM THIS ISSUE

How to Cite

[1]
S. S. Mohamed and H. N. Abdullah, “Design Low Complexity SCMA Codebook Using Arnold’s Cat Map”, JTIT, vol. 90, no. 4, pp. 13–20, Dec. 2022, doi: 10.26636/jtit.2022.164422.