2018
DOI: 10.1109/twc.2018.2810083
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic Decode-and-Forward Based Cooperative NOMA With Spatially Random Users

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
40
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
5
1
1

Relationship

1
6

Authors

Journals

citations
Cited by 64 publications
(40 citation statements)
references
References 28 publications
0
40
0
Order By: Relevance
“…The main idea of downlink power-domain NOMA is to apply superposition coding at the BS and to perform successive interference cancellation (SIC) at the users except the one that is allocated the highest transmit power [22], [23]. The authors in [24] evaluated the performance of NOMA in practical cellular networks and showed that NOMA with appropriate user pairing and power allocation can achieve better performance than orthogonal multiple access (OMA).…”
Section: Introductionmentioning
confidence: 99%
“…The main idea of downlink power-domain NOMA is to apply superposition coding at the BS and to perform successive interference cancellation (SIC) at the users except the one that is allocated the highest transmit power [22], [23]. The authors in [24] evaluated the performance of NOMA in practical cellular networks and showed that NOMA with appropriate user pairing and power allocation can achieve better performance than orthogonal multiple access (OMA).…”
Section: Introductionmentioning
confidence: 99%
“…which is equal to β (k+1) vi 1 eEi(v 1,i1 I 1,k+1 ) + k+1 i=1 β (k+1) αi eEi(I 1,k+1 /α i ) with the coefficients defined similar to (49) by substituting k + 1 for k. This suggests that the induction step holds and completes the proof by recurrence. At the end, by substituting k = K in (48) and (49) and noting that I 1,K = Bg, one can obtain (28) and (29).…”
Section: Appendix B Useful Integral Equations Over Ei(·)mentioning
confidence: 99%
“…(6.224.1)]. APPENDIX C PROOF OF (28) AND (29) In this appendix, we show how the expectation term involved in V 1 in (27) can be calculated in a closed form over I 1 . To begin with, let us, for the ease of notation, define α k L ′ k p ′ k /(a 1 L 1 P ), k = 1, 2, ..., K, Bg [σ 2 R + C D /g 2 ]/(a 1 L 1 P ), I 1,l K k=l+1 α k |h ′ k | 2 + Bg, l = 1, 2, ..., K − 1, and I 1,K Bg.…”
mentioning
confidence: 99%
“…The Zhong and Zhang analyze the performance of a full‐duplex (FD) NOMA system with cooperative relaying. Recently, the performance of NOMA with cooperative relaying has been widely investigated . Kim and Lee study the capacity performance of relay based NOMA system.…”
Section: Introductionmentioning
confidence: 99%
“…Zhao et al consider a two‐user multi‐relay cooperative NOMA network with distributed space‐time coding and propose two dual RS strategies. Zhou et al propose a dynamic decode–and–forward (DDF)‐based cooperative NOMA scheme for downlink transmission with spatially random users and evaluate the performance of the network under random and distance‐based user pairing strategies.…”
Section: Introductionmentioning
confidence: 99%