Joint beamforming and scheduling for a MIMO downlink with random arrivals

Mari Kobayashi, Giuseppe Caire

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

12 Scopus citations

Abstract

We study a number of downlink signaling strategies under perfect and non-perfect channel state information at the transmitter (CSIT) for the case of random packet arrivals. Under this setting, the relevant fairness criterion is the stabilization of all buffer queues which guarantees a bounded average delay for all users. In the case of perfect CSIT, different linear beamforming schemes are compared with the stability optimal policy based on dirty-paper coding (DPC). It is found that simple linear beamforming schemes with greedy user selection achieve near DPC performance in terms of the average delay. In the case of non-perfect CSIT due to a delayed feedback, we propose a novel greedy beamforming (heuristic) scheme together with "analog feedback" of CSI, where each user sends back its estimated channel vector without quantizing and coding. The proposed scheme outperforms the previously proposed schemes such as opportunistic beamforming and requires a similar feedback overhead.

Original languageEnglish
Title of host publicationProceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006
Pages1442-1446
Number of pages5
DOIs
StatePublished - 2006
Externally publishedYes
Event2006 IEEE International Symposium on Information Theory, ISIT 2006 - Seattle, WA, United States
Duration: 9 Jul 200614 Jul 2006

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8101

Conference

Conference2006 IEEE International Symposium on Information Theory, ISIT 2006
Country/TerritoryUnited States
CitySeattle, WA
Period9/07/0614/07/06

Fingerprint

Dive into the research topics of 'Joint beamforming and scheduling for a MIMO downlink with random arrivals'. Together they form a unique fingerprint.

Cite this