17,587 research outputs found
Low Complexity Multi-User MIMO Detection for Uplink SCMA System Using Expectation Propagation Algorithm
Sparse code multiple access (SCMA), which combines the advantages of low density signature (LDS) and code-division multiple access (CDMA), is regarded as one of the promising modulation technique candidate for the next generation of wireless systems. Conventionally, the message passing algorithm (MPA) is used for data detector at the receiver side. However, the MPA-SCMA cannot be implemented in the next generation wireless systems, because of its unacceptable complexity cost. Specifically, the complexity of MPA-SCMA grows exponentially with the number of antennas. Considering the use of high dimensional systems in the next generation of wireless systems, such as massive multi-user MIMO systems, the conventional MPA-SCMA is prohibitive. In this paper, we propose a low complexity detector algorithm named the expectation propagation algorithm (EPA) for SCMA. Mainly, the EPA-SCMA solves the complexity problem of MPA-SCMA and enables the implementation of SCMA in massive MU-MIMO systems. For instance, the EPA-SCMA also enables the implemantation of SCMA in the next generation wireless systems. We further show that the EPA can achieve the optimal detection performance as the numbers of transmit and receive antennas grow. We also demonstrate that a rotation design in SCMA codebook is unnecessary, which is quite rather different from the general assumptio
A low-complexity energy-minimization-based SCMA detector and its convergence analysis
© 2018 IEEE. Sparse code multiple access (SCMA) has emerged as a promising non-orthogonal multiple access technique for the next-generation wireless communication systems. Since the signal of multiple users is mapped to the same resources in SCMA, its detection imposes a higher complexity than that of the orthogonal schemes, where each resource slot is dedicated to a single user. In this paper, we propose a low-complexity receiver for SCMA systems based on the radical variational free energy framework. By exploiting the pairwise structure of the likelihood function, the Bethe approximation is utilized for estimating the data symbols. The complexity of the proposed algorithm only increases linearly with the number of users, which is much lower than that of the maximum a posteriori detector associated with exponentially increased complexity. Furthermore, the convergence of the proposed algorithm is analyzed, and its convergence conditions are derived. Simulation results demonstrate that the proposed receiver is capable of approaching the error probability performance of the conventional message-passing-based receiver
Sub-graph based joint sparse graph for sparse code multiple access systems
Sparse code multiple access (SCMA) is a promising air interface candidate technique for next generation mobile networks, especially for massive machine type communications (mMTC). In this paper, we design a LDPC coded SCMA detector by combining the sparse graphs of LDPC and SCMA into one joint sparse graph (JSG). In our proposed scheme, SCMA sparse graph (SSG) defined by small size indicator matrix is utilized to construct the JSG, which is termed as sub-graph based joint sparse graph of SCMA (SG-JSG-SCMA). In this paper, we first study the binary-LDPC (B-LDPC) coded SGJSG- SCMA system. To combine the SCMA variable node (SVN) and LDPC variable node (LVN) into one joint variable node (JVN), a non-binary LDPC (NB-LDPC) coded SG-JSG-SCMA is also proposed. Furthermore, to reduce the complexity of NBLDPC coded SG-JSG-SCMA, a joint trellis representation (JTR) is introduced to represent the search space of NB-LDPC coded SG-JSG-SCMA. Based on JTR, a low complexity joint trellis based detection and decoding (JTDD) algorithm is proposed to reduce the computational complexity of NB-LDPC coded SGJSG- SCMA system. According to the simulation results, SG-JSGSCMA brings significant performance improvement compare to the conventional receiver using the disjoint approach, and it can also outperform a Turbo-structured receiver with comparable complexity. Moreover, the joint approach also has advantages in terms of processing latency compare to the Turbo approaches
Design and optimization of joint iterative detection and decoding receiver for uplink polar coded SCMA system
SCMA and polar coding are possible candidates for 5G systems. In this paper, we firstly propose the joint iterative detection and decoding (JIDD) receiver for the uplink polar coded sparse code multiple access (PC-SCMA) system. Then, the EXIT chart is used to investigate the performance of the JIDD receiver. Additionally, we optimize the system design and polar code construction based on the EXIT chart analysis. The proposed receiver integrates the factor graph of SCMA detector and polar soft-output decoder into a joint factor graph, which enables the exchange of messages between SCMA detector and polar decoder iteratively. Simulation results demonstrate that the JIDD receiver has better BER performance and lower complexity than the separate scheme. Specifically, when polar code length N=256 and code rate R=1/2 , JIDD outperforms the separate scheme 4.8 and 6 dB over AWGN channel and Rayleigh fading channel, respectively. It also shows that, under 150% system loading, the JIDD receiver only has 0.3 dB performance loss compared to the single user uplink PC-SCMA over AWGN channel and 0.6 dB performance loss over Rayleigh fading channel
A Universal Receiver for Uplink NOMA Systems
Given its capability in efficient radio resource sharing, non-orthogonal
multiple access (NOMA) has been identified as a promising technology in 5G to
improve the system capacity, user connectivity, and scheduling latency. A dozen
of uplink NOMA schemes have been proposed recently and this paper considers the
design of a universal receiver suitable for all potential designs of NOMA
schemes. Firstly, a general turbo-like iterative receiver structure is
introduced, under which, a universal expectation propagation algorithm (EPA)
detector with hybrid parallel interference cancellation (PIC) is proposed (EPA
in short). Link-level simulations show that the proposed EPA receiver can
achieve superior block error rate (BLER) performance with implementation
friendly complexity and fast convergence, and is always better than the
traditional codeword level MMSE-PIC receiver for various kinds of NOMA schemes.Comment: This paper has been accepted by IEEE/CIC International Conference on
Communications in China (ICCC 2018). 5 pages, 4 figure
Turbo-like Iterative Multi-user Receiver Design for 5G Non-orthogonal Multiple Access
Non-orthogonal multiple access (NoMA) as an efficient way of radio resource
sharing has been identified as a promising technology in 5G to help improving
system capacity, user connectivity, and service latency in 5G communications.
This paper provides a brief overview of the progress of NoMA transceiver study
in 3GPP, with special focus on the design of turbo-like iterative multi-user
(MU) receivers. There are various types of MU receivers depending on the
combinations of MU detectors and interference cancellation (IC) schemes.
Link-level simulations show that expectation propagation algorithm (EPA) with
hybrid parallel interference cancellation (PIC) is a promising MU receiver,
which can achieve fast convergence and similar performance as message passing
algorithm (MPA) with much lower complexity.Comment: Accepted by IEEE 88th Vehicular Technology Conference (IEEE VTC-2018
Fall), 5 pages, 6 figure
- …