1. Low Complexity User Selection Algorithms for Multiuser MIMO Systems with Block Diagonalization Zukang Shen, Runhua Chen, Jeff Andrews, Robert Heath, and Brian Evans The University of Texas at Austin Nov. 1, 2005

2. 2 Multi-Antenna Systems  Exploit the spatial dimension with multiple antennas  Improve transmission reliability – diversity  Combat channel fading [Jakes, 1974]  Combat co-channel interference [Winters, 1984]  Increase spectral efficiency – multiplexing  Multiple parallel spatial channels created with multiple antennas at the transmitter and receiver [Winters, 1987] [Foschini et al., 1998]  Theoretical results on point-to-point MIMO channel capacity [Telatar, 1999]  Tradeoff between diversity and multiplexing  A theoretical treatment [zheng et al., 2003]  Switching between diversity and multiplexing [Heath et al. 2005]

3. 3 Point-to-Point MIMO Systems  Narrowband system model  MIMO channel matrix  Rayleigh model, i.i.d. complex Gaussian  Ray-tracing models [Yu et al., 2002]

4. 4 Downlink Multiuser MIMO Systems  Downlink: a centralized basetation communicates to multiple users simultaneously  Both the basestation and users are equipped with multiple antennas  Questions: how to utilize the spatial dimension? What is the capacity limit?

5. 5 Capacity of MIMO Gaussian Broadcast Channels  Duality between MIMO Gaussian broadcast and multiple access channels [Vishwanath et al., 2003] [Viswanath et al., 2003]  Dirty paper coding [Costa 1983]  Sum capacity achieved with DPC [Vishwanath et al., 2003]  Iterative water-filling [Yu et al., 2004] [Jindal et al., 2005]  Capacity region of MIMO Gaussian broadcast channels [Weingarten et al., 2004]  Practical coding schemes approaching the DPC sum capacity [Zamir et al., 2002] [Airy et al., 2004] [Stojnic et al., 2004]  Too complicated for cost-effective implementations

6. 6 Block Diagonalization  BD is a Linear precoding technique  BD enforces zero inter-user interference [Spence et al., 2004] [Choi et al., 2004] [Wong et al., 2003] [Pan et al., 2004]  Effective point-to-point MIMO system

7. 7 Number of Simultaneously Supportable Users with BD  Assumptions  Number of transmit antennas  Number of receive antennas  Active users utilize all receive antennas  User channel information is known at Tx  Zero inter-user interference requires in the null space of  Dimension of :  Maximum # of simultaneous users:

8. 8 The Need for Low Complexity User Selection Algorithms  Select a subset of users to maximize the total throughput when  Exhaustive search  Optimal for total throughput  Computationally prohibitive  Two suboptimal user selection algorithms  Linear complexity in the number of users  Total throughput close to the optimal  Related work  Semi-orthogonal user set construction [Yoo et al., 2005]  Antenna selection [Gharavi-Alkhansari et al., 2004]

9. 9 Greedy User Selection Algorithms, apply BD to calculate the total channel energy Apply the C-algorithm to users selected Yes No Capacity Based (C-algorithm) Channel Frobenius Norm Based (N-algorithm), apply BD to calculate the sum capacity users selected or sum capacity decreases Yes No

10. 10 Computational Complexity  Critical matrix operations  Frobenius norm  Gram-Schmidt orthogonalization  Water-filling algorithm  Singular value decomposition  Proposed algorithms have complexity Average CPU run time (Pentium M 1.6G Hz PC)

11. 11 Monte Carlo Results

12. 12 Summary  Block diagonalization is a realizable linear precoding technique for downlink multiuser MIMO systems  User selection is necessary to exploit the multiuser diversity  Near-optimal low complexity user selection algorithms are desirable for implementations