2010 IEEE International Symposium on Information Theory 2010
DOI: 10.1109/isit.2010.5513465
|View full text |Cite
|
Sign up to set email alerts
|

The capacity region of fading Multiple Access Channels with cooperative encoders and partial CSIT

Abstract: In this paper, we study the two-user Gaussian fading Multiple Access Channel (MAC) with cooperative encoders. Two different scenarios are studied: the Gaussian fading MAC with a common message, and the Gaussian fading MAC with conferencing encoders. The throughput capacity region of these channels with partial Channel State Information (CSI) at the transmitters (CSIT) and perfect CSI at the receiver (CSIR) is established. For the Gaussian fading systems with only CSIR (transmitters have no access to CSIT), som… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

2
17
0

Year Published

2010
2010
2018
2018

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 16 publications
(19 citation statements)
references
References 13 publications
2
17
0
Order By: Relevance
“…Thus S + γe β S and S + γe −β S have same distance profiles, for any β ∈ [0, π]. This together with (7) proves the second part of the lemma. From Lemma 2, it is clear that when both users use M -PSK signal sets, if (γ ′ , θ ′ ) is a singular fade state, then there exists singular fade states at (γ ′ , θ ′ + p 2π M ), where 1 ≤ p ≤ M − 1 because distance distribution in S eff is periodic with period 2π M .…”
Section: For Any Arbitrary Value Ofsupporting
confidence: 67%
See 3 more Smart Citations
“…Thus S + γe β S and S + γe −β S have same distance profiles, for any β ∈ [0, π]. This together with (7) proves the second part of the lemma. From Lemma 2, it is clear that when both users use M -PSK signal sets, if (γ ′ , θ ′ ) is a singular fade state, then there exists singular fade states at (γ ′ , θ ′ + p 2π M ), where 1 ≤ p ≤ M − 1 because distance distribution in S eff is periodic with period 2π M .…”
Section: For Any Arbitrary Value Ofsupporting
confidence: 67%
“…(1, 5), (1,13), (4,8), (2,6), (2,14), (3,7), (3,15), (4, 16), 2γ 2 (1, 5) (6, 10), (7,11), (8,12), (5,9), (12, 16), (11, 15), (10, 14), (9, 13) 8 (1,9), (2, 10), (3,11), (4,12), (6,14), (5,13), (7,15), (8, 16) 4γ 2 (1, 9) 9…”
Section: B Channel Quantization For the M -Psk Casementioning
confidence: 99%
See 2 more Smart Citations
“…which after dropping the redundant terms, we obtain the desired constraint in (8). Finally, based on (64) and (66) we have a 30 = a 32 , and subsequently,…”
Section: B Proof Of Theoremmentioning
confidence: 97%