2016
DOI: 10.1109/lcomm.2016.2551742
|View full text |Cite
|
Sign up to set email alerts
|

Shuffled Multiuser Detection Schemes for Uplink Sparse Code Multiple Access Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
32
0
2

Year Published

2018
2018
2020
2020

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 80 publications
(34 citation statements)
references
References 10 publications
0
32
0
2
Order By: Relevance
“…Some popular code domain NOMA solutions include sparse code multiple access (SCMA), low-density spreading CDMA (LDS-CDMA), LDS aided OFDM (LDS-OFDM), MUST, and successive interference cancellation aided MA (SAMA). The readers are referred to see [44][45][46][47][48][49][50][51][52][53][54][55] and references therein to have more deep insights into the code domain NOMA.…”
Section: Basic Concepts Of Nomamentioning
confidence: 99%
“…Some popular code domain NOMA solutions include sparse code multiple access (SCMA), low-density spreading CDMA (LDS-CDMA), LDS aided OFDM (LDS-OFDM), MUST, and successive interference cancellation aided MA (SAMA). The readers are referred to see [44][45][46][47][48][49][50][51][52][53][54][55] and references therein to have more deep insights into the code domain NOMA.…”
Section: Basic Concepts Of Nomamentioning
confidence: 99%
“…In reference [34], a threshold based MPA algorithm is proposed, which uses a threshold to control the algorithm, so as to reduce the complexity of the detection algorithm. An MPA algorithm based on a serial strategy is proposed in [35]. In reference [36], an improved serial scheduling based MPA (ISS-MPA) detection scheme is proposed.…”
Section: Introductionmentioning
confidence: 99%
“…Em [7], o log-MPA utiliza a operação max para evitar o cálculo de somas de um grande número de funções exponenciais. Para acelerar a convergência e reduzir o número de operações do MPA, modificações das equações de atualização são propostas em [8][9][10][11][12][13], reduzindo a complexidade das iterações t > 1 (após a primeira). Porém, em todos esses trabalhos, a primeira iteração possui ainda complexidade exponencial M d f .…”
unclassified
“…Devidoà complexidade exponencial, as soluções de MPA em [2][3][4][5][7][8][9][10][11][12][13] não são práticas para altos graus de sobrecarga ou altas taxas de modulação.…”
unclassified