1,725 research outputs found

    Resource allocation for transmit hybrid beamforming in decoupled millimeter wave multiuser-MIMO downlink

    Get PDF
    This paper presents a study on joint radio resource allocation and hybrid precoding in multicarrier massive multiple-input multiple-output communications for 5G cellular networks. In this paper, we present the resource allocation algorithm to maximize the proportional fairness (PF) spectral efficiency under the per subchannel power and the beamforming rank constraints. Two heuristic algorithms are designed. The proportional fairness hybrid beamforming algorithm provides the transmit precoder with a proportional fair spectral efficiency among users for the desired number of radio-frequency (RF) chains. Then, we transform the number of RF chains or rank constrained optimization problem into convex semidefinite programming (SDP) problem, which can be solved by standard techniques. Inspired by the formulated convex SDP problem, a low-complexity, two-step, PF-relaxed optimization algorithm has been provided for the formulated convex optimization problem. Simulation results show that the proposed suboptimal solution to the relaxed optimization problem is near-optimal for the signal-to-noise ratio SNR <= 10 dB and has a performance gap not greater than 2.33 b/s/Hz within the SNR range 0-25 dB. It also outperforms the maximum throughput and PF-based hybrid beamforming schemes for sum spectral efficiency, individual spectral efficiency, and fairness index

    Multiuser Switched Diversity Scheduling Schemes

    Full text link
    Multiuser switched-diversity scheduling schemes were recently proposed in order to overcome the heavy feedback requirements of conventional opportunistic scheduling schemes by applying a threshold-based, distributed, and ordered scheduling mechanism. The main idea behind these schemes is that slight reduction in the prospected multiuser diversity gains is an acceptable trade-off for great savings in terms of required channel-state-information feedback messages. In this work, we characterize the achievable rate region of multiuser switched diversity systems and compare it with the rate region of full feedback multiuser diversity systems. We propose also a novel proportional fair multiuser switched-based scheduling scheme and we demonstrate that it can be optimized using a practical and distributed method to obtain the feedback thresholds. We finally demonstrate by numerical examples that switched-diversity scheduling schemes operate within 0.3 bits/sec/Hz from the ultimate network capacity of full feedback systems in Rayleigh fading conditions.Comment: Accepted at IEEE Transactions on Communications, to appear 2012, funded by NPRP grant 08-577-2-241 from QNR

    Joint Channel Probing and Proportional Fair Scheduling in Wireless Networks

    Full text link
    The design of a scheduling scheme is crucial for the efficiency and user-fairness of wireless networks. Assuming that the quality of all user channels is available to a central controller, a simple scheme which maximizes the utility function defined as the sum logarithm throughput of all users has been shown to guarantee proportional fairness. However, to acquire the channel quality information may consume substantial amount of resources. In this work, it is assumed that probing the quality of each user's channel takes a fraction of the coherence time, so that the amount of time for data transmission is reduced. The multiuser diversity gain does not always increase as the number of users increases. In case the statistics of the channel quality is available to the controller, the problem of sequential channel probing for user scheduling is formulated as an optimal stopping time problem. A joint channel probing and proportional fair scheduling scheme is developed. This scheme is extended to the case where the channel statistics are not available to the controller, in which case a joint learning, probing and scheduling scheme is designed by studying a generalized bandit problem. Numerical results demonstrate that the proposed scheduling schemes can provide significant gain over existing schemes.Comment: 26 pages, 8 figure

    Power efficient dynamic resource scheduling algorithms for LTE

    Get PDF
    • 

    corecore