On the Dirty Paper Channel with Fast Fading Dirt
Stefano Rini, Shlomo Shamai Shitz

TL;DR
This paper extends Costa's dirty paper coding to channels with multiplicative ergodic fading, deriving bounds on capacity and analyzing the impact of fading knowledge at transmitter and receiver.
Contribution
It introduces capacity bounds for dirty paper channels with unknown fading at the encoder, a scenario not previously fully characterized.
Findings
Finite gap between inner and outer bounds for certain fading distributions.
Transmitter pre-codes against the mean fading times the state.
Capacity remains hard to characterize for continuous fading distributions.
Abstract
Costa`s "writing on dirty paper" result establishes that full state pre-cancellation can be attained in the Gel`fand-Pinsker problem with additive state and additive white Gaussian noise. This result holds under the assumptions that full channel knowledge is available at both the transmitter and the receiver. In this work we consider the scenario in which the state is multiplied by an ergodic fading process which is not known at the encoder. We study both the case in which the receiver has knowledge of the fading and the case in which it does not: for both models we derive inner and outer bounds to capacity and determine the distance between the two bounds when possible. For the channel without fading knowledge at either the transmitter or the receiver, the gap between inner and outer bounds is finite for a class of fading distributions which includes a number of canonical fading…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsWireless Communication Security Techniques · Cooperative Communication and Network Coding · Cellular Automata and Applications
