Article

Simplified Fair Scheduling and Antenna Selection Algorithms for Multiuser MIMO Orthogonal Space-Division Multiplexing Downlink

Dept. of Electr. & Comput. Eng., Univ. of Alberta, Edmonton, AB
IEEE Transactions on Vehicular Technology (Impact Factor: 2.06). 04/2009; DOI: 10.1109/TVT.2008.925002
Source: IEEE Xplore

ABSTRACT We consider the downlink of a multiuser multiple-input multiple-output (MIMO) system, where the base station and the mobile receivers are equipped with multiple antennas. We propose simplified algorithms for channel-aware multiuser scheduling in conjunction with receive antenna selection for two downlink multiuser orthogonal space-division multiplexing techniques: block diagonalization and successive optimization. The algorithms greedily maximize the weighted sum rate. The algorithms add the best user at a time from the set of users that are not selected yet to the set of selected users until the desired number of users has been selected. To apply the proportional fairness criterion, simplified user scheduling metrics are proposed for block diagonalization and successive optimization. Two receive antenna selection algorithms are also proposed, which further enhance the power gain of the equivalent single-user channel after orthogonal precoding by selecting a subset of the receive antennas that contributes the most toward the total power gain of the channel. A user grouping technique is used to further lower the complexity of the selection algorithms. We compare various multiuser MIMO scheduling strategies that are applied to block diagonalization and successive optimization transmission techniques through simulation. Simulation results demonstrate the effectiveness of the proposed algorithms in ensuring throughput fairness among users. Results also show that when the number of users is large, the proposed scheduling algorithms perform close to the exhaustive search algorithms and previously proposed greedy scheduling algorithms, but with much lower complexity.

0 Bookmarks
 · 
70 Views
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper we propose a novel scheme to jointly determine the optimal transmit/receive beamformers together with multi-user power allocation towards transmission rate maximization in a cooperative MIMO cellular wireless network for unicast/multicast scenarios. For the unicast scenario, we propose a successive constrained eigenbeamforming (SCEB) technique to reduce the inter-user interference and enhance the data rates subject to power constraints. This scheme is further extended to a multicast scenario (SCEB-M) to maximize the sum rate of a user group with group constraints on the transmit power. We also derive optimal schemes to efficiently schedule a subset of users/ groups from the active user set. We employ a practical H.264 scalable video quality model to demonstrate the performance of the presented schemes in realistic video streaming broadband wireless networks. Simulation results show that the proposed SCEB schemes achieve a superior data rate and video quality in comparison to conventional resource allocation schemes in cooperative cellular scenarios.
    Multimedia and Expo (ICME), 2013 IEEE International Conference on; 01/2013
  • [Show abstract] [Hide abstract]
    ABSTRACT: Joint User and Antenna Selection (JUAS) with global optimal solution for multi-cell Multi-User Multiple Input Multiple Output (MU-MIMO) systems needs the centralized processing and full Channel State Information (CSI) sharing that both require high capacity backhaul links. In this paper, decentralized JUAS algorithm is considered for multi-cell MU-MIMO systems with Block Diagonalization (BD) precoding. First, by introducing the eigenvalue-based lower bound on the capacity, the global optimal problem of JUAS is reformulated to a new problem that can achieve local optimum. Second, a decentralized fairness-based algorithm is proposed to select the antenna subset with no CSI sharing. Simulation results demonstrate that the proposed algorithm outperforms existing algorithms, such as capacity-based antenna selection and interference-aware user selection, with the same computation complexity. Moreover, the performance losses compared to centralized JUAS with full CSI sharing are marginal.
    Personal Indoor and Mobile Radio Communications (PIMRC), 2012 IEEE 23rd International Symposium on; 01/2012
  • [Show abstract] [Hide abstract]
    ABSTRACT: With increased radio frequency (RF) chains, base station (BS) with multiple antennas consumes more circuit power. Turning off RF chains will help to save energy. However, in turn, it needs more sophisticated user scheduling. Therefore, an energy-efficient scheduling scheme is proposed with which users and RF chains are jointly selected at each frame. Here, Lyapunov driftplus-penalty ratio is used to policy design. If the average data arrival rates locate in the capacity region, it is proved that the proposed policy achieves the maximum energy efficiency than any other stationary, randomized, queue-independent policies, while ensuring the stability of the system. At each frame, the selection of users and RF chains depends on the number of selected users, sum queue length of them and energy efficiency they achieve. A key observation is that the numbers of selected users and RF chains should be equal under zero-forcing beamforming. Simulation results have shown that it even achieves higher energy efficiency than the Maximum Weighted Queue scheduling scheme when average arrival rate vector is relative small.
    Wireless Communications and Networking Conference (WCNC), 2013 IEEE; 01/2013