Optimal Symbol-by-Symbol Costa Precoding for a Relay-Aided Downlink Channel
In this paper, the authors consider practical approaches to Costa pre-coding (also known as dirty paper coding). Specifically, they propose a symbol-by-symbol scheme for cancellation of interference known at the transmitter in a relay-aided downlink channel. For finite-alphabet signaling and interference, they derive the optimal (in terms of maximum mutual information) modulator under a given power constraint. A sub-optimal modulator is also proposed by formulating an optimization problem that maximizes the minimum distance of the signal constellation, and this non-convex optimization problem is approximately solved by semi-definite relaxation. For the case of binary signaling with binary interference, they obtain a closed-form solution for the sub-optimal modulator, which only suffers little performance degradation compared to the optimal modulator in the region of interest.