• DocumentCode
    1480253
  • Title

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

  • Author

    Conte, Ermanna ; Tomasin, Stefano ; Benvenuto, Nevio

  • Author_Institution
    Dept. of Inf. Eng., Univ. of Padova, Padova, Italy
  • Volume
    14
  • Issue
    5
  • fYear
    2010
  • fDate
    5/1/2010 12:00:00 AM
  • Firstpage
    381
  • Lastpage
    383
  • 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.
  • Keywords
    MIMO communication; OFDM modulation; array signal processing; cellular radio; greedy algorithms; iterative methods; scheduling; cellular system; downlink transmission; frequency division duplexing; greedy algorithm; iterative beamforming algorithm; multiuser MIMO OFDM; orthogonal frequency division multiplexing; scheduling; Antenna feeds; Array signal processing; Base stations; Channel state information; Frequency conversion; Greedy algorithms; MIMO; Mobile antennas; OFDM; Throughput; Land mobile radio cellular systems, MIMO systems, orthogonal frequency division multiplexing, scheduling;
  • fLanguage
    English
  • Journal_Title
    Communications Letters, IEEE
  • Publisher
    ieee
  • ISSN
    1089-7798
  • Type

    jour

  • DOI
    10.1109/LCOMM.2010.05.091470
  • Filename
    5456039