Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. 2005
DOI: 10.1109/isit.2005.1523441
|View full text |Cite
|
Sign up to set email alerts
|

The cost of uncorrelation and non-cooperation in MIMO channels

Abstract: We investigate the capacity loss for using uncorrelated Gaussian input over a multiple-input multiple-output (MIMO) linear additive-noise (not necessarily Gaussian) channel. We upper bound the capacity loss by a universal constant, C * , which is independent of the channel matrix and the noise distribution. For a single-user MIMO channel with n t inputs and n r outputs,transmit antenna per second per Hertz), under both total and per-input power constraints. If we restrict attention to (colored) Gaussian noise,… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2006
2006
2009
2009

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 31 publications
0
2
0
Order By: Relevance
“…Remark 1: It is easy to see that this scheme is optimal (i.e., it achieves the upper bound (5)) if C ≤ R N C (and thus in particular if P → ∞). Instead, when C > R N C , the rate achievable by this scheme does not achieve the upper bound (5), suffering from the performance penalty caused by independent encoding as compared to the waterfilling solution (3) [10].…”
Section: A Independent Messagesmentioning
confidence: 99%
See 1 more Smart Citation
“…Remark 1: It is easy to see that this scheme is optimal (i.e., it achieves the upper bound (5)) if C ≤ R N C (and thus in particular if P → ∞). Instead, when C > R N C , the rate achievable by this scheme does not achieve the upper bound (5), suffering from the performance penalty caused by independent encoding as compared to the waterfilling solution (3) [10].…”
Section: A Independent Messagesmentioning
confidence: 99%
“…Instead, when C > R N C , the rate achievable by this scheme does not achieve the upper bound (5), suffering from the performance penalty caused by independent encoding as compared to the waterfilling solution (3) [10].…”
Section: A Independent Messagesmentioning
confidence: 99%