English

MIMO Downlink Scheduling with Non-Perfect Channel State Knowledge

Information Theory 2009-10-11 v2 math.IT

Abstract

Downlink scheduling schemes are well-known and widely investigated under the assumption that the channel state is perfectly known to the scheduler. In the multiuser MIMO (broadcast) case, downlink scheduling in the presence of non-perfect channel state information (CSI) is only scantly treated. In this paper we provide a general framework that addresses the problem systematically. Also, we illuminate the key role played by the channel state prediction error: our scheme treats in a fundamentally different way users with small channel prediction error ("predictable" users) and users with large channel prediction error ("non-predictable" users), and can be interpreted as a near-optimal opportunistic time-sharing strategy between MIMO downlink beamforming to predictable users and space-time coding to nonpredictable users. Our results, based on a realistic MIMO channel model used in 3GPP standardization, show that the proposed algorithms can significantly outperform a conventional "mismatched" scheduling scheme that treats the available CSI as if it was perfect.

Keywords

Cite

@article{arxiv.0904.1409,
  title  = {MIMO Downlink Scheduling with Non-Perfect Channel State Knowledge},
  author = {Hooman Shirani-Mehr and Giuseppe Caire and Michael J. Neely},
  journal= {arXiv preprint arXiv:0904.1409},
  year   = {2009}
}

Comments

Submitted to IEEE Transactions on Communications

R2 v1 2026-06-21T12:49:36.656Z