Binary quadratic Mu-MIMO joint receive antenna selection and user scheduling

Multiuser Multiple-Input-Multiple-Output (MIMO) is a key physical layer technique in current and future wireless technologies which require high throughput, efficient resource usage, and effective multiple access. In this paper, a joint user scheduler and receive antenna selector based on Branch and Bound algorithm is proposed. The problem is formulated as a Mixed Binary Quadratic Programming problem. Branch and Bound method is used to derive a near-optimal, low complexity algorithm. The performance of the scheduler and antenna selector is assessed by simulations. The proposed algorithm is shown to result in sum rate performance near to that achieved by Exhaustive Search, and significantly outperforms Greedy Search with both better sum-rate and lower computational requirements.