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

SCMA Codebook Based on Optimization of Mutual Information and Shaping Gain

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
11
0

Year Published

2019
2019
2021
2021

Publication Types

Select...
3
3
1

Relationship

2
5

Authors

Journals

citations
Cited by 19 publications
(11 citation statements)
references
References 23 publications
0
11
0
Order By: Relevance
“…The simulations are carried out to evaluate the performance of the proposed codebooks. For comparison, the following codebooks are considered: • "Zhang [6]" • "Sharma [10]" • "Yu [8]" • "Ma [18]" (Chapter 12 of [18]). As per the thumb rules provided in [19,20], the DE parameters are set to: S P = 20, D = 12, C r = 0.95, α = 0.6 and I max = 80.…”
Section: Simulation Resultsmentioning
confidence: 99%
See 3 more Smart Citations
“…The simulations are carried out to evaluate the performance of the proposed codebooks. For comparison, the following codebooks are considered: • "Zhang [6]" • "Sharma [10]" • "Yu [8]" • "Ma [18]" (Chapter 12 of [18]). As per the thumb rules provided in [19,20], the DE parameters are set to: S P = 20, D = 12, C r = 0.95, α = 0.6 and I max = 80.…”
Section: Simulation Resultsmentioning
confidence: 99%
“…Observe that the proposed codebooks outperform the others by a significant margin. Specifically, there is coding gain of about 1.4 dB at SER=10 −5 over the next best codebooks ("Sharma [10]"). The performance of "Ma [18]" over AWGN channel is not satisfactory.…”
Section: A Awgn Channelmentioning
confidence: 99%
See 2 more Smart Citations
“…Noting that Problems ( 14) and ( 15) are the two equivalent forms of the primal problem, one can derive the dual problem for each of the forms. Here, we choose to derive the Lagrange dual of Problem (15) since its QCQP form makes the dual problem derivation much easier than Problem (14). First of all, the Lagrangian of Problem (15) is…”
Section: Dual Problem Of Med Maximization Problemmentioning
confidence: 99%