Multiuser diversity for a dirty paper approach

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 wellknown upper bound on the sum rate. Further, exploiting multiuser diversity can provide large gain over approaches ignoring this resource.