Dirty interference cancellation for Gaussian broadcast channels

The state-dependent broadcast channel with a helper is investigated, in which a transmitter wishes to send messages to two receivers via a broadcast channel. The channel is corrupted by an independent and identically distributed (i.i.d.) state sequence which is known to neither the transmitter nor the receivers. A helper that knows the state sequence noncausally assists the broadcast transmission to cancel state interference. Two scenarios are studied. In scenario 1, the transmitter sends one message to both receivers, and in scenario II, the transmitter sends two private messages respectively to two receivers. Our focus is on the Gaussian channel with additive state. Inner and outer bounds are derived for both scenarios. By comparing the inner and outer bounds, capacity/capacity region are characterized under various ranges of channel parameters. Practical impact of the model and results are discussed.

[1]  Te Sun Han,et al.  A new achievable rate region for the interference channel , 1981, IEEE Trans. Inf. Theory.

[2]  Mahtab Mirmohseni,et al.  Cooperative relay-broadcast channels with causal Channel State Information , 2009, 2009 IEEE International Symposium on Information Theory.

[3]  Yossef Steinberg,et al.  Coding for the degraded broadcast channel with random parameters, with causal and noncausal side information , 2005, IEEE Transactions on Information Theory.

[4]  Reza Khosravi-Farsani,et al.  Capacity bounds for multiuser channels with non-causal channel state information at the transmitters , 2011, 2011 IEEE Information Theory Workshop.

[5]  Shlomo Shamai,et al.  State-dependent parallel Gaussian channels with a common helper in high power regime , 2014, 2014 IEEE International Symposium on Information Theory.

[6]  Shlomo Shamai,et al.  Achievable rates for the broadcast channel with states known at the transmitter , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[7]  Gregory W. Wornell,et al.  Carbon Copying Onto Dirty Paper , 2007, IEEE Transactions on Information Theory.

[8]  Patrick Mitran,et al.  On compound channels with side information at the transmitter , 2006, IEEE Transactions on Information Theory.

[9]  Stephan ten Brink,et al.  A close-to-capacity dirty paper coding scheme , 2004, IEEE Transactions on Information Theory.

[10]  Shlomo Shamai,et al.  On the capacity of compound state-dependent channels with states known at the transmitter , 2010, 2010 IEEE International Symposium on Information Theory.

[11]  Amos Lapidoth,et al.  The State-Dependent Semideterministic Broadcast Channel , 2011, IEEE Transactions on Information Theory.

[12]  Shlomo Shamai,et al.  State-dependent Gaussian Z-channel with mismatched side-information and interference , 2013, 2013 IEEE Information Theory Workshop (ITW).