Download the full-sized PDF
Permanent link (DOI): https://doi.org/10.7939/R3RM5S
This file is in the following communities:
|Graduate Studies and Research, Faculty of|
This file is in the following collections:
|Theses and Dissertations|
Analysis and Improvement of Achievable Data Rates in Multi-Way Relay Channels Open Access
- Other title
Multi-way relay channels
Wireless relay networks
Achievable data rate
- Type of item
- Degree grantor
University of Alberta
- Author or creator
- Supervisor and department
Ardakani, Masoud (Electrical and Computer Engineering)
- Examining committee member and department
Tellambura, Chintha (Electrical and Computer Engineering)
Doucette, John (Mechanical Engineering)
Jing, Yindi (Electrical and Computer Engineering)
Ghrayeb, Ali (Electrical and Computer Engineering, Concordia University)
Department of Electrical and Computer Engineering
- Date accepted
- Graduation date
Doctor of Philosophy
- Degree level
Increasing demand for bandwidth-hungry applications, along with the bandwidth scarcity has generated a certain momentum toward designing bandwidth-efficient techniques. Recently, multi-way relay channels (MWRCs) have been proposed to improve the spectral efficiency in wireless systems. The main focus of this dissertation is studying the achievable rates of MWRCs as well as proposing methods to improve it. In the first part of our work, we focus on the users’ bit mapping and propose a new mapping for phase-shift keying modulation which increases the achievable rate and decreases the bit error rate of a pairwise MWRC. Interestingly, our proposed mapping outperforms the well-known Gray mapping in terms of both metrics on an additive white Gaussian noise (AWGN) channel.
Then, the achievable rates of a pairwise MWRC, with a simple memoryless relay, where the communication happens over a fading channel with AWGN is studied. For this setup, we determine what relaying strategy suits best based on the system’s signal-to-noise ratio.
Later, we extend our rate analysis to the case where the relay is more complex and has
memory. First, a symmetric MWRC with AWGN is considered. For this setup, the capacity gap of different relaying strategies are derived and then they are compared with that of one-way relaying. Second, we consider a pairwise MWRC where the links are asymmetric. We show that the system’s achievable rate is dependent on the users’ transmission pairing in this case. An optimal pairing to maximize the achievable rate is also found.
In the last part of our contributions, erasure MWRCs are the subject of interest. For
such channels, we derive an upper bound on the system’s achievable rate and also propose low-latency data sharing schemes based on fountain coding. Further, we define a measure, called end-to-end erasure rate, which is used to compare the performance of our proposed schemes with the rate upper bound and the achievable rate of one-way relaying.
Summarily speaking, in the MWRCs’ setups studied in this dissertation, multi-way relaying is beneficial when the number of users and the error (erasure) rate are not large. Otherwise, one-way relaying may provide higher data rates.
- 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
- 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: 2343422
Last modified: 2015:10:12 14:23:17-06:00
Original checksum: 15c42d5328d781ca0482e1a16737c823
Well formed: false
Status message: Invalid Font entry in Resources offset=2336539
Page count: 119