On the achievable sum rate for MIMO interference channels

Xiaohu Shang, Biao Chen, Michael J. Gans

Research output: Contribution to journalArticlepeer-review

42 Scopus citations

Abstract

In this correspondence, we study some information theoretical characteristics of vector Gaussian interference channels. Resorting to the superposition code technique, a lower bound of the sum capacity for the vector Gaussian interference channel is obtained. Alternatively, orthogonal transmission via frequency division multiplexing is considered and we establish the concavity of sum rate as the bandwidth allocation factor for the vector channel case. Numerical examples indicate that the achievable sum rate via the superposition code compares favorably with orthogonal transmission: the lower bound obtained via the superposition code dominates the best achievable sum rate through orthogonal transmission. This improvement holds for all interference power levels, a sharp contrast to that of the scalar counterpart.

Original languageEnglish (US)
Pages (from-to)4313-4320
Number of pages8
JournalIEEE Transactions on Information Theory
Volume52
Issue number9
DOIs
StatePublished - Sep 1 2006

Keywords

  • Multiple-input-multiple-output (MIMO) communications
  • Sum capacity
  • Vector Gaussian interference channels

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Fingerprint Dive into the research topics of 'On the achievable sum rate for MIMO interference channels'. Together they form a unique fingerprint.

Cite this