BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Downlink Scheduling in Multiuser MIMO systems
DTSTART:20100625T151500
DTSTAMP:20260407T125345Z
UID:9af2b6d4eeb5ba1160085ee0c985991593c53aeee51a7ae0c3bf36ba
CATEGORIES:Conferences - Seminars
DESCRIPTION: Prof. Giuseppe Caire\, University of Southern California\nHig
 h-Speed Data-Oriented donwlink has been included in current 3G wireless st
 andards in various similar forms (e.g.\, 1xEv-Do for CDMA2000 and HSDPA fo
 r 3GPP-WCDMA). These schemes make use of opportunistic scheduling that tak
 e advantage of instantaneous channel state information in order to allocat
 e the user to the time-frequency slots with the most favorable channel con
 ditions\, subject to some ``fairness'' criterion. For delay-tolerant data 
 traffic\, opportunistic scheduling provides a significant throughput impro
 vement with respect to conventional CDMA or TDMA/FDMA with fixed round-rob
 in channel assignment. In the pursuit of even higher data rates\, the next
  generation of wireless systems will make widespread use of multiuser mult
 iple antennas (MU-MIMO) techniques. In this talk\, we review the principle
 s of MU-MIMO dowlink schemes (MIMO Gaussian broadcast channel)\, we discus
 s the challenges related to providing reliable channel state information a
 t the transmitter(s)\, and to the presence of unpredictable inter-cell int
 erference due to independent uncoordinated operations in neighboring cells
 \, and provide a comprehensive and general framework to solve the opportun
 istic downlink scheduling problem that takes into account these non-ideal 
 conditions. The proposed approach builds on a general stochastic network o
 ptimization framework based on Liapunov queue stability and Liapunov drift
 . Effects such as non-perfect channel state information and unknown instan
 taneous interference power levels from adjacent cells are included\, and c
 omputationally efficient near-optimal implementation are discussed. Finall
 y\, we will present an analysis method that combines results from large ra
 ndom matrices and convex optimization\, and is able to characterize semi-a
 nalytically the system performance under opportunistic scheduling and arbi
 trary fairness criteria. \nProf. Caire's homepage
LOCATION:BC 01 https://plan.epfl.ch/?room==BC%2001
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR