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. / Communications
Identifer | oai:union.ndltd.org:LACETR/oai:collectionscanada.gc.ca:AEU.10048/580 |
Date | 11 1900 |
Creators | Gao, Jie |
Contributors | Vorobyov, Sergiy A. (Electrical and Computer Engineering), Jiang, Hai (Electrical and Computer Engineering), Poliquin, René (Mathematical and Statistical Sciences), Zhao, H. Vicky (Electrical and Computer Engineering) |
Source Sets | Library and Archives Canada ETDs Repository / Centre d'archives des thèses électroniques de Bibliothèque et Archives Canada |
Language | en_US |
Detected Language | English |
Type | Thesis |
Format | 1345009 bytes, application/pdf |
Relation | J. Gao, S. A. Vorobyov, and H. Jiang, “Game theoretic solutions for precoding strategies over the interference channel,” in Proc. IEEE Global Telecommunications Conference (GLOBECOM) 2008., J. Gao, S. A. Vorobyov, and H. Jiang, “Game theory for precoding in a multi-user system: Bargaining for overall benefits,” in Proc. IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP) 2009. |
Page generated in 0.0015 seconds