Linear precoding in multiple antenna broadcast channels: Efficient computation of the achievable rate region
- 1 February 2008
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
This paper studies the achievable rate region of the two-user multiple antenna broadcast channel with linear precoding. It consists of two parts: In the first part, the set of beam- forming vectors which achieve points on the Pareto boundary are characterized by a single real valued parameter per user. It is shown that a certain linear combination of the zero-forcing (ZF) beamforming vector and the maximum- ratio-transmission (MRT) beamforming vector can achieve all Pareto boundary points of the rate region. In the second part, an iterative algorithm is proposed to compute the maximum sum-rate. Based on the characterization of the Pareto boundary, we develop an outer approximation algorithm for monotonic optimization using polyblocks. Numerical examples provide comparisons between rate and capacity regions as well as between the maximum sum-rate and maximum- capacity operating points.Keywords
This publication has 15 references indexed in Scilit:
- Competition Versus Cooperation on the MISO Interference ChannelIEEE Journal on Selected Areas in Communications, 2008
- The MISO interference channel from a game-theoretic perspective: A combination of selfishness and altruism achieves pareto optimalityInternational Conference on Acoustics, Speech, and Signal Processing (ICASSP), 2008
- Precoding for Multiple Antenna Gaussian Broadcast Channels With Successive Zero-ForcingIEEE Transactions on Signal Processing, 2007
- Optimization-Theoretic Analysis of Stability-Optimal Transmission Policy for Multiple-Antenna Multiple-Access ChannelIEEE Transactions on Signal Processing, 2007
- Precoding Schemes for the MIMO-GBCPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- Precoding in Multiantenna and Multiuser CommunicationsIEEE Transactions on Wireless Communications, 2004
- Zero-Forcing Methods for Downlink Spatial Multiplexing in Multiuser MIMO ChannelsIEEE Transactions on Signal Processing, 2004
- An alogrithm for monotonic global optimization problems∗Optimization, 2001
- Monotonic Optimization: Problems and Solution ApproachesSIAM Journal on Optimization, 2000
- Matrix AnalysisPublished by Cambridge University Press (CUP) ,1985