A Threshold-Based Max-log-MPA Low Complexity Multiuser Detection Algorithm

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.

Download Full-text

A Novel Iterative Discrete Estimation Algorithm for Low-Complexity Signal Detection in Uplink Massive MIMO Systems

Electronics ◽

10.3390/electronics8090980 ◽

2019 ◽

Vol 8 (9) ◽

pp. 980 ◽

Cited By ~ 1

Author(s):

Hui Feng ◽

Xiaoqing Zhao ◽

Zhengquan Li ◽

Song Xing

Keyword(s):

Computational Complexity ◽

Massive Mimo ◽

Mimo Systems ◽

Estimation Algorithm ◽

Low Complexity ◽

Detection Algorithm ◽

Base Station ◽

Damping Factor ◽

Mimo Detection ◽

Discrete Estimation

In this paper, a novel iterative discrete estimation (IDE) algorithm, which is called the modified IDE (MIDE), is proposed to reduce the computational complexity in MIMO detection in uplink massive MIMO systems. MIDE is a revision of the alternating direction method of multipliers (ADMM)-based algorithm, in which a self-updating method is designed with the damping factor estimated and updated at each iteration based on the Euclidean distance between the iterative solutions of the IDE-based algorithm in order to accelerate the algorithm’s convergence. Compared to the existing ADMM-based detection algorithm, the overall computational complexity of the proposed MIDE algorithm is reduced from O N t 3 + O N r N t 2 to O N t 2 + O N r N t in terms of the number of complex-valued multiplications, where Ntand Nr are the number of users and the number of receiving antennas at the base station (BS), respectively. Simulation results show that the proposed MIDE algorithm performs better in terms of the bit error rate (BER) than some recently-proposed approximation algorithms in MIMO detection of uplink massive MIMO systems.

Download Full-text

Demonstration of Pattern Division Multiple Access with Message Passing Algorithm in MMW-RoF Systems

Optical Fiber Communication Conference (OFC) 2020 ◽

10.1364/ofc.2020.m2f.3 ◽

2020 ◽

Cited By ~ 1

Author(s):

Shuyi Shen ◽

You-Wei Chen ◽

Qi Zhou ◽

Gee-Kung Chang

Keyword(s):

Message Passing ◽

Multiple Access ◽

Message Passing Algorithm

Download Full-text

Low-Complexity Multiuser Detection and Reduced-Rank Wiener Filters for Ultra-Wideband Multiple Access

Proceedings. (ICASSP '05). IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005. ◽

10.1109/icassp.2005.1415786 ◽

2006 ◽

Cited By ~ 2

Author(s):

Zhi Tian ◽

Hongya Ge ◽

L.L. Scharf

Keyword(s):

Multiuser Detection ◽

Multiple Access ◽

Low Complexity ◽

Ultra Wideband ◽

Reduced Rank ◽

Wiener Filters

Download Full-text

Analysis of Multiuser Detectors and Performance improvement in DS-CDMA system using Multistage Multiuser Detection Techniques

10.21203/rs.3.rs-380284/v1 ◽

2021 ◽

Author(s):

Ravindrababu Jaladanki ◽

Krishnarao Ede ◽

Raja Rao Yasoda

Keyword(s):

Computational Complexity ◽

Multiuser Detection ◽

System Performance ◽

Interference Cancellation ◽

Multiple Access ◽

Signal Amplitude ◽

Cdma System ◽

Parallel Interference Cancellation ◽

Detection Techniques ◽

Code Division Multiple

Abstract Among the various interferences, the Multiple Access Interference (MAI) is a significant issue in Direct Sequence Code Division Multiple Access (DS-CDMA) system due to its users. When the number of users is increasing the MAI is likewise increments, subsequently the system performance progressively diminishes particularly in fading environment. In this paper, the system performance is improved by the proposed multistage multiuser detection technique called Multistage Multiuser Differencing Partial Parallel Interference Cancellation (DPPIC). This is the combination of Partial Parallel Interference Cancellation (PPIC) and Differencing Parallel Interference Cancellation (DPIC). Multistage Multiuser Parallel Interference Cancellation (PIC) and Multistage Multiuser PPIC techniques that exist gave improved system performance meaning as the number of stages increases the MAI decreases but at the cost of increased computational complexity. The computational complexity was reduced by utilizing Multistage Difference PIC (DPIC) technique but with no improvement in the performance. To improve the system performance as well as reduce the computational complexity Multistage Multiuser Partial Differencing Parallel Interference Cancellation (PDPIC) method can be used. The simulation results show that the proposed DPPIC technique performs better than PIC, PPIC and PDPIC in terms of Bit Error Rate (BER) versus normalized signal amplitude ( i.e., E b / N 0 ), but computational complexity slightly more than PDPIC in fading environment.

Download Full-text

A Low-Complexity and High-Decoding Performance Scheme for the MIMO-SCMA System

Wireless Communications and Mobile Computing ◽

10.1155/2021/8858292 ◽

2021 ◽

Vol 2021 ◽

pp. 1-12

Author(s):

Wenping Ge ◽

Haofeng Zhang ◽

Shiqing Qian ◽

Lili Ma ◽

Gecheng Zhang

Keyword(s):

Error Rate ◽

Message Passing ◽

Multiple Input Multiple Output ◽

High Capacity ◽

Block Code ◽

Low Complexity ◽

Spectrum Efficiency ◽

Performance Loss ◽

Message Passing Algorithm ◽

Input Multiple Output

Sparse code multiple access (SCMA) has been proposed to obtain high capacity and support massive connections. When combined with the multiple-input multiple-output (MIMO) techniques, the spectrum efficiency of the SCMA system can be further improved. However, the detectors of the MIMO-SCMA system have high computational complexity. For the maximum likelihood (ML) detection, though it is optimal decoding algorithm for the MIMO-SCMA system, the detection complexity would grow exponentially with the number of both the antennas and users increase. In this paper, we consider a space-time block code (STBC) based MIMO-SCMA system where SCMA is used for multiuser access. Besides, we propose a low-complexity utilizing joint message passing algorithm (JMPA) detection, which narrowing the range of superimposed constellation points, called joint message passing algorithm based on sphere decoding (S-JMPA). But for the S-JMPA detector, the augment of the amount of access users and antennas leads to the degradation of decoding performance, the STBC is constructed to compensate the performance loss of the S-JMPA detector and ensure good bit error rate (BER) performance. The simulation results show that the proposed method achieves a close error rate performance to ML, JMPA, and a fast convergence rate. Moreover, compared to the ML detector, it also significantly reduces the detection complexity of the algorithms.

Download Full-text

Overview of Sparse Graph for Multiple Access in Future Mobile Networks

Frequenz ◽

10.1515/freq-2016-0019 ◽

2017 ◽

Vol 71 (11-12) ◽

Author(s):

Jing Lei ◽

Baoguo Li ◽

Erbao Li ◽

Zhenghui Gong

Keyword(s):

Wireless Communications ◽

Mobile Networks ◽

Message Passing ◽

Multiple Access ◽

Low Density ◽

Sparse Graph ◽

Extrinsic Information ◽

Promising Technique ◽

Satisfactory Performance ◽

Message Passing Algorithm

AbstractMultiple access via sparse graph, such as low density signature (LDS) and sparse code multiple access (SCMA), is a promising technique for future wireless communications. This survey presents an overview of the developments in this burgeoning field, including transmitter structures, extrinsic information transform (EXIT) chart analysis and comparisons with existing multiple access techniques. Such technique enables multiple access under overloaded conditions to achieve a satisfactory performance. Message passing algorithm is utilized for multi-user detection in the receiver, and structures of the sparse graph are illustrated in detail. Outlooks and challenges of this technique are also presented.

Download Full-text

Low Complexity Message Passing Algorithm for SCMA System

IEEE Communications Letters ◽

10.1109/lcomm.2016.2609382 ◽

2016 ◽

Vol 20 (12) ◽

pp. 2466-2469 ◽

Cited By ~ 39

Author(s):

Lin Yang ◽

Yunyun Liu ◽

Yunming Siu

Keyword(s):

Message Passing ◽

Low Complexity ◽

Message Passing Algorithm

Download Full-text

Nonuniform Code Multiple Access

Wireless Communications and Mobile Computing ◽

10.1155/2018/7603797 ◽

2018 ◽

Vol 2018 ◽

pp. 1-11

Author(s):

Cheng Yan ◽

Ningbo Zhang ◽

Guixia Kang

Keyword(s):

Message Passing ◽

Multiple Access ◽

Sparse Code ◽

Rate Performance ◽

Initial Information ◽

Codebook Design ◽

Constellation Design ◽

Message Passing Algorithm ◽

Sum Of Distances

For sparse code multiple access advanced (SCMAA), the quality of initial information on each resource node and the convergence reliability of the detected user in each decision process were unsatisfactory at the message passing algorithm (MPA) receiver. Driven by these problems, this paper proposes a nonuniform code multiple access (NCMA) scheme. In the codebook design of NCMA, different transmitted layers are generated from different complex multidimension constellations, respectively, and a novel basic complex multidimension constellation design is proposed to increase the minimum intrapartition distance. Then a novel criterion of permutation set is proposed to maximize the sum of distances between interfering dimensions of transmitted codewords multiplexed on any resource node, where the number of nonzero elements of transmitted codewords is more than 1. On the other side, an advanced MPA receiver is proposed to improve the reliability of detection on each transmitted layer of NCMA. Simulation results show that the block error rate performance of NCMA outperforms SCMAA and sparse code multiple access (SCMA) under the same spectral efficiency.

Download Full-text