By Topic

Geometric characterization of capacity-constraint function

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

2 Author(s)
Nakagawa, K. ; NTT Transmission Syst. Lab., Kanagawa, Japan ; Kanaya, F.

Maximizing the mutual information under a linear input constraint is considered from a geometric point of view. Assuming a suitable regularity condition on the channel matrix, it is found that the probability distribution (PD) equidistant from the row PDs of the channel matrix plays an important role, and the maximum is achieved by the projection of that PD onto the set of PDs satisfying the constraint. The PD attaining the capacity-constraint function is obtained by using Lagrange's method of indeterminate coefficients at most (m-2) times

Published in:

Information Theory, IEEE Transactions on  (Volume:35 ,  Issue: 4 )