Resource allocation for H-FDD OFDMA systems

Jihwan P. Choi; Jaesub Shin; Jungwon Lee; Hui Ling Lou; Ji Woong Choi

doi:10.1109/LCOMM.2014.2326878

Resource allocation for H-FDD OFDMA systems

Jihwan P. Choi
, Jaesub Shin
, Jungwon Lee
, Hui Ling Lou
, Ji Woong Choi

Department of Electrical Engineering and Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

Half-frequency-division duplexing (H-FDD) has recently attracted attention since it can serve as a cost-effective solution for machine-to-machine (M2M) communication networks. This letter proposes a method to jointly optimize resource allocation, mobile station grouping, and frame partitioning for H-FDD orthogonal frequency-division multiplexing access systems. We develop a near-optimal and low-complexity algorithm that is also applicable to frequency-division duplexing and time-division duplexing as special cases. Simulation results demonstrate that our algorithm with reduced computation can provide performance close to that of the optimal but time-consuming exhaustive search.

Original language	English
Article number	6822541
Pages (from-to)	1242-1245
Number of pages	4
Journal	IEEE Communications Letters
Volume	18
Issue number	7
DOIs	https://doi.org/10.1109/LCOMM.2014.2326878
State	Published - Jul 2014

Keywords

Resource allocation
frame partitioning
half-frequency-division duplexing (H-FDD)
mobile station grouping
orthogonal frequencydivision multiplexing access (OFDMA)

Access to Document

10.1109/LCOMM.2014.2326878

Cite this

@article{8db36087a4494780ba58da7c4804f774,

title = "Resource allocation for H-FDD OFDMA systems",

abstract = "Half-frequency-division duplexing (H-FDD) has recently attracted attention since it can serve as a cost-effective solution for machine-to-machine (M2M) communication networks. This letter proposes a method to jointly optimize resource allocation, mobile station grouping, and frame partitioning for H-FDD orthogonal frequency-division multiplexing access systems. We develop a near-optimal and low-complexity algorithm that is also applicable to frequency-division duplexing and time-division duplexing as special cases. Simulation results demonstrate that our algorithm with reduced computation can provide performance close to that of the optimal but time-consuming exhaustive search.",

keywords = "Resource allocation, frame partitioning, half-frequency-division duplexing (H-FDD), mobile station grouping, orthogonal frequencydivision multiplexing access (OFDMA)",

author = "Choi, \{Jihwan P.\} and Jaesub Shin and Jungwon Lee and Lou, \{Hui Ling\} and Choi, \{Ji Woong\}",

year = "2014",

month = jul,

doi = "10.1109/LCOMM.2014.2326878",

language = "English",

volume = "18",

pages = "1242--1245",

journal = "IEEE Communications Letters",

issn = "1089-7798",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "7",

}

TY - JOUR

T1 - Resource allocation for H-FDD OFDMA systems

AU - Choi, Jihwan P.

AU - Shin, Jaesub

AU - Lee, Jungwon

AU - Lou, Hui Ling

AU - Choi, Ji Woong

PY - 2014/7

Y1 - 2014/7

N2 - Half-frequency-division duplexing (H-FDD) has recently attracted attention since it can serve as a cost-effective solution for machine-to-machine (M2M) communication networks. This letter proposes a method to jointly optimize resource allocation, mobile station grouping, and frame partitioning for H-FDD orthogonal frequency-division multiplexing access systems. We develop a near-optimal and low-complexity algorithm that is also applicable to frequency-division duplexing and time-division duplexing as special cases. Simulation results demonstrate that our algorithm with reduced computation can provide performance close to that of the optimal but time-consuming exhaustive search.

AB - Half-frequency-division duplexing (H-FDD) has recently attracted attention since it can serve as a cost-effective solution for machine-to-machine (M2M) communication networks. This letter proposes a method to jointly optimize resource allocation, mobile station grouping, and frame partitioning for H-FDD orthogonal frequency-division multiplexing access systems. We develop a near-optimal and low-complexity algorithm that is also applicable to frequency-division duplexing and time-division duplexing as special cases. Simulation results demonstrate that our algorithm with reduced computation can provide performance close to that of the optimal but time-consuming exhaustive search.

KW - Resource allocation

KW - frame partitioning

KW - half-frequency-division duplexing (H-FDD)

KW - mobile station grouping

KW - orthogonal frequencydivision multiplexing access (OFDMA)

UR - https://www.scopus.com/pages/publications/84904306956

U2 - 10.1109/LCOMM.2014.2326878

DO - 10.1109/LCOMM.2014.2326878

M3 - Article

AN - SCOPUS:84904306956

SN - 1089-7798

VL - 18

SP - 1242

EP - 1245

JO - IEEE Communications Letters

JF - IEEE Communications Letters

IS - 7

M1 - 6822541

ER -

Resource allocation for H-FDD OFDMA systems

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this