DMCA
On the optimality of multiantenna broadcast scheduling using zero-forcing beamforming (2006)
| Venue: | IEEE J. SELECT. AREAS COMMUN |
| Citations: | 308 - 4 self |
BibTeX
@ARTICLE{Yoo06onthe,
author = {Taesang Yoo and Andrea Goldsmith},
title = {On the optimality of multiantenna broadcast scheduling using zero-forcing beamforming},
journal = {IEEE J. SELECT. AREAS COMMUN},
year = {2006},
volume = {24},
pages = {528--541}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Although the capacity of multiple-input/multiple-output (MIMO) broadcast channels (BCs) can be achieved by dirty paper coding (DPC), it is difficult to implement in practical systems. This paper investigates if, for a large number of users, simpler schemes can achieve the same performance. Specifically, we show that a zero-forcing beamforming (ZFBF) strategy, while generally suboptimal, can achieve the same asymptotic sum capacity as that of DPC, as the number of users goes to infinity. In proving this asymptotic result, we provide an algorithm for determining which users should be active under ZFBF. These users are semiorthogonal to one another and can be grouped for simultaneous transmission to enhance the throughput of scheduling algorithms. Based on the user grouping, we propose and compare two fair scheduling schemes in round-robin ZFBF and proportional-fair ZFBF. We provide numerical results to confirm the optimality of ZFBF and to compare the performance of ZFBF and proposed fair scheduling schemes with that of various MIMO BC strategies.
Keyphrases
zero-forcing beamforming multiantenna broadcast simultaneous transmission asymptotic result dirty paper coding numerical result proportional-fair zfbf simpler scheme various mimo bc strategy practical system multiple-input multiple-output large number user grouping asymptotic sum capacity round-robin zfbf broadcast channel
