Two-Way Writing on Dirty Paper

TL;DR

This paper investigates the capacity of two-way channels with channel state information, demonstrating that in Gaussian channels, interference can be effectively canceled, achieving the same capacity as interference-free channels.

Contribution

It extends Costa's dirty paper coding to two-way channels, deriving the capacity region for Gaussian TWCs with interference.

Findings

Capacity region equals interference-free capacity in Gaussian TWC

Achievable rate region derived for discrete memoryless TWC

Two-way dirty paper coding effectively cancels interference

Abstract

In this paper, the Two-Way Channel (TWC) with Cannel State Information (CSI) is investigated. First, an achievable rate region is derived for the discrete memoryless channel. Then by extending the result to the Gaussian TWC with additive interference noise, it is shown that the capacity region of the later channel is the same as the capacity when there is no interference, i.e. a two-way version of Costa's writing on dirty paper problem is established.