By Topic

Yet another entropy power inequality with an application

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
$31 $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

3 Author(s)
Payaró, M. ; Centre Tecnol. de Telecomunicacions de Catalunya (CTTC), Pare Mediterrani de la Tecnol., Barcelona, Spain ; Gregori, M. ; Palomar, D.

In this paper we derive a generalization of the vector entropy power inequality (EPI) recently put forth in [1], which was valid only for diagonal matrices, to the full matrix case. Next, we study the problem of computing the linear precoder that maximizes the mutual information in linear vector Gaussian channels with arbitrary inputs. In particular, we transform the precoder optimization problem into a new form and, capitalizing on the newly unveiled matrix EPI, we show that some particular instances of the optimization problem can be cast in convex form, i.e., we can have an optimality certificate, which, to the best of our knowledge, had never been obtained previously.

Published in:

Wireless Communications and Signal Processing (WCSP), 2011 International Conference on

Date of Conference:

9-11 Nov. 2011