On capacity of the dirty paper channel with fading dirt in the strong fading regime

Rini, Stefano; Shamai, Shlomo

doi:10.1109/itw.2014.6970894

Cited by 10 publications

(15 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [20] we determine the approximate capacity of the WFFD channel with antipodal fading: it is interesting to compare the different effects of slow and fast fading on the capacity of the WDP channel for the antipodal fading distribution. By letting a = −1 in Th.…”

Section: A Discussionmentioning

confidence: 99%

See 1 more Smart Citation

On the Capacity of the Carbon Copy onto Dirty Paper Channel

Rini

Shamai

2017

IEEE Trans. Inform. Theory

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Section: A Discussionmentioning

confidence: 99%

“…In order to simplify the derivation, we also set the noise terms to be identical, i.e. (20) and using the assumption in (65), we write…”

Section: Appendix D Proof Of Th Iii2mentioning

confidence: 99%

On the Capacity of the Carbon Copy onto Dirty Paper Channel

Rini

Shamai

2017

IEEE Trans. Inform. Theory

Self Cite

View full text Add to dashboard Cite

show abstract

“…In this channel, the BC receivers decode the common message by observing a channel output containing a state sequence noncausally known at the transmitter. The approximate capacity for a specific choice of correlation among Gaussian distributed states has been derived in [7] for the 2-user GBC-SKT and in [8] for the K-user GBC-SKT. In both problems statistically equivalent outputs are considered.…”

Section: Introductionmentioning

confidence: 99%

On the capacity of a class of K ‐user Gaussian broadcast channel with states known at the transmitter

Ghabeli

2018

IET Communications

View full text Add to dashboard Cite

“…1 The additive Gaussian noise, additive Gaussian state version of the compound GP is first studied in [7] where this model is termed the "carbon copying onto dirty paper" (CCDP) channel. 2 In [8] we study the CCDP in which states are a scaled version of a given sequence: for this model we show the approximate capacity in the "strong fading" parameter regime. In [9], we determine the approximate capacity of the CCDP with i.i.d.…”

Section: Introductionmentioning

confidence: 99%

The approximate capacity for the 3-receiver writing on random dirty paper channel

Rini

Shamai

2017

2017 IEEE Information Theory Workshop (ITW)

Self Cite

View full text Add to dashboard Cite

In this paper, the approximate capacity of the 3receiver "writing on random dirty paper" (WRDP) channel is derived. In the M -receiver WRDP channel, the channel output is obtained as the sum of the channel input, white Gaussian noise and a channel state sequence randomly selected among a set of M independent Gaussian sequences. The transmitter has non-causal knowledge of the set of possible state sequences but does not know which one is selected to produce the channel output. In the following, we derive upper and lower bounds to the capacity of the 3-receiver WRDP channel which are to within a distance of at most 3 bits-per-channel-use (bpcu) for all channel parameters. In the achievability proof, the channel input is composed of the superposition of three codewords: the receiver opportunistically decodes a different set of codewords, depending on the variance of the channel state appearing in the channel output. Time-sharing among multiple transmission phases is employed to guarantee that transmitted message can be decoded regardless of the state realization. In the converse proof, we derive a novel outer bound which matches the pre-log coefficient arising in the achievability proof due to time-sharing. Although developed for the case of three possible state realizations, our results can be extended the general WRDP.

show abstract

On capacity of the dirty paper channel with fading dirt in the strong fading regime

Cited by 10 publications

References 13 publications

On the Capacity of the Carbon Copy onto Dirty Paper Channel

On the Capacity of the Carbon Copy onto Dirty Paper Channel

On the capacity of a class of K ‐user Gaussian broadcast channel with states known at the transmitter

The approximate capacity for the 3-receiver writing on random dirty paper channel

Contact Info

Product

Resources

About