Rights statement: ©2016 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Accepted author manuscript, 22.3 MB, PDF document
Available under license: CC BY-NC: Creative Commons Attribution-NonCommercial 4.0 International License
Final published version
Research output: Contribution to Journal/Magazine › Letter › peer-review
Research output: Contribution to Journal/Magazine › Letter › peer-review
}
TY - JOUR
T1 - Impact of factor graph on average sum rate for uplink sparse code multiple access systems
AU - Yang, Zheng
AU - Cui, Jingjing
AU - Lei, Xianfu
AU - Ding, Zhiguo
AU - Fan, Pingzhi
AU - Chen, Dageng
N1 - ©2016 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
PY - 2016/10/4
Y1 - 2016/10/4
N2 - In this paper, we first study the average sum rate of sparse code multiple access (SCMA)systems, where a general scenario is considered under the assumption that the distances between the mobile users and the base station are not necessarily identical. Closed-form analytical results are derived for the average sum rate based on which an optimal factor graph matrix is designed for maximizing the capacity of the SCMA systems. Moreover, we propose a low-complexity iterative algorithm to facilitate the design of the optimal graph matrix. Finally, Monte Carlo simulations are provided to corroborate the accuracy of the theoretical results and the efficiency of the proposed iterative algorithm.
AB - In this paper, we first study the average sum rate of sparse code multiple access (SCMA)systems, where a general scenario is considered under the assumption that the distances between the mobile users and the base station are not necessarily identical. Closed-form analytical results are derived for the average sum rate based on which an optimal factor graph matrix is designed for maximizing the capacity of the SCMA systems. Moreover, we propose a low-complexity iterative algorithm to facilitate the design of the optimal graph matrix. Finally, Monte Carlo simulations are provided to corroborate the accuracy of the theoretical results and the efficiency of the proposed iterative algorithm.
KW - Multiple access
KW - average sum rate
KW - optimal factor graph.
U2 - 10.1109/ACCESS.2016.2614330
DO - 10.1109/ACCESS.2016.2614330
M3 - Letter
VL - 4
SP - 6585
EP - 6590
JO - IEEE Access
JF - IEEE Access
SN - 2169-3536
ER -