Name
Abstract | ||
|---|---|---|
This paper calculates both an upper bound and a constructive lower bound on the capacity of an N transmitter, K receiver MIMO fading network. The channel between the transmitters and the receivers is Rayleigh flat fading with fading coefficients unknown to both transmitters and receivers. The lower bound is derived from a practicable successive decoding scheme, and when N is significantly larger than K, it approaches the upper bound with increasing coherence length of the fading process. Obviously, in the limit of large coherence lengths, the system becomes coherent and so is trivial. However, the lower and upper bounds of this paper are close to the MIMO capacity even when the system is highly non-coherent. For example, with N = 50, K = 15 and a coherence length of 200, the achievable rate of the successive decoding scheme diverges from the upper bound by just 6%, even when it is only 40% of coherent capacity. At this design point, the scheme achieves a rate of 13 bits/sec/Hz, significantly greater than any current cellular standards. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1109/ISIT.2006.261542 | 2006 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1-6, PROCEEDINGS |
Keywords | Field | DocType |
fading,transmitters,channel capacity,noise cancellation,upper bound,mimo,lower bound,interference cancellation,decoding | Topology,Discrete mathematics,Coherence length,Transmitter,Fading,Upper and lower bounds,Computer science,Control theory,MIMO,Decoding methods,Fading distribution,Channel capacity | Conference |
Citations | PageRank | References |
3 | 0.39 | 5 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ravi-Kiran Gopalan | 1 | 7 | 1.28 |
| Krishnan Padmanabhan | 2 | 305 | 33.55 |
| s ranganathan | 3 | 3 | 0.39 |
| Oliver M. Collins | 4 | 126 | 17.63 |