Download the full-sized PDF of Low-Complexity Detection Techniques for MIMO and Cooperative NetworksDownload the full-sized PDF



Permanent link (DOI):


Export to: EndNote  |  Zotero  |  Mendeley


This file is in the following communities:

Graduate Studies and Research, Faculty of


This file is in the following collections:

Theses and Dissertations

Low-Complexity Detection Techniques for MIMO and Cooperative Networks Open Access


Other title
Sphere Detection
Type of item
Degree grantor
University of Alberta
Author or creator
Han, Shuangshuang
Supervisor and department
Tellambura, Chintha (Electrical and Computer Engineering)
Examining committee member and department
Cockburn, Bruce (Electrical and Computer Engineering)
MacGregor, Mike (Computing Science)
Wang, Xianbin (Department of Electrical and Computer Engineering, The University of Western Ontario)
Jiang, Hai (Electrical and Computer Engineering)
Tellambura, Chintha (Electrical and Computer Engineering)
Department of Electrical and Computer Engineering
Date accepted
Graduation date
Doctor of Philosophy
Degree level
This thesis investigates detection technologies for multiple-input multiple-output (MIMO) systems and cooperative communications. The exploitation of detection methods and relay strategies to achieve near-optimal performance (measured by symbol error rate or minimum mean squared error) and reductions of the running time of detection methods are the main focus of this thesis. A signal-to-noise ratio (SNR)-dependent radius control sphere detector (SD) algorithm, a general framework of statistical pruning SD, and an improved K-best SD are proposed. These SD algorithms reduce the detection running time in terms of the average number of visited nodes, with negligible performance loss compared with that of optimal maximum likelihood (ML) detection. In order to optimize the MIMO relay performance, an estimate-and-forward (EF) relay strategy is also developed. The emerging trend towards large MIMO and cooperative communication systems makes the development of low running time strategies with near-optimal performance more important. Thus, an EF list generated by SD is also proposed to reduce the number of computational operations for the EF scheme in large MIMO relay networks; this method is called list EF. Overall, the research findings should help to reduce the running time and improve the reliability of detection algorithms, to achieve a desirable trade-off between running time and performance, and to provide efficiently-implementable MIMO and cooperative detection algorithms.
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
Audit Status
Audits have not yet been run on this file.
File format: pdf (Portable Document Format)
Mime type: application/pdf
File size: 1426186
Last modified: 2015:10:12 16:44:07-06:00
Filename: Han_Shuangshuang_Fall 2013.pdf
Original checksum: 1fc45cbf32715d58a8643092833ee876
Well formed: true
Valid: true
Status message: Too many fonts to report; some fonts omitted. Total fonts = 1164
File title: Shuangshuang_Title Page
Page count: 148
Activity of users you follow
User Activity Date