# Constant Envelope Signaling in MIMO Channels

@article{Rassouli2016ConstantES, title={Constant Envelope Signaling in MIMO Channels}, author={Borzoo Rassouli and Bruno Clerckx}, journal={ArXiv}, year={2016}, volume={abs/1605.03779} }

The capacity of the point-to-point vector Gaussian channel under the peak power constraint is not known in general. This paper considers a simpler scenario in which the input signal vector is forced to have a constant envelope (or norm). The capacity-achieving distribution for the non-identity $2\times 2$ MIMO channel when the input vector lies on a circle in $\mathbb{R}^2$ is obtained and is shown to have a finite number of mass points on the circle. Subsequently, it is shown that the degrees…

## References

SHOWING 1-10 OF 14 REFERENCES

### On the capacity of vector Gaussian channels with bounded inputs

- Computer Science2015 IEEE International Conference on Communications (ICC)
- 2015

It will be observed that in a discrete-time memoryless Gaussian channel, the average power constrained capacity, which results from a Gaussian input distribution, can be closely obtained by an input where the support of its magnitude is a discrete finite set.

### Capacity-Achieving Distributions in Gaussian Multiple Access Channel With Peak Power Constraints

- Computer ScienceIEEE Transactions on Information Theory
- 2014

The largest achievable sum-rate by orthogonal code division (OCD) is characterized where it is shown that Walsh-Hadamard spreading codes of length 2 are optimal and it is demonstrated that there are values for the maximum peak power at the transmitters such that OCD can not achieve any of the sum- rate-optimal points on the boundary of the capacity region.

### The noncoherent rician fading Channel-part I: structure of the capacity-achieving input

- Computer ScienceIEEE Transactions on Wireless Communications
- 2005

It is proven that the optimal input amplitude distribution has bounded support over the entire signal-to-noise ratio (SNR) range when there is only a peak-power constraint.

### On the capacity-achieving distribution of the discrete-time noncoherent and partially coherent AWGN channels

- Computer ScienceIEEE Transactions on Information Theory
- 2004

The communication limits over rapid phase-varying channels are investigated and the capacity of a discrete- time noncoherent additive white Gaussian noise (NCAWGN) channel under the average power constraint is considered.

### Using Hermite Bases in Studying Capacity-Achieving Distributions Over AWGN Channels

- Computer ScienceIEEE Transactions on Information Theory
- 2012

This paper studies classes of generic deterministic, discrete time, memoryless, and “nonlinear” additive white Gaussian noise (AWGN) channels, and novel results regarding the output rate of decay of Gaussian channels are derived.

### The capacity of discrete-time memoryless Rayleigh-fading channels

- Computer ScienceIEEE Trans. Inf. Theory
- 2001

The capacity-achieving distribution of a discrete-time Rayleigh fading channel, in which successive symbols face independent fading, and where neither the transmitter nor the receiver has channel state information is studied.

### The Information Capacity of Amplitude- and Variance-Constrained Scalar Gaussian Channels

- Computer ScienceInf. Control.
- 1971

### The capacity of average and peak-power-limited quadrature Gaussian channels

- Computer ScienceIEEE Trans. Inf. Theory
- 1995

The capacity C(/spl rho//sub a/) of the discrete-time quadrature additive Gaussian channel (QAGC) with inputs subjected to (normalized) average and peak power constraints, provides an improved ultimate upper bound on the reliable information rates transmitted over the QAGC with any communication systems subjected to bothaverage and peak-power limitations.

### Bounds on communication with polyphase coding

- Computer Science
- 1966

The theoretical capabilities of a “polyphase” coding-modulation scheme with additive white Gaussian noise with additiveWhiteGaussian noise are studied and the channel capacity is found and the error exponent estimated.

### On the discreteness of capacity-achieving distributions

- Computer ScienceIEEE Transactions on Information Theory
- 2004

By extending Smith's (1969) argument, a sufficient condition on noise probability density functions is derived that guarantees finite support for the associated capacity-achieving distribution(s) of a scalar additive channel.