IEICE TRANSACTIONS on Communications
A Low Complexity Tree-Structure Based User Scheduling Algorithm for Up-Link Multi-User MIMO Systems
Summary :
The paper describes a low complexity tree-structure based user scheduling algorithm in an up-link transmission of MLD-based multi-user multiple-input multiple-output (MIMO) wireless systems. An M-branch selection algorithm, which selects M most-possible best branches at each step, is proposed to maximize the whole system sum-rate capacity. To achieve the maximum capacity in multi-user MIMO systems, antennas configuration and user selection are preformed simultaneously. Then according to the selected number of antennas for each user, different transmission schemes are also adopted. Both the theoretical analysis and simulation results show that the proposed algorithms obtain near optimal performance with far low complexity than the full search procedure.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E90-B No.6 pp.1415-1423
- Publication Date
- 2007/06/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1093/ietcom/e90-b.6.1415
- Type of Manuscript
- PAPER
- 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, Kiyomichi ARAKI, Zhongzhao ZHANG, Yuyuan CHANG, Houtao ZHU, Tsuyoshi KASHIMA, "A Low Complexity Tree-Structure Based User Scheduling Algorithm for Up-Link Multi-User MIMO Systems" in IEICE TRANSACTIONS on Communications,
vol. E90-B, no. 6, pp. 1415-1423, June 2007, doi: 10.1093/ietcom/e90-b.6.1415.
Abstract: The paper describes a low complexity tree-structure based user scheduling algorithm in an up-link transmission of MLD-based multi-user multiple-input multiple-output (MIMO) wireless systems. An M-branch selection algorithm, which selects M most-possible best branches at each step, is proposed to maximize the whole system sum-rate capacity. To achieve the maximum capacity in multi-user MIMO systems, antennas configuration and user selection are preformed simultaneously. Then according to the selected number of antennas for each user, different transmission schemes are also adopted. Both the theoretical analysis and simulation results show that the proposed algorithms obtain near optimal performance with far low complexity than the full search procedure.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e90-b.6.1415/_p
Copy
@ARTICLE{e90-b_6_1415,
author={Junyi WANG, Kiyomichi ARAKI, Zhongzhao ZHANG, Yuyuan CHANG, Houtao ZHU, Tsuyoshi KASHIMA, },
journal={IEICE TRANSACTIONS on Communications},
title={A Low Complexity Tree-Structure Based User Scheduling Algorithm for Up-Link Multi-User MIMO Systems},
year={2007},
volume={E90-B},
number={6},
pages={1415-1423},
abstract={The paper describes a low complexity tree-structure based user scheduling algorithm in an up-link transmission of MLD-based multi-user multiple-input multiple-output (MIMO) wireless systems. An M-branch selection algorithm, which selects M most-possible best branches at each step, is proposed to maximize the whole system sum-rate capacity. To achieve the maximum capacity in multi-user MIMO systems, antennas configuration and user selection are preformed simultaneously. Then according to the selected number of antennas for each user, different transmission schemes are also adopted. Both the theoretical analysis and simulation results show that the proposed algorithms obtain near optimal performance with far low complexity than the full search procedure.},
keywords={},
doi={10.1093/ietcom/e90-b.6.1415},
ISSN={1745-1345},
month={June},}
Copy
TY - JOUR
TI - A Low Complexity Tree-Structure Based User Scheduling Algorithm for Up-Link Multi-User MIMO Systems
T2 - IEICE TRANSACTIONS on Communications
SP - 1415
EP - 1423
AU - Junyi WANG
AU - Kiyomichi ARAKI
AU - Zhongzhao ZHANG
AU - Yuyuan CHANG
AU - Houtao ZHU
AU - Tsuyoshi KASHIMA
PY - 2007
DO - 10.1093/ietcom/e90-b.6.1415
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E90-B
IS - 6
JA - IEICE TRANSACTIONS on Communications
Y1 - June 2007
AB - The paper describes a low complexity tree-structure based user scheduling algorithm in an up-link transmission of MLD-based multi-user multiple-input multiple-output (MIMO) wireless systems. An M-branch selection algorithm, which selects M most-possible best branches at each step, is proposed to maximize the whole system sum-rate capacity. To achieve the maximum capacity in multi-user MIMO systems, antennas configuration and user selection are preformed simultaneously. Then according to the selected number of antennas for each user, different transmission schemes are also adopted. Both the theoretical analysis and simulation results show that the proposed algorithms obtain near optimal performance with far low complexity than the full search procedure.
ER -
English
