Computer Science – Information Theory
Scientific paper
2009-01-13
Computer Science
Information Theory
33 pages, Revised version submitted to IEEE Transactions on Information Theory
Scientific paper
A new single-letter achievable rate region is proposed for the two-user discrete memoryless multiple-access channel(MAC) with noiseless feedback. The proposed region includes the Cover-Leung rate region, and it is shown that the inclusion is strict. The proof uses a block-Markov superposition strategy based on the observation that the messages of the two users are correlated given the feedback. The rates of transmission are too high for each encoder to decode the other's message directly using the feedback, so they transmit correlated information in the next block to learn the message of one another. They then cooperate in the following block to resolve the residual uncertainty of the decoder. Our coding scheme may be viewed as a natural generalization of the Cover-Leung scheme with a delay of one extra block and a pair of additional auxiliary random variables. We compute the proposed rate region for two different MACs and compare the results with other known rate regions for the MAC with feedback. Finally, we show how our coding scheme can be extended to obtain larger rate-regions with more auxiliary random variables.
Pradhan Sandeep S.
Venkataramanan Ramji
No associations
LandOfFree
A New Achievable Rate Region for the Discrete Memoryless Multiple-Access Channel with Noiseless Feedback 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 A New Achievable Rate Region for the Discrete Memoryless Multiple-Access Channel with Noiseless Feedback, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A New Achievable Rate Region for the Discrete Memoryless Multiple-Access Channel with Noiseless Feedback will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-374565