### On the Symmetries and the Capacity Achieving Input Covariance Matrices of Multiantenna Channels

**2016-01-30**

1602.00043 | cs.IT

In this paper we study the capacity achieving input covariance matrices of a
single user multiantenna channel based solely on the group of symmetries of its
matrix of propagation coefficients. Our main result, which unifies and improves
the techniques used in a variety of classical capacity theorems, uses the Haar
(uniform) measure on the group of symmetries to establish the existence of a
capacity achieving input covariance matrix in a very particular subset of the
covariance matrices. This result allows us to provide simple proofs for old and
new capacity theorems. Among other results, we show that for channels with two
or more standard symmetries, the isotropic input is optimal. Overall, this
paper provides a precise explanation of why the capacity achieving input
covariance matrices of a channel depend more on the symmetries of the matrix of
propagation coefficients than any other distributional assumption.

**Login to like/save this paper, take notes and configure your recommendations**

# Related Articles

**2019-05-13**

1905.05094 | math.RA

We study orthogonal decompositions of symmetric and ordinary tensors using
methods from linear algeb… show more

**2019-03-17**

1903.07140 | cs.IT

We prove stability estimates for the Shannon-Stam inequality (also known as
the entropy-power inequa… show more

**2019-04-05**

1904.03213 | cs.DS

We present a spectral analysis for matrix scaling and operator scaling. We
prove that if the input m… show more

**2019-02-22**

1902.08428 | math.PR

It is known that the empirical spectral distribution of random matrices
obtained from linear codes o… show more

**2018-11-12**

1811.04734 | cs.IT

Shannon's mutual information of a random multiple antenna and multipath
channel is studied in the ge… show more

**2019-04-12**

1904.06012 | math.NA

We study the Lanczos algorithm where the initial vector is sampled uniformly
from $\mathbb{S}^{n-1}$… show more

**2018-06-21**

1806.08098 | cs.SY

Studying the stability of the Kalman filter whose measurements are randomly
lost has been an active … show more

**2018-09-03**

1809.00459 | cs.IT

We consider discrete linear time invariant (LTI) channels satisfying the
phase independence (PI) ass… show more

**2015-09-10**

1509.03258 | math.PR

We consider high dimensional Wishart matrices $\mathbb{X} \mathbb{X}^{\top}$
where the entries of $\… show more

**2019-01-08**

1901.02536 | cs.DS

For any finite group $G$, we give an arithmetic algorithm to compute
generalized Discrete Fourier Tr… show more

**2015-10-07**

1510.01844 | cs.IT

Data processing inequalities for $f$-divergences can be sharpened using
constants called "contractio… show more

**2019-02-19**

The concept of matrix rigidity was first introduced by Valiant in [Val77].
Roughly speaking, a matri… show more

**2018-01-09**

1801.02876 | cs.IT

Fano's inequality is one of the most elementary, ubiquitous and important
tools in information theor… show more

**2018-10-06**

1810.02954 | math.ST

We consider the problem of estimating an unknown matrix $\boldsymbol{X}\in
{\mathbb R}^{m\times n}$,… show more

**2019-01-31**

1901.11374 | math.PR

The problems discussed in this paper are motivated by the ratio consensus
problem formulated and sol… show more

**2018-08-28**

1808.09129 | cs.IT

In this paper we consider a new normalization of matrices obtained by
choosing distinct codewords at… show more

**2014-10-09**

1410.2470 | cs.DS

The Johnson-Lindenstrauss property ({\sf JLP}) of random matrices has immense
application in compute… show more