.png){kind=icon}
.png){kind=icon}
Return
Dynamic SCMA Codebook Assignment Methods: A Comparative Study
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2017.2764469.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this letter, we consider a sparse code multiple access (SCMA) system, in which we assign the subcarriers to users based on the available channel gains between the users and base station over all subcarriers, referred to as channel state information. The effect of this process, referred to here as codebook assignment, has not been considered before on link-level performance of an SCMA. We propose three codebook assignment methods and compare their performance with each other as well as with the conventional case, where no assignment is performed. It is shown that significant performance improvement is achieved when any of the proposed methods is deployed. Through one of the proposed methods, we show that a trade-off between user performance fairness and performance is achievable.
Keywords:
Sparse code multiple access (SCMA)
non-orthogonal multiple access (NOMA)
codebook assignment
resource allocation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W