A simplified greedy algorithm for joint scheduling and beamforming in multiuser MIMO OFDM

Authors:
Ermanna Conte;Stefano Tomasin;Nevio Benvenuto
Affiliations:
Department of Information Engineering, University of Padova, Italy;Department of Information Engineering, University of Padova, Italy;Department of Information Engineering, University of Padova, Italy
Venue:
IEEE Communications Letters
Year:
2010

Citing 5
Cited 0

OFDM and MC-CDMA for Broadband Multi-User Communications, WLANs and Broadcasting

OFDM and MC-CDMA for Broadband Multi-User Communications, WLANs and Broadcasting
On downlink beamforming with greedy user selection: performance analysis and a simple new algorithm

IEEE Transactions on Signal Processing - Part I
Scheduling Algorithms for Time-Varying Downlink Channels

IEEE Transactions on Wireless Communications
Cross-layer scheduling for multi-user MIMO systems

IEEE Communications Magazine
Multi-Antenna Downlink Channels with Limited Feedback and User Selection

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a cellular system using frequency division duplexing and orthogonal frequency division multiplexing (OFDM), where the base station has multiple antennas and each mobile terminal feeds back a quantized version of the channel state information. For downlink transmission, the base station performs joint scheduling and beamforming with the objective of maximizing the system throughput. In this letter, we propose an iterative (in the user selection) beamforming algorithm which exploits approximated orthogonality conditions of the scheduled users. By simulation results it is seen that new approach outperforms existing scheduling techniques in terms of outage throughput with similar or lower complexity.