Abstract
In this letter, a closed form expression of the sum rate upperbound is derived for random beamforming. The proposed analytic solution provides a good approximation of the 'actual' sum rate performance, for which the conventional asymptotic analysis is less meaningful. Moreover, our result leads to an implication of the asymptotic growth rate of M log log K.
| Original language | English |
|---|---|
| Pages (from-to) | 365-367 |
| Number of pages | 3 |
| Journal | IEEE Communications Letters |
| Volume | 12 |
| Issue number | 5 |
| DOIs | |
| Publication status | Published - 2008 May 1 |
All Science Journal Classification (ASJC) codes
- Modelling and Simulation
- Computer Science Applications
- Electrical and Electronic Engineering
Fingerprint Dive into the research topics of 'A closed form approximation of the sum rate upperbound of random beamforming'. Together they form a unique fingerprint.
Cite this
Kim, Y., Yang, J., & Kim, D. K. (2008). A closed form approximation of the sum rate upperbound of random beamforming. IEEE Communications Letters, 12(5), 365-367. https://doi.org/10.1109/LCOMM.2008.080150