A proof of the log-concavity conjecture related to the computation of the ergodic capacity of MIMO channels

Details A proof of the log-concavity conjecture related to the computation of the ergodic capacity of MIMO channels A proof of the log-concavity conjecture related to the computation of the ergodic capacity of MIMO channels

2009-11-03

arxiv.org/abs/0911.0696v1

Computer Science

Information Theory

6 pages, a proof of a conjecture posed in arXiv:0903.1952. We used techniques, developed in arXiv:0711.3496

Scientific paper

An upper bound on the ergodic capacity of {\bf MIMO} channels was introduced recently in arXiv:0903.1952. This upper bound amounts to the maximization on the simplex of some multilinear polynomial $p(\lambda_1,...,\lambda_n)$ with non-negative coefficients. Interestingly, the coefficients are subpermanents of some non-negative matrix. In general, such maximizations problems are {\bf NP-HARD}. But if say, the functional $\log(p)$ is concave on the simplex and can be efficiently evaluated, then the maximization can also be done efficiently. Such log-concavity was conjectured in arXiv:0903.1952. We give in this paper self-contained proof of the conjecture, based on the theory of {\bf H-Stable} polynomials.

Affiliated with

Also associated with

No associations

Rating

A proof of the log-concavity conjecture related to the computation of the ergodic capacity of MIMO channels does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A proof of the log-concavity conjecture related to the computation of the ergodic capacity of MIMO channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A proof of the log-concavity conjecture related to the computation of the ergodic capacity of MIMO channels will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-619000