ERA

Download the full-sized PDF of Reduced-Complexity User and Data-Stream Scheduling for Multiuser MIMO DownlinkDownload the full-sized PDF

Analytics

Share

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

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

Reduced-Complexity User and Data-Stream Scheduling for Multiuser MIMO Downlink Open Access

Descriptions

Other title
Subject/Keyword
simulated annealing
scheduling algorithms
MIMO
Type of item
Thesis
Degree grantor
University of Alberta
Author or creator
Misiewicz, Marcin M
Supervisor and department
Krzymien, Witold (Electrical and Computer Engineering)
Examining committee member and department
Tellambura, Chintha (Electrical and Computer Engineering)
Khabbazian, Majid (Electrical and Computer Engineering)
Department
Department of Electrical and Computer Engineering
Specialization
Communications
Date accepted
2013-09-27T14:55:33Z
Graduation date
2013-11
Degree
Master of Science
Degree level
Master's
Abstract
We consider the scheduling problem in multiuser multiple-input multiple-output (MIMO) systems with successive zero-forcing precoding and coordinated transmit-receive processing. Focusing specifically on the problem of user and data stream scheduling, we allow variable number of data streams per user. Optimal scheduling employing exhaustive search for a constant number of streams per user is already combinatorially complex, and is further compounded by allowing for a variable number of streams per user. We consider a suboptimal metaheuristic scheduling algorithm based on simulated annealing, an algorithm which has shown to provide quick and relatively good solutions to combinatorial optimization problems. We introduce various parameters and examine their impact on the performance of the algorithm. Simulated annealing is shown to offer comparable results at a fraction of the computational cost of the exhaustive search. Our contributions to this area are emphasized in the conclusion and future areas of work are discussed.
Language
English
DOI
doi:10.7939/R3MP4VZ74
Rights
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 these terms. The author reserves all other publication and other rights in association with the copyright in the thesis and, except as herein before 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-04-29T17:53:07.365+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: 1297534
Last modified: 2015:10:12 19:11:28-06:00
Filename: Marcin_Misiewicz_Fall 2013.pdf
Original checksum: 8fc6aa6c716b2bdca35423d247a6e932
Well formed: false
Valid: false
Status message: Unexpected exception java.lang.ClassCastException
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=4777
Page count: 116
Activity of users you follow
User Activity Date