IEICE TRANSACTIONS on Communications
Performance Analysis of the Extended Low Complexity User Scheduling Algorithm over Up-Link Multi-User MIMO OFDMA Systems
Summary :
The low complexity tree-structure based user scheduling algorithm is extended into up-link MLD-based multi-user multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing access (OFDMA) wireless systems. The system sum capacity is maximized by careful user selection on a defined tree structure. The calculation load is reduced by selecting the M most possible best branches and sampling in frequency dimension. The performances of the proposed scheduling algorithm are analyzed within three kinds of OFDMA systems and compared with conventional throughput-based algorithm. Both the theoretical analysis and simulation results show that the proposed algorithm obtains better performance with much low complexity.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E91-B No.1 pp.327-329
- Publication Date
- 2008/01/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1093/ietcom/e91-b.1.327
- Type of Manuscript
- LETTER
- Category
- Wireless Communication Technologies
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Junyi WANG, Yuyuan CHANG, Chuyu ZHENG, Kiyomichi ARAKI, ZhongZhao ZHANG, "Performance Analysis of the Extended Low Complexity User Scheduling Algorithm over Up-Link Multi-User MIMO OFDMA Systems" in IEICE TRANSACTIONS on Communications,
vol. E91-B, no. 1, pp. 327-329, January 2008, doi: 10.1093/ietcom/e91-b.1.327.
Abstract: The low complexity tree-structure based user scheduling algorithm is extended into up-link MLD-based multi-user multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing access (OFDMA) wireless systems. The system sum capacity is maximized by careful user selection on a defined tree structure. The calculation load is reduced by selecting the M most possible best branches and sampling in frequency dimension. The performances of the proposed scheduling algorithm are analyzed within three kinds of OFDMA systems and compared with conventional throughput-based algorithm. Both the theoretical analysis and simulation results show that the proposed algorithm obtains better performance with much low complexity.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e91-b.1.327/_p
Copy
@ARTICLE{e91-b_1_327,
author={Junyi WANG, Yuyuan CHANG, Chuyu ZHENG, Kiyomichi ARAKI, ZhongZhao ZHANG, },
journal={IEICE TRANSACTIONS on Communications},
title={Performance Analysis of the Extended Low Complexity User Scheduling Algorithm over Up-Link Multi-User MIMO OFDMA Systems},
year={2008},
volume={E91-B},
number={1},
pages={327-329},
abstract={The low complexity tree-structure based user scheduling algorithm is extended into up-link MLD-based multi-user multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing access (OFDMA) wireless systems. The system sum capacity is maximized by careful user selection on a defined tree structure. The calculation load is reduced by selecting the M most possible best branches and sampling in frequency dimension. The performances of the proposed scheduling algorithm are analyzed within three kinds of OFDMA systems and compared with conventional throughput-based algorithm. Both the theoretical analysis and simulation results show that the proposed algorithm obtains better performance with much low complexity.},
keywords={},
doi={10.1093/ietcom/e91-b.1.327},
ISSN={1745-1345},
month={January},}
Copy
TY - JOUR
TI - Performance Analysis of the Extended Low Complexity User Scheduling Algorithm over Up-Link Multi-User MIMO OFDMA Systems
T2 - IEICE TRANSACTIONS on Communications
SP - 327
EP - 329
AU - Junyi WANG
AU - Yuyuan CHANG
AU - Chuyu ZHENG
AU - Kiyomichi ARAKI
AU - ZhongZhao ZHANG
PY - 2008
DO - 10.1093/ietcom/e91-b.1.327
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E91-B
IS - 1
JA - IEICE TRANSACTIONS on Communications
Y1 - January 2008
AB - The low complexity tree-structure based user scheduling algorithm is extended into up-link MLD-based multi-user multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing access (OFDMA) wireless systems. The system sum capacity is maximized by careful user selection on a defined tree structure. The calculation load is reduced by selecting the M most possible best branches and sampling in frequency dimension. The performances of the proposed scheduling algorithm are analyzed within three kinds of OFDMA systems and compared with conventional throughput-based algorithm. Both the theoretical analysis and simulation results show that the proposed algorithm obtains better performance with much low complexity.
ER -
English
