kth.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Robust MIMO precoding for several classes of channel uncertainty
KTH, School of Electrical Engineering (EES), Signal Processing. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0002-3599-5584
KTH, School of Electrical Engineering (EES), Signal Processing. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre. Interdisciplinary Centre for Security, Reliability and Trust (SnT), University of Luxembourg, Luxembourg-Kirchberg L-1359, Luxembourg.ORCID iD: 0000-0003-2298-6774
2013 (English)In: IEEE Transactions on Signal Processing, ISSN 1053-587X, E-ISSN 1941-0476, Vol. 61, no 12, p. 3056-3070Article in journal (Refereed) Published
Abstract [en]

The full potential of multi-input multi-output (MIMO) communication systems relies on exploiting channel state information at the transmitter (CSIT), which is, however, often subject to some uncertainty. In this paper, following the worst-case robust philosophy, we consider a robust MIMO precoding design with deterministic imperfect CSIT, formulated as a maximin problem, to maximize the worst-case received signal-to-noise ratio or minimize the worst-case error probability. Given different types of imperfect CSIT in practice, a unified framework is lacking in the literature to tackle various channel uncertainty. In this paper, we address this open problem by considering several classes of uncertainty sets that include most deterministic imperfect CSIT as special cases. We show that, for general convex uncertainty sets, the robust precoder, as the solution to the maximin problem, can be efficiently computed by solving a single convex optimization problem. Furthermore, when it comes to unitarily-invariant convex uncertainty sets, we prove the optimality of a channel-diagonalizing structure and simplify the complex-matrix problem to a real-vector power allocation problem, which is then analytically solved in a waterfilling manner. Finally, for uncertainty sets defined by a generic matrix norm, called the Schatten norm, we provide a fully closed-form solution to the robust precoding design, based on which the robustness of beamforming and uniform-power transmission is investigated.

Place, publisher, year, edition, pages
2013. Vol. 61, no 12, p. 3056-3070
Keywords [en]
Convex uncertainty set, imperfect CSIT, maximin, MIMO, minimax, saddle point, Schatten norm, unitarily-invariant uncertainty set, worst-case robustness
National Category
Signal Processing
Identifiers
URN: urn:nbn:se:kth:diva-134266DOI: 10.1109/TSP.2013.2258016ISI: 000320135200004Scopus ID: 2-s2.0-84878291145OAI: oai:DiVA.org:kth-134266DiVA, id: diva2:666218
Funder
EU, European Research Council, 228044
Note

QC 20131121

Available from: 2013-11-22 Created: 2013-11-20 Last updated: 2022-06-23Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Bengtsson, MatsOttersten, Björn

Search in DiVA

By author/editor
Bengtsson, MatsOttersten, Björn
By organisation
Signal ProcessingACCESS Linnaeus Centre
In the same journal
IEEE Transactions on Signal Processing
Signal Processing

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 159 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf