Sum-Capacity and MMSE for the MIMO Broadcast Channel without Eigenvalue Decompositions
- 1 June 2007
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 776-780
Abstract
In this paper, we present a novel algorithm for determining the sum-rate optimal transmit covariance matrices for the MIMO broadcast channel. Instead of optimizing the covariances directly, our algorithm operates on the preceding matrices, i.e., the square roots of the covariances. As a result, no eigenvalue decompositions are required in the iterations, and the complexity per iteration is significantly lower. A look at the convergence over the required number of computations shows a visible advantage over the state-of-the-art sum power iterative waterfilling algorithm. Also, our algorithm allows us to find the optimal sum-rate for an arbitrarily limited number of data streams per user. Finally, with a simple modification, our algorithm can also be used for sum-MSE minimization.Keywords
This publication has 8 references indexed in Scilit:
- Low-Complexity Iterative Algorithm for Finding the MIMO-OFDM Broadcast Channel Sum CapacityIEEE Transactions on Communications, 2007
- Sum-capacity computation for the Gaussian vector broadcast channel via dual decompositionIEEE Transactions on Information Theory, 2006
- Sum Power Iterative Water-Filling for Multi-Antenna Gaussian Broadcast ChannelsIEEE Transactions on Information Theory, 2005
- Sum Capacity of Gaussian Vector Broadcast ChannelsIEEE Transactions on Information Theory, 2004
- Convex Optimization2004
- Duality, achievable rates, and sum-rate capacity of gaussian mimo broadcast channelsIEEE Transactions on Information Theory, 2003
- Downlink capacity evaluation of cellular networks with known-interference cancellationIEEE Journal on Selected Areas in Communications, 2003
- Writing on dirty paper (Corresp.)IEEE Transactions on Information Theory, 1983