For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Low Complexity Centralized Scheduling Scheme for Downlink CoMP
Jing WANG Satoshi NAGATA Lan CHEN Huiling JIANG
IEICE TRANSACTIONS on Communications
Publication Date: 2015/05/01
Online ISSN: 1745-1345
Type of Manuscript: PAPER
Category: Wireless Communication Technologies
coordinated multi-point (CoMP), centralized scheduling, low complexity, scheduling indicator vector,
Full Text: PDF(1.7MB)>>
Coordinated multi-point (CoMP) transmission and reception is a promising technique for interference mitigation in cellular systems. The scheduling algorithm for CoMP has a significant impact on the network processing complexity and performance. Performing exhaustive search permits centralized scheduling and thus the optimal global solution; however, it incurs a high level of computational complexity and may be impractical or lead to high cost as well as network instability. In order to provide a more realistic scheduling method while balancing performance and complexity, we propose a low complexity centralized scheduling scheme that adaptively selects users for single-cell transmission or different CoMP scheme transmission to maximize the system weighted sum capacity. We evaluate the computational complexity and system-level simulation performance in this paper. Compared to the optimal scheduling method with exhaustive search, the proposed scheme has a much lower complexity level and achieves near optimal performance.