Achievable Rate Region for Multiple Access Channel with Correlated Channel States and Cooperating Encoders

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

7 pages, 2 figures

Scientific paper

In this paper, a two-user discrete memoryless multiple-access channel (DM-MAC) with correlated channel states, each known at one of the encoders is considered, in which each encoder transmits independent messages and tries to cooperate with the other one. To consider cooperating encoders, it is assumed that each encoder strictly-causally receives and learns the other encoder's transmitted symbols and tries to cooperate with the other encoder by transmitting its message. Next, we study this channel in a special case; we assume that the common part of both states is known at both, hence encoders use this opportunity to get better rate region. For these scenarios, an achievable rate region is derived based on a combination of block-Markov encoding and Gel'fand-Pinsker coding techniques. Furthermore, the achievable rate region is established for the Gaussian channel, and it is shown that the capacity region is achieved in certain circumstances.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Achievable Rate Region for Multiple Access Channel with Correlated Channel States and Cooperating Encoders does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Achievable Rate Region for Multiple Access Channel with Correlated Channel States and Cooperating Encoders, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Achievable Rate Region for Multiple Access Channel with Correlated Channel States and Cooperating Encoders will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-506279

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.