Bounds and lattice-based transmission strategies for the phase-faded dirty-paper channel
- 21 July 2009
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 8 (7) , 3620-3627
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.Keywords
This publication has 17 references indexed in Scilit:
- On robust dirty paper coding2008
- The Capacity Region of the Degraded MIMO Compound Broadcast Channel2007
- Carbon Copying Onto Dirty PaperIEEE Transactions on Information Theory, 2007
- The Capacity Region of the Gaussian Multiple-Input Multiple-Output Broadcast ChannelIEEE Transactions on Information Theory, 2006
- Achievable rates in cognitive radio channelsIEEE Transactions on Information Theory, 2006
- On compound channels with side information at the transmitterIEEE Transactions on Information Theory, 2006
- The Gaussian watermarking gameIEEE Transactions on Information Theory, 2002
- Nested linear/lattice codes for structured multiterminal binningIEEE Transactions on Information Theory, 2002
- On lattice quantization noiseIEEE Transactions on Information Theory, 1996
- Coset codes. I. Introduction and geometrical classificationIEEE Transactions on Information Theory, 1988