Optimization of the MIMO compound capacity

Ami Wiesel*, Yonina C. Eldar, Shlomo Shamai

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

30 Scopus citations


In this paper, we consider the optimization of the compound capacity in a rank one Ricean multiple input multiple output channel using partial channel state information at the transmitter side. We model the channel as a deterministic matrix within a known ellipsoid, and address the compound capacity defined as the maximum worst case mutual information in the set. We find that the optimal transmit strategy is always beamforming, and can be found using a simple one dimensional search. Similar results are derived for the worst case sum-rate of a multiple access channel with individual power constraints and a total power constraint. In this multiuser setting we assume equal array response at the receiver for all users. These results motivate the growing use of systems using simple beamforming transmit strategies.

Original languageAmerican English
Pages (from-to)1094-1101
Number of pages8
JournalIEEE Transactions on Wireless Communications
Issue number3
StatePublished - Mar 2007
Externally publishedYes

Bibliographical note

Funding Information:
The authors are with the Technion, Israel Institute of Technology (email: amiw@tx.technion.ac.il, {yonina, sshlomo}@ee.technion.ac.il). The authors were supported by the EU 6th Framework Programme, via the NEWCOM Network of Excellence. This research was also supported by the Israel Science Foundation, founded by the Israel Academy of Sciences and Humanities. Conference versions of this paper were presented at the ITG-IEEE Workshop on Smart Antennas (WSA-2005) and the IEEE Workshop on Signal Processing Advances in Wireless Communications (SPAWC-2005). Digital Object Identifier 10.1109/TWC.2007.05381.


  • Beamforming
  • Compound capacity
  • MIMO


Dive into the research topics of 'Optimization of the MIMO compound capacity'. Together they form a unique fingerprint.

Cite this