• DocumentCode
    2303836
  • Title

    Resource allocation for OFDMA systems

  • Author

    Turgu, Can ; Toker, Cenk

  • Author_Institution
    Elektr. ve Elektron. Muhendisligi Bolumu, Hacettepe Univ., Ankara, Turkey
  • fYear
    2009
  • fDate
    9-11 April 2009
  • Firstpage
    564
  • Lastpage
    567
  • Abstract
    In an OFDMA (Orthogonal Frequency Division Multiple Access) scenario in which the users of a multiuser system share the common channel simultaneously, the issue of allocating the shared channel resources (subcarrier and power) among the users is called the resource allocation problem. This problem, which is nonlinear due to its nature, also has a discrete structure. In this paper, a fast algorithm based on linear programming is proposed. The algorithm is composed of two phases. In the first one, the original integer programming problem is first linearized and then after relaxing the integer constraints a solution is obtained by the aid of the Simplex Algorithm. In the second phase, by exploiting the sub-carrier allocation obtained in first phase, bits are allocated to each user independently using the Greedy Algorithm. The simulation results have demonstrated that, the proposed algorithm can achieve a performance very close to that of the integer programming techniques while being significantly faster.
  • Keywords
    OFDM modulation; channel allocation; greedy algorithms; multiuser channels; nonlinear programming; resource allocation; greedy algorithm; integer programming problem; linear programming; multiuser system; orthogonal frequency division multiple access; resource allocation; simplex algorithm; Bit error rate; Frequency conversion; Greedy algorithms; Linear programming; Quality of service; Remuneration; Resource management;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Signal Processing and Communications Applications Conference, 2009. SIU 2009. IEEE 17th
  • Conference_Location
    Antalya
  • Print_ISBN
    978-1-4244-4435-9
  • Electronic_ISBN
    978-1-4244-4436-6
  • Type

    conf

  • DOI
    10.1109/SIU.2009.5136458
  • Filename
    5136458