By Topic

Memoryless Multiple Access Channel With Asymmetric Noisy State Information at the Encoders

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Sen, N. ; Dept. of Math. & Stat., Queen's Univ., Kingston, ON, Canada ; Alajaji, F. ; Yuksel, S. ; Como, G.

The problem of reliable communication over the memoryless state-dependent multiple-access channel (MAC) is considered, where the encoders and the decoder are provided with various degrees of asymmetric noisy channel state information (CSI). For the case where the encoders observe causal, asymmetric noisy CSI and the decoder observes complete CSI, inner and outer bounds to the capacity region, which are tight for the sum-rate capacity, are provided. Next, single-letter characterizations for the channel capacity regions under each of the following system settings are established: 1) the CSI at the encoders are asymmetric deterministic functions of the CSI at the decoder and the encoders have noncausal noisy CSI; 2) the encoders observe asymmetric noisy CSI with asymmetric delays and the decoder observes complete CSI; 3) a degraded message set scenario with asymmetric noisy CSI at the encoders and complete and/or noisy CSI at the decoder. The main component in these results is a generalization of a recently introduced converse coding approach for the MAC with asymmetric quantized CSI at the encoders and herein considerably extended and adapted for the noisy CSI setup.

Published in:

Information Theory, IEEE Transactions on  (Volume:59 ,  Issue: 11 )