Finding NEMO: near mutually orthogonal sets and applications to MIMO broadcast scheduling

We define a near-orthogonal set of channel vectors as one that meets certain SIR and SNR guarantees. The probability of finding a near-orthogonal set in a pool of n users is characterized. We identify a phase transition phenomenon in channel geometry whereby this probability transitions from 0 to 1 as k, the number of users that have been examined, increases. It is shown that after this transition the probability of failing to find such a set behaves like /spl theta/(k/sup -m/). The rate at which SNR and SIR can be scaled while we remain above this threshold is also characterized. The existence results we provide are not specific to the MIMO scheduling problem, but apply to the more general setting of finding a near-orthogonal set in a random collection of isotropic vectors. The proofs make use of new tight bounds we develop to bound the surface content of spherical caps in arbitrary dimensions. Broader implications of these results are discussed. Specifically, in the case of zero-forcing the best sum rate achievable increases at a rate on the order of log log n.

[1]  C. Shannon.  Probability of error for optimal codes in a Gaussian channel , 1959 .

[2]  Horst Alzer,et al.  On some inequalities for the incomplete gamma function , 1997, Math. Comput..

[3]  Emre Telatar,et al.  Capacity of Multi-antenna Gaussian Channels , 1999, Eur. Trans. Telecommun..

[4]  Svante Janson,et al.  Random graphs , 2000, Wiley-Interscience series in discrete mathematics and optimization.

[5]  Robert W. Heath,et al.  Spatially greedy scheduling in multi-user MIMO wireless systems , 2003, The Thrity-Seventh Asilomar Conference on Signals, Systems & Computers, 2003.

[6]  D. Aktas,et al.  Multiuser scheduling for multiple antenna systems , 2003, 2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003) (Cat. No.03CH37490).

[7]  Svante Janson,et al.  Large deviations for sums of partly dependent random variables , 2004, Random Struct. Algorithms.

[8]  E. Uysal-Biyikoglu,et al.  Low Complexity Multiuser Scheduling for Maximizing Throughput in the MIMO Broadcast Channel , 2004 .

[9]  Svante Janson,et al.  Large deviations for sums of partly dependent random variables , 2004 .

[10]  Amir K. Khandani,et al.  An Efficient Signaling Method over MIMO Broadcast Channels , 2004 .

[11]  Aylin Yener,et al.  Time-Slotted Multiuser MIMO Systems: Beamforming and Scheduling Strategies , 2004, EURASIP J. Wirel. Commun. Netw..

[12]  A. Yener,et al.  Beamforming and scheduling strategies for time slotted multiuser MIMO systems , 2004, Conference Record of the Thirty-Eighth Asilomar Conference on Signals, Systems and Computers, 2004..

[13]  Thomas L. Marzetta,et al.  Multiple-antenna channel hardening and its implications for rate feedback and scheduling , 2004, IEEE Transactions on Information Theory.

[14]  Pedro Fernandes,et al.  Effects of multi user MIMO scheduling freedom on cellular downlink system throughput , 2004, IEEE 60th Vehicular Technology Conference, 2004. VTC2004-Fall. 2004.

[15]  Charles Swannack.  Throughput and Complexity Tradeoffs in the Multi-antenna Downlink , 2005 .

[16]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.