1 / 32

Multiuser Resource Allocation in Multichannel Wireless Communication Systems

Multiuser Resource Allocation in Multichannel Wireless Communication Systems. Zukang Shen Ph.D. Defense Committee Members: Prof. Jeffrey G. Andrews (co-advisor) Prof. Melba M. Crawford Prof. Gustavo de Veciana Prof. Brian L. Evans (co-advisor) Prof. Robert W. Heath, Jr.

Olivia
Download Presentation

Multiuser Resource Allocation in Multichannel Wireless Communication Systems

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Multiuser Resource Allocation in Multichannel Wireless Communication Systems Zukang Shen Ph.D. Defense Committee Members: Prof. Jeffrey G. Andrews (co-advisor) Prof. Melba M. Crawford Prof. Gustavo de Veciana Prof. Brian L. Evans (co-advisor) Prof. Robert W. Heath, Jr. Prof. Edward J. Powers Communications, Networks, and Systems Area Dept. of Electrical and Computer Engineering The University of Texas at Austin Jan. 19, 2006 (updated slides)

  2. Outline

  3. frequency code/spatial user 4 user 5 user 6 user 1 user 2 user 3 time Resource Allocation in Wireless Systems • High data rate transmission • Wireless local area networks (WLAN) 54 -- 108 Mbps • Metropolitan area networks (WiMAX) ~10 -- 100 Mbps • Cellular systems (3GPP) ~1 -- 4 Mbps • Limited resources shared by multiple users • Transmit power • Frequency bandwidth • Transmission time • Code resource • Spatial antennas • Resource allocation impacts • Power consumption • User throughput • System latency

  4. time/frequency user 1 user 2 user 3 user K time/frequency Multiuser Diversity • Multiuser wireless communication systems • Independent fading channels • Multiuser diversity

  5. Downlink Multiuser Multichannel Systems • Downlink systems • Centralized basestation transmits to multiple users simultaneously • Limited resources at basestation • Multiple channels created in • Frequency: orthogonal frequency division multiplexing (OFDM) • Space: multiple transmit and receive antennas • Adaptive resource allocation • Goal: Optimize system throughput subject to constraints • Method: Formulate resource allocation as optimization problem • Optimal solution typically computationally prohibitive to find • Low complexity resource scheduling algorithms desired • Assumption: Perfect channel state information of all users known at basestation

  6. Outline • Introduction • Contribution #1: Adaptive resource allocation in multiuser OFDM systems with proportional rate constraints • Optimization framework balancing throughput and fairness • Decoupling subchannel and power allocation • Allocating power optimally for a given subchannel allocation • Contribution #2: Sum capacity of downlink multiuser MIMO systems with block diagonalization • Contribution #3: Low complexity user selection algorithms in multiuser MIMO systems with block diagonalization • Conclusion

  7. gain frequency Multiuser OFDM (MU-OFDM) • Orthogonal frequency division multiplexing • Zero inter-symbol interference • Parallel frequency subchannels • Multiple access technology • Downlink multiuser OFDM • Users share subchannels and basestation transmit power • Users only decode their own data • Resource allocation methods • Static: TDMA, FDMA • Dynamic: multiuser diversity • Users feedback channelinformation to basestation • Basestation determinesresource allocation

  8. : user k’s capacity (bits/s/Hz) as continuous function for single cell MU-OFDM Adaptive Resource Allocation

  9. Contribution #1 MU-OFDM with Proportional Rates • Objective: Sum capacity • Constraints • Total transmit power • No subchannel shared by multiple users • Proportional rate constraints • Advantages • In theory, fill gap of max sum capacity & max-min capacity • In practice, allow different service privileges and different pricing

  10. Contribution #1 Subchannel Allocation • Modified method of [Rhee et al., 2000], but we keep the assumption of equal power distribution on subchannels • Initialization (Enforce zero initial conditions)Set , for . Let • For to (Allocate best subchannel for each user) • Find satisfying for all • Let , and update • While (Then iteratively give lowest rate user first choice) • Find satisfying for all • For the found , find satisfying for all • For the found and , Let , and update

  11. Contribution #1 Water-level subchannels Power Allocation for a Single User • Optimal power distribution for user • Order • Water-filling algorithm • How to find for

  12. Contribution #1 Power Allocation among Many Users • Use proportional rate and total power constraints • Solve nonlinear system of K equations: /iteration • Two special cases • Linear case: , closed-form solution • High channel-to-noise ratio: and where

  13. Contribution #1 Comparison with Optimal Solution

  14. Contribution #1 Comparison with Max-Min Capacity

  15. Contribution #1 Comparison with Max Sum Capacity

  16. Summary of Contribution #1 • Adaptive resource allocation in multiuser OFDM systems • Maximize sum capacity • Enforce proportional user data rates • Low complexity near-optimal resource allocation algorithm • Subchannel allocation assuming equal power on all subchannels • Optimal power distribution for a single user • Optimal power distribution among many users with proportionality • Advantages • Evaluate tradeoff between sum capacity and user data rate fairness • Fill the gap of max sum capacity and max-min capacity • Achieve flexible data rate distribution among users • Allow different service privileges and pricing

  17. Outline • Introduction • Contribution #1: Adaptive resource allocation in multiuser OFDM systems with proportional rate constraints • Contribution #2: Sum capacity of downlink multiuser MIMO systems with block diagonalization • Block diagonalization with receive antenna selection • Sum capacity of BD vs. DPC for given channels • Upper bound on the ratio of DPC and BD sum capacity in Rayleigh fading channels • Contribution #3: Low complexity user selection algorithms in multiuser MIMO systems with block diagonalization • Conclusion

  18. Multi-Antenna Systems • Exploit 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 transmitter and receiver [Winters, 1987] [Foschini et al., 1998] • Theoretical results on point-to-point multi-input multi-output (MIMO) channel capacity [Telatar, 1999] • Tradeoff between diversity and multiplexing • Theoretical treatment [Zheng et al., 2003] • Switching between diversity and multiplexing [Heath et al., 2005]

  19. + + + MultipleAccessChannel BroadcastChannel + MIMO Gaussian Broadcast Channels • Duality with multiple access channels [Vishwanath et al., 2003] • Dirty paper coding (DPC) [Costa, 1983] • Sum capacity achieved with DPC [Vishwanath et al., 2003] • Iterative water-filling algorithm [Yu et al., 2004] [Jindal et al., 2005] • Capacity region [Weingarten et al., 2004] • Coding schemes approaching DPC sum capacity[Zamir et al., 2002] [Airy et al., 2004] [Stojnic et al., 2004] • Too complicated for cost-effective implementations

  20. Block Diagonalization (BD) • Linear precoding technique • Zero inter-user interference [Spencer et al., 2004] • in the null space of • Advantages: Simple transceiver design • Effective point-to-point MIMO channel • Disadvantages: Suboptimal for sum capacity • Channel energy wasted for orthogonalizing user channels • Transmit signal covariance matrices not optimal

  21. Contribution #2 BD with Receive Antenna Selection • Why joint processing? • Confine to be selection matrix, e.g. • Lower system overhead for conveying • BD with receive antenna selection • Exhaustive search for optimal selection matrices

  22. Contribution #2 BD vs. DPC: Given Channels • Theorem: The ratio of DPC sum capacity over BD is bounded by • Ratio of DPC sum capacity over TDMA bounded by [Jindal et al., 2005] • TDMA only serves one user at a time • BD supports multiple users: • Valid for any SNR, , , and • Lemma: If user channels are orthogonal, then • Lemma: If and user channelsare in same vector space

  23. Contribution #2 BD vs. DPC: Rayleigh Fading Channels • Lower bound on BD ergodic sum capacity • Fix a subset of users to serve • Each user’s effective channel still Rayleigh • Equal power allocated for every MIMO eigenmode • Upper bound on DPC ergodic sum capacity • Allow user cooperation (effectively point-to-point channel) • Cooperative channel • Space-time water-filling for effective cooperative MIMO channel • Upper bound on ratio of DPC and BD ergodic sum capacity • Easy evaluation with numerical integrations • Bound is tight for • Medium to high SNR, or

  24. Contribution #2 Simulation Results

  25. Contribution #2 Simulation Results

  26. Summary of Contribution #2 • Sum capacity in downlink multiuser MIMO systems with block diagonalization • Formulated joint transmitter precoding and receiver post-processing (shown in dissertation) • Combined block diagonalization with receive antenna selection • Block diagonalization vs. dirty paper coding • Sum capacity for given channels • Ergodic sum capacity in Rayleigh fading channel • Block diagonalization achieves a significant part of the optimal sum capacity

  27. Outline • Introduction • Contribution #1: Adaptive resource allocation in multiuser OFDM systems with proportional rate constraints • Contribution #2: Sum capacity of downlink multiuser MIMO systems with block diagonalization • Contribution #3: Low complexity user selection algorithms in multiuser MIMO systems with block diagonalization • Capacity based user selection • Channel Frobenius norm based user selection • Conclusion

  28. Need of User Selection for BD • Zero inter-user interference requires in null space of • Dimension of : • Maximum number of simultaneous users: • Assuming active users utilize all receive antennas • Select subset of users to maximize total throughput • Exhaustive search • Optimal for total throughput • Computationally prohibitive • Related work • Semi-orthogonal user set construction [Yoo et al., 2005] • Antenna selection [Gharavi-Alkhansari et al., 2004]

  29. Contribution #3 Capacity based algorithm (c-algorithm) Channel norm algorithm (n-algorithm) , apply BD to No No users selected users selected or sum capacity decreases Yes apply c-algorithmto select subset Yes Greedy User Selection Algorithms

  30. Contribution #3 Computational Complexity • Proposed algorithms have complexity Average CPU run time (Pentium M 1.6G Hz PC)

  31. Contribution #3 Monte Carlo Results

  32. Summary of Contributions • Adaptive resource allocation in multiuser OFDM • Balanced throughput and proportional user data rates • Derived optimal power allocation given subchannel allocation • Sum capacity of downlink multiuser MIMO systems • Combined block diagonalization with receive antenna selection • Analyzed sum capacity of BD vs. DPC for given channels • Derived upper bound on ratio of DPC and BD sum capacity in Rayleigh fading channels • Low complexity user selection algorithms in multiuser MIMO systems with block diagonalization • Proposed two algorithms with linear complexity in no. of total users • Achieved near-optimal sum capacity

More Related