Summary: | 碩士 === 國立中正大學 === 通訊工程研究所 === 99 === Cooperative multiple point transmission / reception (CoMP) have been proposed as an approach to improve the cell-edge throughput. The fact is that each base station may have multiple users located at the cell-edge. In this thesis, we consider a cooperative serving strategy between two base stations (BSs) with precoding. We observed that finding users with precoding that maximize the throughput is a combinatorial optimization problem.
This problem has been shown to be an NP-hard problem, since for any given users, to find the optimum precoding matrices with maximal throughput is essentially an NP-hard problem. Therefore, we attempt to design a low-complexity algorithm to find an appropriate pair of users between two BSs that can be served using the same resource blocks (RBs). In the proposed scheme, the pairing problem and the design of
precoding matrix are treated separately, which makes the problem easier. Simulation results show that the proposed algorithm achieves a good performance with much lower complexity.
|