On the capacity of the carbon copying onto dirty paper channel

Costa's "writing on dirty paper" capacity result establishes that full state pre-cancellation can be attained in the Gel'fand-Pinsker channel with additive state and additive Gaussian noise. The "carbon copy onto dirty paper" channel is the extension of Costa's model to the compound setting: here a common message is to be decoded at M receivers, each observing the sum of the channel input, Gaussian noise and one of M possible state sequences. As in the Gel'fand-Pinsker channel, the state sequences are anti-causally known at the encoder, which can thus pre-code its transmissions so as to minimize the adverse effects of the channel states. In this paper we derive the capacity to within 2.25 bits-per-channel-use of the M-user "carbon copying onto dirty paper" channel in which the state sequences are Gaussian distributed with the same variance and the same pairwise correlation.

[1]  Abbas El Gamal,et al.  An Achievability Scheme for the Compound Channel with State Noncausally Available at the Encoder , 2010, ArXiv.

[2]  A. Sahai,et al.  On the Need for Knowledge of the Phase in Exploiting Known Primary Transmissions , 2007, 2007 2nd IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks.

[3]  Stefano Rini,et al.  On the capacity of the Gaussian broadcast channel with states known at the transmitter , 2016, 2016 IEEE International Conference on the Science of Electrical Engineering (ICSEE).

[4]  Emre Telatar,et al.  The Compound Channel Capacity of a Class of Finite-State Channels , 1998, IEEE Trans. Inf. Theory.

[5]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[6]  Vinod M. Prabhakaran,et al.  Is Non-Unique Decoding Necessary? , 2014, IEEE Trans. Inf. Theory.

[7]  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.

[8]  Max H. M. Costa,et al.  Writing on dirty paper , 1983, IEEE Trans. Inf. Theory.

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

[10]  Shlomo Shamai,et al.  The impact of phase fading on the dirty paper coding channel , 2014, 2014 IEEE International Symposium on Information Theory.

[11]  J. Nicholas Laneman,et al.  Writing on Dirty Paper with Resizing and its Application to Quasi-Static Fading Broadcast Channels , 2007, 2007 IEEE International Symposium on Information Theory.

[12]  David Tse,et al.  The two-user Gaussian interference channel: a deterministic view , 2008, Eur. Trans. Telecommun..

[13]  Andrea J. Goldsmith,et al.  A Unified Graphical Approach to Random Coding for Single-Hop Networks , 2016, IEEE Transactions on Information Theory.

[14]  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..

[15]  Shlomo Shamai,et al.  On the dirty paper channel with fast fading dirt , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[16]  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.

[17]  Shlomo Shamai,et al.  On capacity of the dirty paper channel with fading dirt in the strong fading regime , 2014, 2014 IEEE Information Theory Workshop (ITW 2014).

[18]  Mahesh K. Varanasi,et al.  Dirty Paper Coding for fading channels with partial transmitter side information , 2008, 2008 42nd Asilomar Conference on Signals, Systems and Computers.

[19]  Anant Sahai,et al.  Writing on Rayleigh faded dirt: a computable upper bound to the outage capacity , 2007, 2007 IEEE International Symposium on Information Theory.

[20]  Shlomo Shamai,et al.  Multiple description coding for the Compound Broadcast Channel , 2014, 2014 IEEE Information Theory Workshop (ITW 2014).

[21]  Ying Wang,et al.  Capacity and Random-Coding Exponents for Channel Coding With Side Information , 2007, IEEE Transactions on Information Theory.

[22]  Shlomo Shamai,et al.  On the dirty paper channel with fading dirt , 2010, 2010 IEEE 26-th Convention of Electrical and Electronics Engineers in Israel.