Abstract
We consider the problem of maximizing sum rate on a multiple-antenna downlink in which the base station and receivers have multiple-antennas. The optimum scheme for this system was recently found to be "dirty paper coding". Obtaining the optimal transmission policies of the users when employing this dirty paper coding scheme is a computationally complex non-convex problem. We use a "duality" to transform this problem into a convex multiple access problem, and then obtain a simple and fast iterative algorithm that gives us the optimum transmission policies.
Original language | English (US) |
---|---|
Pages (from-to) | 1518-1522 |
Number of pages | 5 |
Journal | Conference Record of the Asilomar Conference on Signals, Systems and Computers |
Volume | 2 |
State | Published - 2002 |
Externally published | Yes |
Event | The Thirty-Sixth Asilomar Conference on Signals Systems and Computers - Pacific Groove, CA, United States Duration: Nov 3 2002 → Nov 6 2002 |
All Science Journal Classification (ASJC) codes
- Signal Processing
- Computer Networks and Communications