2012 IEEE Information Theory Workshop 2012
DOI: 10.1109/itw.2012.6404764
|View full text |Cite
|
Sign up to set email alerts
|

Achievable rate regions for compound multiple access channel with channel state information

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2012
2012
2015
2015

Publication Types

Select...
3
2

Relationship

3
2

Authors

Journals

citations
Cited by 5 publications
(8 citation statements)
references
References 5 publications
0
8
0
Order By: Relevance
“…Note that by splitting the message M 2 to two sub-messages and letting M 2c be decoded at the first decoder, receiver 1 is able to reduce the effective interference and therefore, the rate R 1 is boosted. Finally, the rate region R ZIC-NSI is achieved by joint typicality decoding [11].…”
Section: Discrete Memoryless Z-interference Channel With Non-causal Smentioning
confidence: 99%
“…Note that by splitting the message M 2 to two sub-messages and letting M 2c be decoded at the first decoder, receiver 1 is able to reduce the effective interference and therefore, the rate R 1 is boosted. Finally, the rate region R ZIC-NSI is achieved by joint typicality decoding [11].…”
Section: Discrete Memoryless Z-interference Channel With Non-causal Smentioning
confidence: 99%
“…Proof: The proof follows the same lines as that of Theorem 1 except that in this case, since V 1 , V 2 are independent of S 1 , S 2 , the encoding scheme does not include binning and during the codebook generation process, instead of generating 2 n R k +R k , k = 1, 2, n-sequences v n k , we only generate 2 nR k such sequences. Therefore, by negligibly altering the codebook generated we can easily derive the expressions in (17). In fact, if the senders want to send (m 1b , m 2b ) to the receiver, upon choosing the helping index m 0b , they find the suitable u n , v n 1 and v n 2 sequences directly and then send x n 1 and x n 2 where…”
Section: B Mac With Two-sided Feedback and Causal Statementioning
confidence: 99%
“…MAC was first studied in [1] and [2] where the capacity region of the discrete memoryless MAC (DM-MAC) with independent sources was found. Many variations of the MAC have been studied, including the MAC with correlated sources [3]- [4], the MAC with feedback [5]- [9] and the MAC with side information [10]- [13], [17], [18]. In the case of the DM-MAC with feedback, Gaarder and Wolf [5] have shown through the use of a binary example that the capacity region of the DM-MAC can be increased using noiseless feedback from the receiver to both transmitters.…”
Section: Introductionmentioning
confidence: 99%
“…where ∈ [0,1] and � = 1 − for ∈ {1,2} . By using these mappings, and considering the channel model described by (8) and (9), we obtain � 1, = � 11, 1, + � 21, 2, + � 1,…”
Section: Proof Of Theoremmentioning
confidence: 99%
“…Simeone et al [7] extended the channel models in [6] to the case with conferencing decoders and studied the compound MAC with a common message and conferencing decoders, and compound MAC with both conferencing encoders and decoders. Recently, the compound MACC with Slepian-Wolf type correlated channel states has been studied in [8].…”
Section: Introductionmentioning
confidence: 99%