Low complexity user scheduling algorithms for uplink multiuser MIMO systems

Two efficient and low complexity multiuser scheduling algorithms are proposed for the uplink multi- ple-input multiple-output systems in this paper. Conventionally, the exhaustive search algorithm （ESA） can give the optimal performance; however, it is complexity prohibitive for practical implementation. Aiming at re- ducing the complexity while keeping the achievable sum rate performance, two heuristic algorithms are proposed for the multiuser scheduling problems： the improved genetic algorithm and simplified norm-based greedy algo- rithm. Moreover, we also consider the heterogeneity scenario where a modified grouping-based user selection al- gorithm is given to guarantee the user＇ s fairness. Specifically, the asymptotic behavior of the norm-based greed- y algorithm is given when each user is equipped with one antenna. Numerical examples demonstrate the superi- ority of our proposed schedulin~ and ~rouoin~ algorithms.

QoS Guarantees of Multiuser Video Streaming over Wireless Links: Delay Constraint and Packet Priority Drop

To provide a certain level of Quality of Service (QoS) guarantees for multiuser wireless downlink video streaming transmissions, we propose a multiuser scheduling scheme for QoS guarantees. It is based on the classic Queue-Length-Based (QLB)-rate maximum scheduling algorithm and integrated with the delay constraint and the packet priority drop. We use the large deviation principle and the effective capacity theory to construct a new analysis model to find each user's queue length threshold (delay constraint) violation probability. This probability corresponds to the upper bound of the packet drop probability, which indicates a certain level of statistical QoS guarantees. Then, we utilize the priority information of video packets and introduce the packet priority drop to further improve the quality perceived by each user. The simulation results show that the average Peak Signal to Noise Ratio (PSNR) value of the priority drop is 0.8 higher than that of the non-priority drop and the PSNR value of the most badly damaged video frame in the priority drop is on an average 4 higher than that of the non-priority drop.

Joint Dirty Paper Coding and Linear Receiver Design for Multiuser MIMO Broadcast Channels

A multiuser multiple input multiple output (MIMO) broadcast scheme was proposed through applying dirty paper coding (DPC) at the transmitter and linear equalization at the receiver. Assuming single data stream communication for each user, joint transmitter and linear receiver design were done to enhance the system performance. Furthermore, a multiuser scheduling algorithm was presented to exploit multiuser diversity when the number of the users is larger than that of transmit antennas. The proposed system achieves the sum rate close to the Sato bound and is superior to some of the existing schemes.

A Low Complexity Algorithm for Subcarrier-and-Bit Allocation in OFDMA-Based LTE Systems

In this paper, we propose optimum and sub-optimum resource allocation and opportunistic scheduling solutions for orthogonal frequency division multiple access （OFDMA）-based multicellular systems. The applicability, complexity, and performance of the proposed algorithms are analyzed and numerically evaluated. In the initial setup, the fractional frequency reuse （FFR） technique for inter-cell interference cancellation is applied to classify the users into two groups, namely interior and exterior users. Adaptive modulation is then employed according to the channel state information （CSI） of each user to meet the symbol error rate （SER） requirement. There then, we develop subcarrier-and-bit allocation method, which maximizes the total system throughput subject to the constraints that each user has a minimum data rate requirement. The algorithm to achieve the optimum solution requires high computational complexity which hinders it from practicability. Toward this suboptimum method with the reduced to the order of O（NIO, the total number of subcarriers end, we complexity propose a extensively where N and K denote and users, respectively. Numerical results show that the proposed algorithm approaches the optimum solution, yet it enjoys the features of simplicity, dynamic cell configuration, adaptive subearrier-and-bit allocation, and spectral efficiency.