TY - GEN
T1 - A flexible iterative log-mpa detector for uplink scma systems
AU - Shi, Xiaojing
AU - Ren, Pinyi
AU - Xu, Dongyang
N1 - Publisher Copyright:
© ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2019.
PY - 2019
Y1 - 2019
N2 - . The development of the communications industry is changing with each passing day. At present, 5G research work is in full swing. In the SCMA (Sparse Code Multiple Access) system, this paper proposes a flexible iterative logarithmic domain message passing algorithm(FI-Log-MPA) aiming at the traditional logarithmic domain message passing algorithm to magnify the number of iterations in the codeword decision process, which results in a waste of running resources. The algorithm determines whether to perform subsequent iterations by adding a link to determine the convergence rate of the codeword during the update process of the variable node. If the codeword convergence rate is lower than a preset threshold, the iteration is stopped, otherwise the iteration is continued. Based on the principle of the optimization algorithm, we built a SCMA and NOMA (Non-Orthogonal Multiple Access) simulation platform to verify that the algorithm can effectively reduce the number of iterations. Although there is a loss in bit error rate and throughput performance, it remains at the same order of magnitude. In general, the complexity is reduced, and the decoding performance is optimized.
AB - . The development of the communications industry is changing with each passing day. At present, 5G research work is in full swing. In the SCMA (Sparse Code Multiple Access) system, this paper proposes a flexible iterative logarithmic domain message passing algorithm(FI-Log-MPA) aiming at the traditional logarithmic domain message passing algorithm to magnify the number of iterations in the codeword decision process, which results in a waste of running resources. The algorithm determines whether to perform subsequent iterations by adding a link to determine the convergence rate of the codeword during the update process of the variable node. If the codeword convergence rate is lower than a preset threshold, the iteration is stopped, otherwise the iteration is continued. Based on the principle of the optimization algorithm, we built a SCMA and NOMA (Non-Orthogonal Multiple Access) simulation platform to verify that the algorithm can effectively reduce the number of iterations. Although there is a loss in bit error rate and throughput performance, it remains at the same order of magnitude. In general, the complexity is reduced, and the decoding performance is optimized.
KW - 5G
KW - Message passing algorithm
KW - Power domain non-orthogonal multiple access
KW - Sparse code division multiple access
UR - https://www.scopus.com/pages/publications/85070918318
U2 - 10.1007/978-3-030-14657-3_29
DO - 10.1007/978-3-030-14657-3_29
M3 - 会议稿件
AN - SCOPUS:85070918318
SN - 9783030146566
T3 - Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST
SP - 292
EP - 302
BT - IoT as a Service- 4th EAI International Conference, IoTaaS 2018, Proceedings
A2 - Li, Bo
A2 - Yang, Mao
A2 - Yan, Zhongjiang
A2 - Yuan, Hui
PB - Springer Verlag
T2 - 4th International Conference on IoT as a Service, IoTaaS 2018
Y2 - 17 November 2018 through 18 November 2018
ER -