On the Capacity of the Carbon Copy onto Dirty Paper Channel

DOI10.1109/TIT.2017.2708112zbMATH Open1374.94760arXiv1707.02398OpenAlexW2617429968MaRDI QIDQ4589414FDOQ4589414

Authors: Stefano Rini, S. Shamai 

Publication date: 10 November 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: The "Carbon Copy onto Dirty Paper" (CCDP) channel is the compound "writing on dirty paper" channel in which the channel output is obtained as the sum of the channel input, white Gaussian noise and a Gaussian state sequence randomly selected among a set possible realizations. The transmitter has non-causal knowledge of the set of possible state sequences but does not know which sequence is selected to produce the channel output. We study the capacity of the CCDP channel for two scenarios: (i) the state sequences are independent and identically distributed, and (ii) the state sequences are scaled versions of the same sequence. In the first scenario, we show that a combination of superposition coding, time-sharing and Gel'fand-Pinsker binning is sufficient to approach the capacity to within three bits per channel use for any number of possible state realizations. In the second scenario, we derive capacity to within four bits-per-channel-use for the case of two possible state sequences. This result is extended to the CCDP channel with any number of possible state sequences under certain conditions on the scaling parameters which we denote as "strong fading" regime. We conclude by providing some remarks on the capacity of the CCDP channel in which the state sequences have any jointly Gaussian distribution.

Full work available at URL: https://arxiv.org/abs/1707.02398

Recommendations

• A close-to-capacity dirty paper coding scheme
• scientific article; zbMATH DE number 2065306
• scientific article; zbMATH DE number 2154513
• Near-Capacity Dirty-Paper Code Design: A Source-Channel Coding Approach
• An Upper Bound on the Capacity of the Causal Dirty-Paper Channel
• On the Dispersions of the Gel’fand–Pinsker Channel and Dirty Paper Coding
• Dirty-Paper Coding for the Gaussian Multiaccess Channel With Conferencing
• On the transport capacity of a broadcast Gaussian channel
• Asymptotics of Input-Constrained Erasure Channel Capacity
• On the asymptotic capacity of a multi-access channel

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40)

This page was built for publication: On the Capacity of the Carbon Copy onto Dirty Paper Channel

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4589414)