Abstract
Sparse Code Multiple Access (SCMA) technology is a new multiple access scheme based on non-orthogonal spread spectrum technology, which was proposed by Huawei in 2014. In the algorithm application of this technology, the original Message Passing Algorithm (MPA) has slow convergence speed and high algorithm complexity. The threshold-based MPA has a high Bit Error Ratio (BER) when the threshold is low. In the Maximum logarithm Message Passing Algorithm (Max-log-MPA), the approximation method is used, which will cause some messages to be lost and the detection performance to be poor. Therefore, in order to solve the above problems, a Threshold-Based Max-log-MPA (T-Max-log-MPA) low complexity multiuser detection algorithm is proposed in this paper. The Maximum logarithm (Max-log) algorithm is combined with threshold setting, and the stability of user nodes is considered as a necessary condition for decision in the algorithm. Before message updating, the user information nodes are judged whether the necessary conditions for the stability of the user node have been met, and then the threshold is determined. Only users who meet the threshold condition and pass the necessary condition of user node stability can be decoded in advance. In the whole process, the logarithm domain MPA algorithm is used to convert an exp operation and a multiplication operation into a maximum value and addition operation. The simulation results show that the proposed algorithm can effectively reduce the computational complexity while ensuring the BER, and with the increase of signal-to-noise ratio, the effect of the Computational Complexity Reduction Ratio (CCRR) is more obvious.
Highlights
In recent years, with the globalization, informatization and the coming of network era, the number of mobile communication users has increased explosively [1], and the demand for network in different places is increasing rapidly
In order to verify the good system performance of the threshold-based low-complexity multiuser detection algorithm of Maximum logarithm (Max-log)-Message Passing Algorithm (MPA) proposed in this paper, simulation experiments are carried out to compare it with the original MPA algorithm, the threshold-based MPA algorithm, and the
In order to verify the good system performance of the threshold-based low-complexity multiuser detection algorithm of Max-log-MPA proposed in this paper, simulation experiments are carried out to compare it with the original MPA algorithm, the threshold-based MPA algorithm, and the Max-log-MPA algorithm
Summary
With the globalization, informatization and the coming of network era, the number of mobile communication users has increased explosively [1], and the demand for network in different places is increasing rapidly. When the codeword reliability reaches the threshold condition, the user will be decoded in advance, and no message update will be carried out in the subsequent process, so as to reduce the complexity of multiuser detection It will cause the loss of the posteriori soft information of other users who occupy the same resource block with the user in the subsequent iterative process, and lead to the likelihood operation. The stability of the user information nodes and whether it has passed the threshold value are studied first, and the exp operation and multiplication operation are transformed into the maximum value and addition operation by the Max-log-MPA algorithm in the logarithmic domain, which improves the detection performance, it can effectively change the comparison of the complexity reduction rate of the detection algorithm
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.