articleIEEE Journal on Selected Areas in CommunicationsMar 1, 2006Closed access

On the optimality of multiantenna broadcast scheduling using zero-forcing beamforming

Stanford University

Indexed incrossref

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…

Citation impact

2,101
total citations
FWCI
149.82
Percentile
100%
References
30
Citations per year

Authors

2

Topics & keywords

Keywords
  • Dirty paper coding
  • Computer science
  • MIMO
  • Beamforming
  • Scheduling (production processes)
  • Proportionally fair
  • Coding (social sciences)
  • Mathematical optimization
No related works found for this paper.