Multiuser diversity for a dirty paper approach

11 August 2003

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters

Vol. 7 (8) , 370-372
https://doi.org/10.1109/lcomm.2003.815652

Abstract

Multiuser diversity has attracted significant attention recently. In this letter, we propose a greedy algorithm based on QR decomposition of the channel and dirty paper precoding to exploit the multiuser diversity of the Gaussian vector broadcast channel. Simulations show the approach provides performance which is extremely close to a well-known upper bound on the sum rate. Further, exploiting multiuser diversity can provide large gain over approaches ignoring this resource.

Keywords

This publication has 8 references indexed in Scilit:

Capacity and Lattice Strategies for Canceling Known Interference
IEEE Transactions on Information Theory, 2005
On the capacity of multiple input multiple output broadcast channels
Published by Institute of Electrical and Electronics Engineers (IEEE) ,2003
On the achievable throughput of a multiantenna Gaussian broadcast channel
IEEE Transactions on Information Theory, 2003
Elements of Information Theory
Published by Wiley ,2001
Capacity of Multi‐antenna Gaussian Channels
European Transactions on Telecommunications, 1999
On Limits of Wireless Communications in a Fading Environment when Using Multiple Antennas
Wireless Personal Communications, 1998
Writing on dirty paper (Corresp.)
IEEE Transactions on Information Theory, 1983
An outer bound to the capacity region of broadcast channels (Corresp.)
IEEE Transactions on Information Theory, 1978