ERA

Download the full-sized PDF of Cooperative linear precoding for spectrum sharing in multi-user wireless systems: game theoretic approachDownload the full-sized PDF

Analytics

Share

Permanent link (DOI): https://doi.org/10.7939/R37595

Download

Export to: EndNote  |  Zotero  |  Mendeley

Communities

This file is in the following communities:

Graduate Studies and Research, Faculty of

Collections

This file is in the following collections:

Theses and Dissertations

Cooperative linear precoding for spectrum sharing in multi-user wireless systems: game theoretic approach Open Access

Descriptions

Other title
Subject/Keyword
spectrum sharing
linear precoding
multi-user systems
Nash bargaining
game theory
Type of item
Thesis
Degree grantor
University of Alberta
Author or creator
Gao, Jie
Supervisor and department
Vorobyov, Sergiy A. (Electrical and Computer Engineering)
Jiang, Hai (Electrical and Computer Engineering)
Examining committee member and department
Zhao, H. Vicky (Electrical and Computer Engineering)
Poliquin, René (Mathematical and Statistical Sciences)
Department
Department of Electrical and Computer Engineering
Specialization

Date accepted
2009-09-01T17:47:18Z
Graduation date
2009-11
Degree
Master of Science
Degree level
Master's
Abstract
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.
Language
English
DOI
doi:10.7939/R37595
Rights
License granted by Jie Gao (jgao3@ualberta.ca) on 2009-08-28T05:32:28Z (GMT): Permission is hereby granted to the University of Alberta Libraries to reproduce single copies of this thesis and to lend or sell such copies for private, scholarly or scientific research purposes only. Where the thesis is converted to, or otherwise made available in digital form, the University of Alberta will advise potential users of the thesis of the above terms. The author reserves all other publication and other rights in association with the copyright in the thesis, and except as herein provided, neither the thesis nor any substantial portion thereof may be printed or otherwise reproduced in any material form whatsoever without the author's prior written permission.
Citation for previous publication

File Details

Date Uploaded
Date Modified
2014-05-01T04:23:04.697+00:00
Audit Status
Audits have not yet been run on this file.
Characterization
File format: pdf (Portable Document Format)
Mime type: application/pdf
File size: 1345009
Last modified: 2015:10:12 21:21:24-06:00
Filename: Jie_MSThesis.pdf
Original checksum: 9815f5318fa2b22c5676c0be66f99bc0
Well formed: false
Valid: false
Status message: Invalid page tree node offset=1343809
Status message: Unexpected error in findFonts java.lang.ClassCastException: edu.harvard.hul.ois.jhove.module.pdf.PdfSimpleObject cannot be cast to edu.harvard.hul.ois.jhove.module.pdf.PdfDictionary offset=45323
Page count: 54
Activity of users you follow
User Activity Date