Download Now Free registration required
The authors consider two-hop S-R-D Gaussian networks with a Source (S), a Relay (R) and a Destination (D), some of which experience additive interference. This additive interference, which renders the channels state-dependent, is either experienced at the destination D and known non-causally at the source S, or experienced at the relay R and known at the destination D. In both cases, one would hope to exploit this knowledge of the channel state at some of the nodes to obtain "Clean" or interference-free channels, just as Costa's dirty-paper coding does for one-hop channels with state non-causally known to the transmitter.
- Format: PDF
- Size: 508.1 KB