Bounds and lattice-based transmission strategies for the phase-faded dirty-paper channel

Authors:
Amir Bennatan;Vaneet Aggarwal;Yiyue Wu;A. Robert Calderbank;Jakob Hoydis;Aik Chindapol
Affiliations:
Applied and Computational Mathematics, Princeton University, Princeton, NJ;Department of Electrical Engineering, Princeton University, Princeton, NJ;Department of Electrical Engineering, Princeton University, Princeton, NJ;Department of Electrical Engineering, Princeton University, Princeton, NJ;SUPELEC, Gif Sur Yvette Cedex, France;Nokia Siemens Networks, Herndon, VA
Venue:
IEEE Transactions on Wireless Communications
Year:
2009

Citing 12
Cited 1

On lattice quantization noise

IEEE Transactions on Information Theory
Nested linear/lattice codes for structured multiterminal binning

IEEE Transactions on Information Theory
The Gaussian watermarking game

IEEE Transactions on Information Theory
On the achievable throughput of a multiantenna Gaussian broadcast channel

IEEE Transactions on Information Theory
A close-to-capacity dirty paper coding scheme

IEEE Transactions on Information Theory
Capacity and lattice strategies for canceling known interference

IEEE Transactions on Information Theory
Design and analysis of nonbinary LDPC codes for arbitrary discrete-memoryless channels

IEEE Transactions on Information Theory
On compound channels with side information at the transmitter

IEEE Transactions on Information Theory
Achievable rates in cognitive radio channels

IEEE Transactions on Information Theory
The Capacity Region of the Gaussian Multiple-Input Multiple-Output Broadcast Channel

IEEE Transactions on Information Theory
Carbon Copying Onto Dirty Paper

IEEE Transactions on Information Theory
On the Fading-Paper Achievable Region of the Fading MIMO Broadcast Channel

IEEE Transactions on Information Theory

On the robustness of dirty paper coding

IEEE Transactions on Communications

Quantified Score

Hi-index	0.01

Visualization

Abstract

We consider a fading version of the dirty-paper problem, as proposed by Grover and Sahai. In this formulation, the various signals involved are complex-valued, and the interference (known only to the transmitter) is multiplied by a random complex-valued coefficient, whose phase is known only to the receiver. We focus on a compound channel formulation, and seek to maximize the worst-case performance. We present an achievable strategy modeled on the lattice-based approach of Erez, Shamai and Zamir and propose heuristic methods to optimize its parameters. We also derive an upper bound on the maximum achievable transmission rates. Our bounds are shown to be tight in some settings, yielding a complete characterization of capacity. We also provide simulation results, indicating the practical effectiveness of our approaches.