Computer Science – Information Theory
Scientific paper
2010-04-27
Computer Science
Information Theory
TO APPEAR IN PROC. OF IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT2010).
Scientific paper
This paper investigates the capacity of compound state-dependent channels with non-causal state information available at only the transmitter. A new lower bound on the capacity of this class of channels is derived. This bound is shown to be tight for the special case of compound channels with stochastic degraded components, yielding the full characterization of the capacity. Specific results are derived for the compound Gaussian Dirty-Paper (GDP) channel. This model consists of an additive white Gaussian noise (AWGN) channel corrupted by an additive Gaussian interfering signal, known at the transmitter only, where the input and the state signals are affected by fading coefficients whose realizations are unknown at the transmitter. Our bounds are shown to be tight for specific cases. Applications of these results arise in a variety of wireless scenarios as multicast channels, cognitive radio and problems with interference cancellation.
Piantanida Pablo
Shamai Shlomo
No associations
LandOfFree
On the Capacity of Compound State-Dependent Channels with States Known at the Transmitter 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 On the Capacity of Compound State-Dependent Channels with States Known at the Transmitter, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Capacity of Compound State-Dependent Channels with States Known at the Transmitter will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-67454