Low complexity dynamic channel allocation by efficient swapping process for OFDMA systems

Woohyun Seo, Myeon Gyun Cho, Daesik Hong

Research output: Chapter in Book/Report/Conference proceedingConference contribution


In this paper, the low complexity algorithm of dynamic channel allocation (DCA) for downlink OFDMA systems is proposed. From the complexity calculation of Wong's algorithm composed of two steps, it is known that the major complexity burden of this algorithm is occurred by initial step. By this reason, initial step of the simplified allocation algorithm is made from a random allocation without any complexity. In addition, the number of iterations for a swapping process in the second step is limited efficiently using the limitation factor. Simulation results show that the bit-error-rate (BER) performance of the proposed algorithm is close to that of Wong's even if is has the decreased complexity by more than two times.

Original languageEnglish
Title of host publicationVTC 2005-Fall
Subtitle of host publicationMid Way Through the Decade - Technology Past, Present and Future
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages4
ISBN (Electronic)0780391527
Publication statusPublished - 2005 Jan 1
Event62nd Vehicular Technology Conference, VTC 2005 - Dallas, United States
Duration: 2005 Sept 252005 Sept 28

Publication series

NameIEEE Vehicular Technology Conference
ISSN (Print)1550-2252


Other62nd Vehicular Technology Conference, VTC 2005
Country/TerritoryUnited States

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Electrical and Electronic Engineering
  • Applied Mathematics


Dive into the research topics of 'Low complexity dynamic channel allocation by efficient swapping process for OFDMA systems'. Together they form a unique fingerprint.

Cite this