Correlated MIMO wireless channels: capacity, optimal signaling, and asymptotics
The capacity of the multiple-input multiple-output (MIMO) wireless channel with uniform linear arrays (ULAs) of antennas at the transmitter and receiver is investigated. It is assumed that the receiver knows the channel perfectly but that the transmitter knows only the channel statistics. The analys...
Uložené v:
| Vydané v: | IEEE transactions on information theory Ročník 51; číslo 6; s. 2058 - 2072 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
New York, NY
IEEE
01.06.2005
Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Predmet: | |
| ISSN: | 0018-9448, 1557-9654 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Shrnutí: | The capacity of the multiple-input multiple-output (MIMO) wireless channel with uniform linear arrays (ULAs) of antennas at the transmitter and receiver is investigated. It is assumed that the receiver knows the channel perfectly but that the transmitter knows only the channel statistics. The analysis is carried out using an equivalent virtual representation of the channel that is obtained via a spatial discrete Fourier transform. A key property of the virtual representation that is exploited is that the components of virtual channel matrix are approximately independent. With this approximation, the virtual representation allows for a general capacity analysis without the common simplifying assumptions of Gaussian statistics and product-form correlation (Kronecker model) for the channel matrix elements. A deterministic line-of-sight (LOS) component in the channel is also easily incorporated in much of the analysis. It is shown that in the virtual domain, the capacity-achieving input vector consists of independent zero-mean proper-complex Gaussian entries, whose variances can be computed numerically using standard convex programming algorithms based on the channel statistics. Furthermore, in the asymptotic regime of low signal-to-noise ratio (SNR), it is shown that beamforming along one virtual transmit angle is asymptotically optimal. Necessary and sufficient conditions for the optimality of beamforming, and the value of the corresponding optimal virtual angle, are also derived based on only the second moments of the virtual channel coefficients. Numerical results indicate that beamforming may be close to optimum even at moderate values of SNR for sparse scattering environments. Finally, the capacity is investigated in the asymptotic regime where the numbers of receive and transmit antennas go to infinity, with their ratio being kept constant. Using a result of Girko, an expression for the asymptotic capacity scaling with the number of antennas is obtained in terms |
|---|---|
| Bibliografia: | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-2 content type line 23 |
| ISSN: | 0018-9448 1557-9654 |
| DOI: | 10.1109/TIT.2005.847724 |