Low Complexity Iterative Receiver Design for Sparse Code Multiple Access

02/27/2020
by   Fan Wei, et al.
0

Sparse code multiple access (SCMA) is one of the most promising methods among all the non-orthogonal multiple access techniques in the future 5G communication. Compared with some other non-orthogonal multiple access techniques such as low density signature (LDS), SCMA can achieve better performance due to the shaping gain of the SCMA codewords. However, despite of the sparsity of the codewords, the decoding complexity of the current message passing algorithm (MPA) utilized by SCMA is still prohibitively high. In this paper, by exploring the lattice structure of SCMA codewords, we propose a low complexity decoding algorithm based on list sphere decoding (LSD). The LSD avoids the exhaustive search for all possible hypotheses and only considers signal within a hypersphere. As LSD can be viewed a depth-first tree search algorithm, we further propose several methods to prune the redundancy visited nodes in order to reduce the size of the search tree. Simulation results show that the proposed algorithm can reduce the decoding complexity substantially while the performance loss compared with the existing algorithm is negligible.

READ FULL TEXT

page 3

page 4

page 5

page 6

page 7

page 10

page 11

page 13

research
03/31/2018

Efficient Sparse Code Multiple Access Decoder Based on Deterministic Message Passing Algorithm

Being an effective non-orthogonal multiple access (NOMA) technique, spar...
research
05/19/2023

CIAMA: A new multiple access scheme

This paper studies advanced multi-access techniques to support a high vo...
research
05/14/2021

A Tutorial to Sparse Code Multiple Access

Sparse Code Multiple Access (SCMA) is an enabling code-domain non-orthog...
research
08/17/2020

On the Complexity Reduction of Uplink Sparse Code Multiple Access for Spatial Modulation

Multi-user spatial modulation (SM) assisted by sparse code multiple acce...
research
10/22/2021

Uniquely Decodable Multi-Amplitude Sequence for Massive Grant-free Multiple-Access Adder Channels

Massive grant-free multiple-access is a valuable research topic for next...
research
05/26/2021

Approximate Support Recovery using Codes for Unsourced Multiple Access

We consider the approximate support recovery (ASR) task of inferring the...
research
03/24/2023

Generalized Sparse Regression Codes for Short Block Lengths

Sparse regression codes (SPARC) connect the sparse signal recovery frame...

Please sign up or login with your details

Forgot password? Click here to reset