A closed form approximation of the sum rate upperbound of random beamforming

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.