Efficient Subcarrier and Power Allocation Algorithm in OFDMA Uplink System

Ki Hoon KWON; Younggoo HAN; Sehun KIM

doi:10.1093/ietcom/e90-b.2.368

Efficient Subcarrier and Power Allocation Algorithm in OFDMA Uplink System

Ki Hoon KWON, Younggoo HAN, Sehun KIM

Full Text Views

0

Cite this

Summary :

This letter focuses on uplink transmission in OFDMA systems. A subcarrier and power allocation problem is formulated that maximizes the throughput of OFDMA uplink systems while satisfying each user's power constraints. A greedy algorithm known to be the most efficient algorithm for this problem can provide a high quality near-optimal solution, but has the disadvantage of incurring a long computation time. As this problem should be solved in a real-time environment, computation time is a very important performance measure of algorithms. In this letter, a computationally efficient algorithm that provides a nearly identical quality, near-optimal solution as the greedy algorithm but requires less than 10% of the computation time of the greedy algorithm is proposed.

Publication: IEICE TRANSACTIONS on Communications Vol.E90-B No.2 pp.368-371

Publication Date: 2007/02/01

Publicized

Online ISSN: 1745-1345

DOI: 10.1093/ietcom/e90-b.2.368

Type of Manuscript: LETTER

Category: Wireless Communication Technologies

Cite this

Copy

Ki Hoon KWON, Younggoo HAN, Sehun KIM, "Efficient Subcarrier and Power Allocation Algorithm in OFDMA Uplink System" in IEICE TRANSACTIONS on Communications, vol. E90-B, no. 2, pp. 368-371, February 2007, doi: 10.1093/ietcom/e90-b.2.368.
Abstract: This letter focuses on uplink transmission in OFDMA systems. A subcarrier and power allocation problem is formulated that maximizes the throughput of OFDMA uplink systems while satisfying each user's power constraints. A greedy algorithm known to be the most efficient algorithm for this problem can provide a high quality near-optimal solution, but has the disadvantage of incurring a long computation time. As this problem should be solved in a real-time environment, computation time is a very important performance measure of algorithms. In this letter, a computationally efficient algorithm that provides a nearly identical quality, near-optimal solution as the greedy algorithm but requires less than 10% of the computation time of the greedy algorithm is proposed.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e90-b.2.368/_p

Copy

@ARTICLE{e90-b_2_368,
author={Ki Hoon KWON, Younggoo HAN, Sehun KIM, },
journal={IEICE TRANSACTIONS on Communications},
title={Efficient Subcarrier and Power Allocation Algorithm in OFDMA Uplink System},
year={2007},
volume={E90-B},
number={2},
pages={368-371},
abstract={This letter focuses on uplink transmission in OFDMA systems. A subcarrier and power allocation problem is formulated that maximizes the throughput of OFDMA uplink systems while satisfying each user's power constraints. A greedy algorithm known to be the most efficient algorithm for this problem can provide a high quality near-optimal solution, but has the disadvantage of incurring a long computation time. As this problem should be solved in a real-time environment, computation time is a very important performance measure of algorithms. In this letter, a computationally efficient algorithm that provides a nearly identical quality, near-optimal solution as the greedy algorithm but requires less than 10% of the computation time of the greedy algorithm is proposed.},
keywords={},
doi={10.1093/ietcom/e90-b.2.368},
ISSN={1745-1345},
month={February},}

Copy

TY - JOUR
TI - Efficient Subcarrier and Power Allocation Algorithm in OFDMA Uplink System
T2 - IEICE TRANSACTIONS on Communications
SP - 368
EP - 371
AU - Ki Hoon KWON
AU - Younggoo HAN
AU - Sehun KIM
PY - 2007
DO - 10.1093/ietcom/e90-b.2.368
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E90-B
IS - 2
JA - IEICE TRANSACTIONS on Communications
Y1 - February 2007
AB - This letter focuses on uplink transmission in OFDMA systems. A subcarrier and power allocation problem is formulated that maximizes the throughput of OFDMA uplink systems while satisfying each user's power constraints. A greedy algorithm known to be the most efficient algorithm for this problem can provide a high quality near-optimal solution, but has the disadvantage of incurring a long computation time. As this problem should be solved in a real-time environment, computation time is a very important performance measure of algorithms. In this letter, a computationally efficient algorithm that provides a nearly identical quality, near-optimal solution as the greedy algorithm but requires less than 10% of the computation time of the greedy algorithm is proposed.
ER -