| Future wireless communications expect to experience a spectrum shortage problem. One practical solution is spectrum sharing. This thesis studies precoding strategies to allocate communication resources for spectrum sharing in multi-user wireless systems from a game-theoretic perspective. The approaches for the precoding games are developed under different constraints. It is shown that the precoding game with spectral mask constraints can be formulated as a convex optimization problem and a dual decomposition based algorithm can be exploited to solve it. However, the problem is non-convex if users also have total power constraints. This study shows that an efficient sub-optimal solution can be derived by allocating the bottleneck resource in the system. The sub-optimal solution is proved to be efficient and can even achieve an identical performance to that of the optimal solution in certain cases, but with significantly reduced complexity. |
