PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
August 29, 2006IEEE Transactions on Information Theory60 citations

On the Achievable Sum Rate for MIMO Interference Channels

View Full Paper
XSXiaobang ShangBCB. ChenMGM.J. Gans

Key Points

Key points are not available for this paper at this time.

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

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Shang et al. (2006) studied this question.

synapsesocial.com/papers/6a181cbad990e918e6b4e9c2https://doi.org/10.1109/tit.2006.880051
Ask AI
Helpful
Bookmark
Share
View Full Paper

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1On the capacity of vector Gaussian interference channels2005 · 99 citations
  2. 2On Achievable Rate Regions for the Gaussian Interference Channel2004 · 303 citations
  3. 3A new achievable rate region for the interference channel1981 · 1,693 citations
  4. 4The capacity of the Gaussian interference channel under strong interference (Corresp.)1981 · 674 citations
  5. 5On the Gaussian interference channel1985 · 347 citations