On the Capacity of Compound State-Dependent Channels with States Known at the Transmitter

Pablo Piantanida (1) , S. Shamai (2)

1 E3S - Supélec Sciences des Systèmes
2 Department of Computer Science [Haifa]

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.

Domains: Mathematics [math]; Information Theory [math.IT]; Computer Science [cs]; Information Theory [cs.IT]

Pablo Piantanida, S. Shamai. On the Capacity of Compound State-Dependent Channels with States Known at the Transmitter. 2010 IEEE International Symposium on Information Theory , Jun 2010, Austin, United States. pp.624-628, ⟨10.1109/ISIT.2010.5513557⟩. ⟨hal-00528375⟩