dc.contributor.author | Loyka, S. | en |
dc.contributor.author | Charalambous, Charalambos D. | en |
dc.creator | Loyka, S. | en |
dc.creator | Charalambous, Charalambos D. | en |
dc.date.accessioned | 2019-04-08T07:47:04Z | |
dc.date.available | 2019-04-08T07:47:04Z | |
dc.date.issued | 2012 | |
dc.identifier.uri | http://gnosis.library.ucy.ac.cy/handle/7/44139 | |
dc.description.abstract | The compound capacity of uncertain multiple-input multiple-output channels is considered, when the channel is modeled by a class described by a (known) nominal channel and a constrained-norm (unknown) uncertainty. Within this framework, two types of classes are investigated with additive and multiplicative uncertainties subject to a spectral norm constraint, using the singular value decomposition and related singular value inequalities as the main tools. The compound capacity is a maxmin mutual information, representing the capacity of the class, in which the minimization is done over the class of channels while the maximization is done over the transmit covariance. Closed-form solutions for the compound capacity of the classes are obtained and several properties related to transmit and receive eigenvectors are presented. It is shown that, under certain conditions, the compound capacity of the class is equal to the worst-case channel capacity, thus establishing a saddle-point property. Explicit closed-form solutions are given for the worst-case channel uncertainty and the capacity-achieving transmit covariance matrix: the best transmission strategy achieving the compound capacity is a multiple beamforming on the nominal (known) channel eigenmodes with the beam power distribution via the water filling at a degraded SNR. As the uncertainty increases, fewer eigenmodes are used until only the strongest one remains active so that transmit beamforming is an optimal robust transmission strategy in this large-uncertainty regime, for which explicit conditions are given. Using these results, upper and lower bounds of the compound capacity are constructed for other bounded uncertainties and some generic properties are pointed out. The results are extended to compound multiple-access and broadcast channels. In all considered cases, the price to pay for channel uncertainty is an SNR loss (or, equivalently, the nominal channel degradation) commensurate with the uncertainty set radius measured by the spectral norm and the optimal signaling strategy is the transmission on the degraded nominal channel. © 2006 IEEE. | en |
dc.source | IEEE Transactions on Information Theory | en |
dc.source.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-84858951856&doi=10.1109%2fTIT.2011.2173727&partnerID=40&md5=697e9f875512a33cc4a683df3c41adf7 | |
dc.subject | Optimization | en |
dc.subject | Channel capacity | en |
dc.subject | Covariance matrix | en |
dc.subject | Mimo systems | en |
dc.subject | Channel uncertainties | en |
dc.subject | Channel uncertainty | en |
dc.subject | Compound channel | en |
dc.subject | Beamforming | en |
dc.subject | Broadcast channel (bc) | en |
dc.subject | Broadcast channels | en |
dc.subject | Broadcasting | en |
dc.subject | Multiple access channels | en |
dc.subject | Multiple-access channel (mac) | en |
dc.subject | Multiple-input multiple-output (mimo) capacity | en |
dc.subject | Multiple-input-multiple-output | en |
dc.subject | Optimum transmission | en |
dc.subject | Saddle point | en |
dc.subject | Singular value decomposition | en |
dc.title | On the compound capacity of a class of MIMO channels subject to normed uncertainty | en |
dc.type | info:eu-repo/semantics/article | |
dc.identifier.doi | 10.1109/TIT.2011.2173727 | |
dc.description.volume | 58 | |
dc.description.issue | 4 | |
dc.description.startingpage | 2048 | |
dc.description.endingpage | 2063 | |
dc.author.faculty | Πολυτεχνική Σχολή / Faculty of Engineering | |
dc.author.department | Τμήμα Ηλεκτρολόγων Μηχανικών και Μηχανικών Υπολογιστών / Department of Electrical and Computer Engineering | |
dc.type.uhtype | Article | en |
dc.source.abbreviation | IEEE Trans.Inf.Theory | en |
dc.contributor.orcid | Charalambous, Charalambos D. [0000-0002-2168-0231] | |
dc.gnosis.orcid | 0000-0002-2168-0231 | |