By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Conte, E. ; Dept. of Inf. Eng., Univ. of Padova, Padova, Italy ; Tomasin, S. ; Benvenuto, N.

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.

Published in:

Communications Letters, IEEE  (Volume:14 ,  Issue: 5 )