Sparse Code Multiple Access With Time Spreading and Repetitive Transmissions

Different from traditional communication systems, information-centric Internet of things (IC-IoT) as a novel smart paradigm needs to guarantee end-to-end connectivity for rapidly growing smart devices. How to meet the demands of massive connection has become a key problem for IC-IoT. Sparse code multiple access (SCMA) as a code-domain non-orthogonal multiple access (NOMA) technique has been intensively investigated. With SCMA, each user employs different sub-carrier frequencies for transmission, and different users can share the same sub-carrier frequency via superposition coding. The spectrum efficiency is thus improved. However, designing large-scale codebook sets is still an open problem for SCMA. In this paper, a new lattice-based codebook design method is proposed via mother constellation optimization. First, the optimization problem of the mother constellation is formulated. Through analysis, the problem can be converted into two sub-problems. Accordingly, we first use the lattice theory to find a constellation containing infinite points with large coding gain. After that, we search for a boundary that contains a set of points via spherical packing. Such an approach enables us to obtain a real constellation satisfying a power saving criterion. Secondly, the mother constellation with large power variance is obtained from the real multi-dimensional constellation. Finally, lattice-based codebooks are generated by combining the mother constellation and the mapping matrices with constellation rotation. Simulations demonstrate that the designed codebooks have improved bit error rate (BER) performance with large codebook size, especially at high signal to noise ratio (SNR).

Sparse code multiple access (SCMA) is a promising non-orthogonal multiple access (NOMA) scheme for massive machine-type communications for 5G-and-beyond communication systems. Innovative use of orthogonal frequency division multiplexing with index modulation (OFDM-IM) takes advantage of using tone indices in data transmission. In this study, we propose a novel multiplexing and multiple access scheme, namely SCMA based on OFDM-IM (SCMA-IM). SCMA-IM method can be implemented in uplink NOMA systems in an efficient way with similar computational complexity as SCMA. In this method constellation differences and diversity are obtained via SCMA codebooks (CBs) and the employment of CBs is transferred to index modulation (IM). Performance improvement is achieved via CBs so that the number of data bits carried by indices increases more than one bit with different constellations, and also with the number of CBs assigned. In order to determine the indices used in IM, the receiver structure is simplified by the message passing algorithm and log-likelihood ratio detection process used in SCMA receivers without indexing the receiver. Thus, a new NOMA scheme is obtained by coding with IM. Bit error rate performance of the system is studied for 150% and 200% overloading factors.

Sparse Code Multiple Access (SCMA) is a class of competitive non-orthogonal multiple access (NOMA) that is proposed to support massive Machine Type of Communication (m-MTC). In this paper, we propose a new scheme to construct the SCMA codebooks, where we jointly optimize the rotation angles and mother codebook parameters. The basic idea is to make the upper bound of the error probability as smaller as possible. To realize it, we search for suitable angles and parameters through the bare bones particle swarm optimization (BBPSO) algorithm. The simulation results demonstrate that compared with the original SCMA, Star-QAM SCMA and LDS the new proposed SCMA codebooks provides better performance in both additive white Gaussian noise (AWGN) and Rayleigh channels, moreover, it also gives better performance in high overloading.

Recently, sparse code multiple access (SCMA) is proposed as one of the important candidacies for the fifth generation (5G) radio access technique. SCMA is a non-orthogonal multiple access (NOMA) technique which allows multiple users share the same radio resource and thus increase spectral efficiency largely. In SCMA, a set of binary coded bits is mapped directly into a complex vector by use of a predefined multi-dimensional codebook. The sparsity of the codewords makes the near-optimal detection feasible through iterative message passing algorithm (MPA). The pursuit of higher spectral efficiency motivates us to study the performance of multiple-input-multiple-output (MIMO) SCMA system in this paper. Simulation results show that compared with the conventional MIMO-OFDM system, MIMO-SCMA can provide a gain up to 50% in data throughput with the aid of MPA technique.

5 G networks may not be competent in fully supporting the high data rates, system capacity, and spectral efficiency expected in the upcoming 6 G networks. An enabling factor to achieve these requirements is the adoption of the Sparse Code Multiple Access (SCMA), which is one of the most promising code-domain Non-Orthogonal Multiple Access (NOMA) techniques. Nowadays, there are two major challenges for the implementation of SCMA in practical networks. First, the design of a near-optimal codebook set at the transmitter, that heavily impacts the network performance. Second, an efficient decoding algorithm at the receiver, that dominates the computational complexity of the system. The two aspects are not independent from each other; therefore the optimization of an SCMA network should address jointly both the Encoder and the Decoder side. Moreover, such solution is far from optimal when designed for general purpose use, since it does not exploit the channel statistical information known at the transmitter and the receiver side. However, most of the works available in the literature address only one aspect and also are not tailored for a given radio channel. In this paper, we design an end-to-end SCMA en/deconding structure based on the integration between a state-of-the-art AutoEncoder (AE) architecture and a novel Wasserstein Generative Adversarial Network (WGAN). The aim is to jointly create a near-optimal codebook design and a non-computationally heavy Decoder that are robust to the given channel statistics. Finally, we trained our model to be flexible to support different channel conditions and compared its performance against the state-of-the-art AE and the best conventional Decoders. The simulation results show that our innovative design exhibits decoding performance very similar to conventional Decoders with a reduced decoding latency.

Sparse code multiple access (SCMA), as a codebook-based non-orthogonal multiple access (NOMA) technique, has received research attention in recent years. The codebook design problem for SCMA has also been studied to some extent since codebook choices are highly related to the system's error rate performance. In this paper, we approach the SCMA codebook design problem by formulating an optimization problem to maximize the minimum Euclidean distance (MED) of superimposed codewords under power constraints. While SCMA codebooks with a larger MED are expected to obtain a better BER performance, no optimal SCMA codebook in terms of MED maximization, to the authors' best knowledge, has been reported in the SCMA literature yet. In this paper, a new iterative algorithm based on alternating maximization with exact penalty is proposed for the MED maximization problem. The proposed algorithm, when supplied with appropriate initial points and parameters, achieves a set of codebooks of all users whose MED is larger than any previously reported results. A Lagrange dual problem is derived which provides an upper bound of MED of any set of codebooks. Even though there is still a nonzero gap between the achieved MED and the upper bound given by the dual problem, simulation results demonstrate clear advantages in error rate performances of the proposed set of codebooks over all existing ones not only in AWGN channels but also in some downlink scenarios that fit in 5G/NR applications, making it a good codebook candidate thereof. The proposed set of SCMA codebooks, however, are not shown to outperform existing ones in uplink channels or in the case where non-consecutive OFDMA subcarriers are used. The correctness and accuracy of error curves in the simulation results are further confirmed by the coincidences with the theoretical upper bounds of error rates derived for any given set of codebooks.

This paper is focused on code-domain non-orthogonal multiple access (CD-NOMA), which is an emerging paradigm to support massive connectivity for future machine-type wireless networks. We take a comparative approach to study two types of overloaded CD-NOMA, i.e., sparse code multiple access (SCMA) and dense code multiple access (DCMA), which are distinctive from each other in terms of their codebooks having sparsity or not. By analysing their individual diversity orders (DO) in Rayleigh fading channels, it is found that DCMA can be designed with the aid of generalized sphere decoder (i.e., a nonlinear multiuser detector) to enjoy full DO which is equal to the maximum number of resource nodes in the system. This is in contrast to SCMA whose error rate suffers from limited DO equal to the codebook sparsity (i.e., the effective number of resource nodes occupied by each user). We conduct theoretical analysis for the codebook design criteria and propose to use generalized sphere decoder for DCMA detection. We numerically evaluate two types of multiple access schemes under “ 4×6” (i.e., six users communicate over four subcarriers) and “ 5×10” NOMA settings and reveal that DCMA gives rise to significantly improved error rate performance in Rayleigh fading channels, whilst having decoding complexity comparable to that of SCMA.

Non-orthogonal multiple access (NOMA) has emerged as a promising multiple-access technique capable of accommodating many users over limited time-frequency resources. Among several NOMA techniques, sparse code multiple access (SCMA) has emerged as viable due to its promise of high coding-gain by appropriate codebook-design and simplistic detection using message-passing algorithm (MPA). However, the performance of classic SCMA based systems are severely impaired by impulsive noise (IN), which causes outages and therefore non-negligible degradations to the bit-error-rate (BER) performance. Exploiting the robustness of the maximum correntropy criterion (MCC) to non-Gaussian noise processes, an MPA based detector is formulated with message-functions derived from the MCC criterion. Based on the said MCC criterion, concurrent-adaptation of the MCC’s spread-parameter is proposed in this letter. Lastly, analytical results for the proposed approach’s BER performance are presented with corresponding validation by computer-simulations.

Sparse Code Multiple Access (SCMA) is a promising non-orthogonal multiple access (NOMA) technique in future wireless communications. In this letter, a novel uplink codebook optimization method for SCMA using evolution strategies is proposed. Unlike traditional multi-stage codebook designs, we use a single-stage codebook construction method and directly optimizes the entire codebook. Fitness functions suitable for different uplink channels are proposed to jointly optimize various key metrics in the corresponding channels. By comparing our codebooks with various benchmark codebooks, simulation results show that the proposed method can significantly reduce the bit error rate in various uplink channels.

Currently, sparse code multiple access (SCMA) is a commonly used multiple-access technique, and it is a strong candidate for implementation as part of the fifth generation (5G) of wireless mobile communications. Although several design methods are available for SCMA codebooks, we propose a new method that optimizes point-to-point distances within the same codeword and from codebook-to-codebook for the same carrier based on singular value decomposition (SVD). A neural network-based receiver is proposed for detecting and decoding SVD–SCMA codewords. The simulation results show an improvement in the bit error rate (BER) compared to that for methods such as low-density signatures (LDS), SCMA, and multidimensional SCMA (MD-SCMA).

Sparse code multiple access (SCMA) is a newly proposed non-orthogonal multiple access technique for the 5th generation (5G) of wireless communication systems. It improves low-density signature multiple access (LDSMA) by replacing the inherent repetition code with multi-dimensional constellations. In this paper, the Gaussian-input channel capacities as well as the constellation constrained (CC) capacities of SCMA and LDSMA are analyzed and compared for the cases of Gaussian multiple access channel (GMAC) with random phase rotation and GMAC with fast fading, which disclose the performance potential of SCMA over LDSMA.

In 4G systems, Orthogonal Frequency-Division Multiple Access (OFDMA) has been used conventionally for multiple access purposes. This technique has low spectral efficiency since it allocates the resources orthogonally to each user. As an alternative to this technique, Non-orthogonal Multiple Access (NOMA) has been proposed for new generation systems as it allows different users to use the same resources and therefore, increases spectral efficiency. Sparse Code Multiple Access (SCMA) is a code-based NOMA technique and its performance depends on codebook design. In this study, a conventionally used codebook design in the literature has been considered and the system performance has been improved by increasing the distance between the signal constellation points. Considering two different design approaches, the conventional codebook has been modified and about 1dB gain has been achieved in the high signal-to-noiseratio (SNR) region.

Sparse code multiple access (SCMA) has been recently proposed for the future wireless networks, which allows non-orthogonal spectrum resource sharing and enables system overloading. In this paper, we apply SCMA into device-to-device (D2D) communication and cellular hybrid network, targeting at using the overload feature of SCMA to support massive device connectivity and expand network capacity. Particularly, we develop a stochastic geometry based framework to model and analyze SCMA, considering underlaid and overlaid mode. Based on the results, we analytically compare SCMA with orthogonal frequency-division multiple access (OFDMA) using area spectral efficiency (ASE) and quantify closed-form ASE gain of SCMA over OFDMA. Notably, it is shown that system ASE can be significantly improved using SCMA and the ASE gain scales linearly with the SCMA codeword dimension. Besides, we endow D2D users with an activated probability to balance cross-tier interference in the underlaid mode and derive the optimal activated probability. Meanwhile, we study resource allocation in the overlaid mode and obtain the optimal codebook allocation rule. It is interestingly found that the optimal SCMA codebook allocation rule is independent of cellular network parameters when cellular users are densely deployed. The results are helpful in the implementation of SCMA in the hybrid system.

Next-generation wireless networks require higher spectral efficiency and lower latency to meet the demands of various upcoming applications. Recently, non-orthogonal multiple access (NOMA) schemes are introduced in the literature for 5G and beyond. Various forms of NOMA are considered like power domain, code domain, pattern division multiple access, etc. to enhance the spectral efficiency of wireless networks. In this chapter, we introduce the code domain-based sparse code multiple access (SCMA) NOMA scheme to enhance the spectral efficiency of a wireless network. The design and detection of an SCMA system are analyzed in this chapter. Also, the method for codebooks design and its impact on system performance are highlighted. A hybrid multiple access scheme is also introduced using both code-domain and power-domain NOMA. Furthermore, simulation results are included to show the impact of various SCMA system parameters.

Nonorthogonal multiple access technology has been proposed for use in 5G communications systems. In particular, the sparse code multiple access (SCMA) scheme is believed to be one of the most promising techniques among the various nonorthogonal approaches that have been investigated. In this letter, we focus on reducing the complexity of SCMA decoding and we propose a Monte Carlo Markov Chain (MCMC) based SCMA decoder. Benefiting from the linearly increasing complexity of the MCMC method, the proposed SCMA decoder has only 10% of the computational load compared to previous state-of-the-art methods when the codebook size is 64. Consequently, the MCMC SCMA decoder has great potential for use in practical system implementations.