Sciweavers

Share
ICWN
2003

Comparison of Heuristic and Optimal Subcarrier Assignment Algorithms

9 years 4 months ago
Comparison of Heuristic and Optimal Subcarrier Assignment Algorithms
Wireless multi carrier approaches can support the simultaneous transmissions to several wireless terminals, each one getting only some of the available subcarriers. Judiciously assigning subcarriers to terminals can be used to, e.g., increase the capacity of a wireless cell; however, the resulting assignment problem is difficult. The first subproblem is to decide the number of carriers assigned to each terminal. Then, carriers have to be assigned to individual terminals. For this assignment problem, we present in this paper an optimal but impractical algorithm as well as two new heuristic ones, which have a considerably lower complexity and can be used in real systems. We show that the performance of even the simple heuristic algorithm is comparable with that of the optimal algorithm. The advanced heuristic increases the performance further, at a modest increase in complexity. Both heuristics are at most 5% off from the optimal algorithm’s performance1 .
James Gross, Holger Karl, Frank H. P. Fitzek, Adam
Added 31 Oct 2010
Updated 31 Oct 2010
Type Conference
Year 2003
Where ICWN
Authors James Gross, Holger Karl, Frank H. P. Fitzek, Adam Wolisz
Comments (0)
books