By Topic

A general covariance-based optimization framework using orthogonal projections

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Raphael Hunger ; Associate Institute for Signal Processing, Technische Universität München, 80290 Munich, Germany ; David A. Schmidt ; Michael Joham ; Wolfgang Utschick

We present a general framework for the minimization of a function which is parametrized by a set of covariance matrices over a constraint set. Since all covariance matrices have to obey the property of being positive semidefinite, this characteristic has to be reflected in the constraint set. In addition, the sum of all traces of the covariance matrices shall be upper bounded. Using a preconditioned gradient descent algorithm, we derive an orthogonal projection onto this constraint set in an easy to follow monolithic way such that it directly results from the definition of the projection. Interestingly, this projection allows for a descriptive water-spilling interpretation in the style of the well-known water-filling algorithm. Two possible applications are investigated: the sum mean-square-error minimization and the weighted sum-rate maximization for the MIMO broadcast channel. Simulations finally reveal the excellent performance of the proposed framework.

Published in:

2008 IEEE 9th Workshop on Signal Processing Advances in Wireless Communications

Date of Conference:

6-9 July 2008