By Topic

Capacities of time-varying multiple-access channels with side information

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
$31 $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

2 Author(s)
Das , A. ; Lucent Technol. Bell Labs., Holmdel, NJ, USA ; Narayan, P.

We determine the capacity regions for a class of time-varying multiple-access channels (TVMACs), when the underlying channel state evolves in time according to a probability law which is known to the transmitters and the receiver. Additionally, the transmitters and the receiver have access to varying degrees of channel state information (CSI) concerning the condition of the channel. Discrete-time channels with finite input, output and state alphabets are considered first. Next, in order to reduce transmitter complexity, we restrict the encoders at each time instant to depend only on a limited extent of CSI. As a special case, we consider a memoryless TVMAC, with the channel state process being a time-invariant, indecomposable, aperiodic Markov chain. We then study a time-varying (multiple-access) fading channel (TVFC) with additive Gaussian noise, when various amounts of CSI are provided to the transmitters while perfect CSI is available to the receiver, and the fades are assumed to be stationary and ergodic

Published in:

Information Theory, 2000. Proceedings. IEEE International Symposium on

Date of Conference: