DocumentCode :
640345
Title :
Capacity of compound MIMO Gaussian channels with additive uncertainty
Author :
Yin Sun ; Koksal, Can Emre ; Shroff, Ness B.
Author_Institution :
Dept. of ECE, Ohio State Univ., Columbus, OH, USA
fYear :
2013
fDate :
7-12 July 2013
Firstpage :
2686
Lastpage :
2690
Abstract :
This paper considers reliable communications over a multiple-input multiple-output (MIMO) Gaussian channel, where the channel matrix is within a bounded channel uncertainty region around a nominal channel matrix, i.e., an instance of the compound MIMO Gaussian channel. We study the optimal transmit covariance design to achieve the capacity of compound MIMO Gaussian channels, where the channel uncertainty region is characterized by the spectral norm. This design problem is a challenging non-convex optimization problem. However, in this paper, we reveal that this design problem has a hidden convexity property, and hence it can be simplified as a convex optimization problem. Towards this goal, we first prove that the optimal transmit design is to diagonalize the nominal channel, and then show that the duality gap between the capacity of the compound MIMO Gaussian channel and the minimal channel capacity is zero, which proves the conjecture of Loyka and Charalambous (IEEE Trans. Inf. Theory, vol. 58, no. 4, pp. 2048-2063, 2012). The key tools for showing these results are a novel matrix determinant inequality and some unitarily invariant properties.
Keywords :
Gaussian channels; MIMO communication; concave programming; convex programming; determinants; matrix algebra; telecommunication network reliability; additive uncertainty; bounded channel uncertainty; communication reliability; compound MIMO Gaussian channels; convex optimization problem; duality gap; hidden convexity property; matrix determinant inequality; minimal channel capacity; multiple-input multiple-output channel; nominal channel matrix; nonconvex optimization problem; optimal transmit covariance design; unitarily invariant properties; Compounds; Covariance matrices; Linear matrix inequalities; MIMO; Optimization; Uncertainty; Vectors;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory Proceedings (ISIT), 2013 IEEE International Symposium on
Conference_Location :
Istanbul
ISSN :
2157-8095
Type :
conf
DOI :
10.1109/ISIT.2013.6620714
Filename :
6620714
Link To Document :
بازگشت