On the achievable sum rate for MIMO interference channels

Xiaohu Shang; Biao Chen; Michael J. Gans

doi:10.1109/TIT.2006.880051

On the achievable sum rate for MIMO interference channels

Xiaohu Shang, Biao Chen, Michael J. Gans

Department of Electrical Engineering & Computer Science

Research output: Contribution to journal › Article › peer-review

44 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 language	English (US)
Pages (from-to)	4313-4320
Number of pages	8
Journal	IEEE Transactions on Information Theory
Volume	52
Issue number	9
DOIs	https://doi.org/10.1109/TIT.2006.880051
State	Published - Sep 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

Access to Document

10.1109/TIT.2006.880051

Cite this

@article{5258e534e07342b098f3e9cd8ef2ace0,

title = "On the achievable sum rate for MIMO interference channels",

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.",

keywords = "Multiple-input-multiple-output (MIMO) communications, Sum capacity, Vector Gaussian interference channels",

author = "Xiaohu Shang and Biao Chen and Gans, {Michael J.}",

note = "Funding Information: Manuscript received October 3, 2005; revised May 25, 2006. This work was supported in part by the National Science Foundation under Grant CCF-0546491, by the Air Force Office of Scientific Research under Grant FA9550-06-1-0051, and by a Syracuse University Graduate Fellowship. The material in this correspondence was presented in part at the IEEE International Symposium on Information Theory, Seattle, WA, July 2006.",

year = "2006",

month = sep,

doi = "10.1109/TIT.2006.880051",

language = "English (US)",

volume = "52",

pages = "4313--4320",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "9",

}

TY - JOUR

T1 - On the achievable sum rate for MIMO interference channels

AU - Shang, Xiaohu

AU - Chen, Biao

AU - Gans, Michael J.

N1 - Funding Information: Manuscript received October 3, 2005; revised May 25, 2006. This work was supported in part by the National Science Foundation under Grant CCF-0546491, by the Air Force Office of Scientific Research under Grant FA9550-06-1-0051, and by a Syracuse University Graduate Fellowship. The material in this correspondence was presented in part at the IEEE International Symposium on Information Theory, Seattle, WA, July 2006.

PY - 2006/9

Y1 - 2006/9

N2 - 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.

AB - 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.

KW - Multiple-input-multiple-output (MIMO) communications

KW - Sum capacity

KW - Vector Gaussian interference channels

UR - http://www.scopus.com/inward/record.url?scp=33748533487&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33748533487&partnerID=8YFLogxK

U2 - 10.1109/TIT.2006.880051

DO - 10.1109/TIT.2006.880051

M3 - Article

AN - SCOPUS:33748533487

SN - 0018-9448

VL - 52

SP - 4313

EP - 4320

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 9

ER -

On the achievable sum rate for MIMO interference channels

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this