2016 IEEE Globecom Workshops (GC Wkshps) 2016
DOI: 10.1109/glocomw.2016.7848813
|View full text |Cite
|
Sign up to set email alerts
|

A High Performance Joint Detection and Decoding Scheme for LDPC Coded SCMA System

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
15
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 20 publications
(16 citation statements)
references
References 9 publications
0
15
0
Order By: Relevance
“…Similar to SDD, after the same initialisation as that of the MPA detector of SDD, the JDD starts out by updating η s j m ,(1) j,i based on (9) in the p-th outer iteration. The updated codeword probability η s j m ,(1) j,i is converted to bit LLRs according to (11) and input to the upper turbo decoder of Fig. 3 as a priori LLRs.…”
Section: B Joint Signal Detection and Decodingmentioning
confidence: 99%
See 2 more Smart Citations
“…Similar to SDD, after the same initialisation as that of the MPA detector of SDD, the JDD starts out by updating η s j m ,(1) j,i based on (9) in the p-th outer iteration. The updated codeword probability η s j m ,(1) j,i is converted to bit LLRs according to (11) and input to the upper turbo decoder of Fig. 3 as a priori LLRs.…”
Section: B Joint Signal Detection and Decodingmentioning
confidence: 99%
“…The SCMA arrangement amalgamated with different channel coding schemes was investigated in [9][10][11][12][13][14][15], as summarised in Table I. To be more specific, an iterative multiuser receiver inspired by the 'turbo' principle for turbo-coded SCMA systems was proposed in [9,15] for increasing the coding gain, especially in the case of heavy user loads.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Therefore, improving the error performance of a joint system while reducing the delay and complexity of decoding has become a key research topic. Most of the current research mainly focuses on the turbo code and LDPC code combined with SCMA [24][25][26][27][28][29][30][31][32][33][34][35][36][37][38].…”
Section: Related Workmentioning
confidence: 99%
“…MPA algorithm was divided into the inherent part and the prior part from the perspective of solving edge functions, and MPA algorithm based on the logarithmic form was derived as an approximate algorithm of MAP, which effectively reduced the computational complexity. The authors of [36] combined RNs, joint user nodes (UNs), and check nodes into a joint factor graph to update messages among the three types of nodes. At the same time, the computation complexity was effectively reduced by the Jacobi approximation algorithm.…”
Section: Related Workmentioning
confidence: 99%