ACM Home Page
Please provide us with feedback. Feedback
On the throughput of opportunistic beamforming with imperfect CSI
Full text PdfPdf (322 KB)
Source
International Conference On Communications And Mobile Computing archive
Proceedings of the 2007 international conference on Wireless communications and mobile computing table of contents
Honolulu, Hawaii, USA
SESSION: Communication and information theory symposium: wireless communications table of contents
Pages: 19 - 23  
Year of Publication: 2007
ISBN:978-1-59593-695-0
Authors
Ali Vakili  California Institute of Technology (Caltech), Pasadena, CA
Amir F. Dana  California Institute of Technology (Caltech), Pasadena, CA
Babak Hassibi  California Institute of Technology (Caltech), Pasadena, CA
Sponsors
ACM: Association for Computing Machinery
SIGDOC : ACM Special Interest Group on Systems Documentation
SIGWEB: ACM Special Interest Group on Hypertext, Hypermedia, and Web
SIGAPP: ACM Special Interest Group on Applied Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 11,   Downloads (12 Months): 94,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1280940.1280945
What is a DOI?

ABSTRACT

The throughput of a multiple-antenna broadcast channel highly depends on the channel state information (CSI) at the transmitter side. However, due to the time variant nature of wireless channels, having perfect knowledge of the underlying links appears to be a questionable assumption, especially when the number of users and/or antennas increases. Although it can become computationally prohibitive in practice, theoretically any point on the capacity region of a Gaussian broadcast channel is achievable using dirty paper coding (DPC) if full CSI is available.

The aforementioned drawbacks of DPC have motivated the development of simpler transmission strategies that require little CSI and yetcan deliver a large portion of the capacity. One such scheme is opportunistic beam-forming that is shown to be able to achieve the same throughput scaling as that of DPC for the regime of large number of users. In this paper we investigate the performance of opportunistic beam-forming when the perfect channel state information is not available; i.e., the channel estimation is erroneous. We will show that in order to maximize the throughput (sum rate capacity), the transmitter needs to back off the rate than what is suggested by the estimated channel state. We obtain the optimal back off and show that by using this modified opportunistic scheme, the same multiuser gain can be achieved.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
M. Costa. Writing on dirty paper. IEEE Trans. Inform. Theory, 29(3):439--441, May 1983.
 
2
A. F. Dana, M. Sharif, and B. Hassibi. On the capacity region of multi-antenna Gaussian broadcast channels with estimation error. In Proc. of ISIT, July, 2006.
 
3
B. Hassibi and B. M. Hochwald. How much training is needed in a multiple-antenna wireless link? IEEE Trans. on Information Theory, 48(5):1118--1134, May 2003.
 
4
T. Kailath, A. Sayed, and B. Hassibi. Linear Estimation. Prentice-Hall, 2000.
 
5
M. Kobayashi, G. Caire, and D. Gesbert. Antenna diversity vs. multiuser diversity: Quantifying the tradeoffs. In Proc. ISITA, October, 2004.
 
6
A. Lapidoth and S. Shamai. Fading channels: How perfect need "perfect side information" be? IEEE Trans. on Information Theory, 49(10):951--964, April 2002.
 
7
J. Ling, D. Chizhik, U. Tureli, and C. Papadias. Performance of linear prediction for wireless schedules downlink systems. In Proc. of ICC, June, 2006.
 
8
M. Medard. The effect upon channel capacity in wireless communications of perfect and imperfect knowledge of the channel. IEEE Trans. on Information Theory, 46(3):933--946, May 2000.
 
9
N. Merhav, G. Kaplan, A. Lapidoth, and S. Shamai. On information rates for mismatched decoders. IEEE Trans. on Information Theory, 40(6):1953--1967, November 1994.
 
10
J. D. Murray. Asymptotic Analysis. Springer, USA, 1992.
 
11
C. E. Shannon. Probability of error for optimal codes in a Gaussian channel. Bell Systems Technology Journal, 38:611--656, May 1959.
 
12
M. Sharif and B. Hassibi. On the capacity of MIMO broadcast channels with partial side information. IEEE Trans. Inform. Theory, 51(2):506--522, Feb. 2005.
 
13
 
14
N. T. Uzgoren. The asymptotic developement of the distribution of the extreme values of a sample. In Studies in Mathematics and Mechanics Presented to Richard von Mises. New York: Academic, 1954.
 
15
A. Vakili, A. F. Dana, and B. Hassibi. On the throughput of opportunistic beamforming with imperfect CSI. in preparation.
 
16
A. Vakili, A. F. Dana, M. Sharif, and B. Hassibi. Differentiated rate scheduling for MIMO Gaussian broadcast channels. In Proc. of 43'rd Annual Allerton Conf., 2005.
 
17
A. Vakili and B. Hassibi. On the throughput of broadcast channels with imperfect CSI. In Proc. of SPAWC, July, 2006.
 
18
H. Weingarten, Y. Steinberg, and S. S. (Shitz). The capacity region of the Gaussian MIMO broadcast channel. In Proc. of Conf. on Information Sciences and Systems, March, 2004.
 
19
T. Yoo and A. Goldsmith. Capacity and optimal power allocation for fading MIMO channels with channel estimation error. Submitted to IEEE Trans. on Information Theory, August 2002.
 
20
D. Zwillinger. Handbook of Integration. Jones and Bartlett Publishers. Inc., London, 1992.

Collaborative Colleagues:
Ali Vakili: colleagues
Amir F. Dana: colleagues
Babak Hassibi: colleagues