Abstract | ||
---|---|---|
For a single carrier frequency division multiple access (SC-FDMA) system, we obtain the jointly optimal power and chunk allocation policies which maximize the sum rate. Our solution is applicable to both localized and interleaved subcarrier mapping schemes. We solve the joint optimization problem by sequentially solving two sub-problems: power allocation and chunk allocation. Primarily, we use an optimal power allocation algorithm, which we derive from Karush-Kuhn-Tucker (KKT) conditions; and then we convert the optimum chunk assignment problem into a maximum weighted matching problem on a bipartite graph, and hence solve it in polynomial time. We also propose two greedy chunk allocation algorithms with lower complexity, and demonstrate that these algorithms produce near optimal results, especially for interleaved subcarrier mapping, when used in conjunction with optimal power control. |
Year | DOI | Venue |
---|---|---|
2013 | 10.1109/ICC.2013.6655072 | Communications |
Keywords | Field | DocType |
frequency division multiple access,graph theory,greedy algorithms,optimal control,optimisation,power control,telecommunication control,KKT conditions,Karush-Kuhn-Tucker conditions,bipartite graph,greedy chunk allocation algorithms,interleaved subcarrier mapping schemes,jointly optimal chunk allocation policy,jointly optimal power allocation policy,maximum weighted matching problem,optimal power control,optimization problem,optimum chunk assignment problem,polynomial time,uplink SC-FDMA,uplink single carrier frequency division multiple access system | Subcarrier,Mathematical optimization,Optimal control,Computer science,Power control,Greedy algorithm,Assignment problem,Frequency-division multiple access,Karush–Kuhn–Tucker conditions,Optimization problem | Conference |
ISSN | Citations | PageRank |
1550-3607 | 3 | 0.41 |
References | Authors | |
7 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Teoman Mert | 1 | 3 | 0.41 |
Onur Kaya | 2 | 106 | 13.85 |
hakan ali cirpan | 3 | 40 | 13.14 |