Spatial Modulation (SM) is a Multiple-Input Multiple-Output (MIMO) transmission technique which realizes low complexity implementations in wireless communication systems. Due the transmission principle of SM, only one Radio Frequency (RF) chain is required in the transmitter. Therefore, the complexity of the transmitter is lower compared to the complexity of traditional MIMO schemes, such as Spatial MultipleXing (SMX). In addition, because of the single RF chain configuration of SM, only one Power Amplifier (PA) is required in the transmitter. Hence, SM has the potential to exhibit significant Energy Efficiency (EE) benefits. At the receiver side, due to the SM transmission mechanism, detection is conducted using a low complexity (single stream) Maximum Likelihood (ML) detector. However, despite the use of a single stream detector, SM achieves a multiplexing gain. A point-to-point closed-loop variant of SM is receive space modulation. In receive space modulation, the concept of SMis extended at the receiver side, using linear precoding with Channel State Information at the Transmitter (CSIT). Even though receive space modulation does not preserve the single RF chain configuration of SM, due to the deployed linear precoding, it can be efficiently incorporated in a Space Division Multiple Access (SDMA) or in a Virtual Multiple-Input Multiple-Output (VMIMO) architecture. Inspired by the potentials of SM, the objectives of this thesis are the evaluation of the EE of SM and its extension in different forms of MIMO communication. In particular, a realistic power model for the power consumption of a Base Station (BS) is deployed in order to assess the EE of SM in terms of Mbps/J. By taking into account the whole power supply of a BS and considering a Time Division Multiple Access (TDMA) multiple access scheme, it is shown that SM is significantly more energy efficient compared to the traditional MIMO techniques. In the considered system setup, it is shown that SM is up to 67% more energy efficient compared to the benchmark systems. In addition, the concept of space modulation is researched at the receiver side. Specifically, based on the union bound technique, a framework for the evaluation of the Average Bit Error Probability (ABEP), diversity order, and coding gain of receive space modulation is developed. Because receive space modulation deploys linear precoding with CSIT, two new precoding methods which utilize imperfect CSIT are proposed. Furthermore, in this thesis, receive space modulation is incorporated in the broadcast channel. The derivation of the theoretical ABEP, diversity order, and coding gain of the new broadcast scheme is provided. It is concluded that receive space modulation is able to outperform the corresponding traditional MIMO scheme. Finally, SM, receive space modulation, and relaying are combined in order to form a novel virtual MIMO architecture. It is shown that the new architecture practically eliminates or reduces the problem of the inefficient relaying of the uncoordinated virtual MIMO space modulation architectures. This is undertaken by using precoding in a novel fashion. The evaluation of the new architecture is conducted using simulation and theoretical results.

<p>In this thesis, a practical superposition coding scheme based on multilevel low-density parity-check (LDPC) codes is proposed for discrete memoryless broadcast channels. The simulation results show that the performance of the proposed scheme approaches the information-theoretic limits. We also propose a method for optimizing the degree distribution of multilevel LDPC codes based on the analysis of EXIT functions.</p> / Master of Applied Science (MASc)

A converse method is developed for the source broadcast problem. Specifically, it is shown that the separation architecture is optimal for a variant of the source broadcast problem and the associated source-channel separation theorem can be leveraged, via a reduction argument, to establish a necessary condition for the original problem, which uni es several existing results in the literature. Somewhat surprisingly, this method, albeit based on the source-channel separation theorem, can be used to prove the optimality of non-separation based schemes and determine the performance limits in certain scenarios where the separation architecture is suboptimal. / Thesis / Master of Applied Science (MASc)

Employment of the multiple-antenna transmitters/receivers in communication systems is known as a promising solution to provide high-data-rate wireless links. In the multi-user environments, the problems of signaling and fairness for multi-antenna systems have emerged as challenging problems. This dissertation deals with these problems in several multi-antenna multi-user scenarios. In part one, a simple signaling method for the multi-antenna broadcast channels is proposed. This method reduces the MIMO broadcast system to a set of parallel channels. The proposed scheme has several desirable features in terms of: (i) accommodating users with different number of receive antennas, (ii) exploiting multi-user diversity, and (iii) requiring low feedback rate. The simulation results and analytical evaluations indicate that the achieved sum-rate is close to the sum-capacity of the underlying broadcast channel. In part two, for multiple-antenna systems with two transmitters and two receivers, a new non-cooperative scenario of data communication is studied in which each receiver receives data from both transmitters. For such a scenario, a signaling scheme is proposed which decomposes the system into two broadcast or two multi-access sub-channels. Using the decomposition scheme, it is shown that this signaling scenario outperforms the other known non-cooperative schemes in terms of the achievable multiplexing gain. In particular for some special cases, the achieved multiplexing gain is the same as the multiplexing gain of the system, where the full cooperation is provided between the transmitters and/or between the receivers. Part three investigates the problem of fairness for a class of systems for which a subset of the capacity region, which includes the sum-capacity facets, forms a polymatroid structure. The main purpose is to find a point on the sum-capacity facet which satisfies a notion of fairness among active users. This problem is addressed in the cases where the complexity of achieving interior points is not feasible, and where the complexity of achieving interior points is feasible. In part four, $K$-user memoryless interference channels are considered; where each receiver sequentially decodes the data of a subset of transmitters before it decodes the data of the designated transmitter. A greedy algorithm is developed to find the users which are decoded at each receiver and the corresponding decoding order such that the minimum rate of the users is maximized. It is proven that the proposed algorithm is optimal. The results of the parts three and four are presented for general channels which include the multiple-antenna systems as special cases.

Advancements in video coding, compact media display, and communication devices, particularly in emerging broadband wireless access networks, have created many foreseeable and exciting applications of video broadcast/multicast over the wireless meidum. For efficient and robust wireless video broadcast/multicast under fading, this thesis presents and examines a novel cross-layer framework that exploits the interplay between applying protections on a successively refinable video source and transmitting through a layered broadcast/multicast channel. The framework is realistically achieved and evaluated by using multiple description coding (MDC) on a scalable video source and using superposition coding (SPC) for layered broadcast/multicast transmissions. An analytical model using the total received/recovered video bitstreams from each coded wireless broadcast/multicast signal is developed, which serves as a metric of video quality for the system analysis and optimization. An efficient methodology has demonstrated that optimal power allocations and modulation selections can be practically determined to improve the broadcast/multicast video quality. From the information-theoretical perspective, a general closed-form formula is derived for the end-to-end distortion analysis of the proposed framework, which is applicable to any (n, k) protection code applied on a successive refinable source with a Gaussian distribution over layered Gaussian broadcast channels. The results reveal the scenarios for the proposed framework to lead to a lower distortion than a legacy system without any protection. By analyzing the characteristics of the closed-form formula, an efficient O(n log n) algorithm is developed to determine optimal k values in the (n, k) protection codes that minimize the distortion under the framework. Finally, a cross-layer design of logical SPC modulation is introduced to achieve layered broadcast/multicast for scalable video. It serves as an alternative for practically implementing the proposed framework of coded wireless video broadcast/multicast, if the hardware-based SPC component is not available in a wireless system. In summary, the thesis presents comprehensive analyses, simulations, and experiments to understand, investigate, and justify the effectiveness of the proposed cross-layer framework of coded wireless video broadcast/multicast. More importantly, this thesis contributes to the advancement in the related fields of communication engineering and information theory by introducing a new design dimension in terms of protection. This is unique when compared to previously-reported layered approaches that are often manipulating conventional parameters alone such as power and modulation scheme. The impact of this dimension was unapparent in the past, but is now proven as an effective means to enable high-quality, efficient, and robust wireless video broadcast/multicast for promising media applications.

Employment of the multiple-antenna transmitters/receivers in communication systems is known as a promising solution to provide high-data-rate wireless links. In the multi-user environments, the problems of signaling and fairness for multi-antenna systems have emerged as challenging problems. This dissertation deals with these problems in several multi-antenna multi-user scenarios. In part one, a simple signaling method for the multi-antenna broadcast channels is proposed. This method reduces the MIMO broadcast system to a set of parallel channels. The proposed scheme has several desirable features in terms of: (i) accommodating users with different number of receive antennas, (ii) exploiting multi-user diversity, and (iii) requiring low feedback rate. The simulation results and analytical evaluations indicate that the achieved sum-rate is close to the sum-capacity of the underlying broadcast channel. In part two, for multiple-antenna systems with two transmitters and two receivers, a new non-cooperative scenario of data communication is studied in which each receiver receives data from both transmitters. For such a scenario, a signaling scheme is proposed which decomposes the system into two broadcast or two multi-access sub-channels. Using the decomposition scheme, it is shown that this signaling scenario outperforms the other known non-cooperative schemes in terms of the achievable multiplexing gain. In particular for some special cases, the achieved multiplexing gain is the same as the multiplexing gain of the system, where the full cooperation is provided between the transmitters and/or between the receivers. Part three investigates the problem of fairness for a class of systems for which a subset of the capacity region, which includes the sum-capacity facets, forms a polymatroid structure. The main purpose is to find a point on the sum-capacity facet which satisfies a notion of fairness among active users. This problem is addressed in the cases where the complexity of achieving interior points is not feasible, and where the complexity of achieving interior points is feasible. In part four, $K$-user memoryless interference channels are considered; where each receiver sequentially decodes the data of a subset of transmitters before it decodes the data of the designated transmitter. A greedy algorithm is developed to find the users which are decoded at each receiver and the corresponding decoding order such that the minimum rate of the users is maximized. It is proven that the proposed algorithm is optimal. The results of the parts three and four are presented for general channels which include the multiple-antenna systems as special cases.

Advancements in video coding, compact media display, and communication devices, particularly in emerging broadband wireless access networks, have created many foreseeable and exciting applications of video broadcast/multicast over the wireless meidum. For efficient and robust wireless video broadcast/multicast under fading, this thesis presents and examines a novel cross-layer framework that exploits the interplay between applying protections on a successively refinable video source and transmitting through a layered broadcast/multicast channel. The framework is realistically achieved and evaluated by using multiple description coding (MDC) on a scalable video source and using superposition coding (SPC) for layered broadcast/multicast transmissions. An analytical model using the total received/recovered video bitstreams from each coded wireless broadcast/multicast signal is developed, which serves as a metric of video quality for the system analysis and optimization. An efficient methodology has demonstrated that optimal power allocations and modulation selections can be practically determined to improve the broadcast/multicast video quality. From the information-theoretical perspective, a general closed-form formula is derived for the end-to-end distortion analysis of the proposed framework, which is applicable to any (n, k) protection code applied on a successive refinable source with a Gaussian distribution over layered Gaussian broadcast channels. The results reveal the scenarios for the proposed framework to lead to a lower distortion than a legacy system without any protection. By analyzing the characteristics of the closed-form formula, an efficient O(n log n) algorithm is developed to determine optimal k values in the (n, k) protection codes that minimize the distortion under the framework. Finally, a cross-layer design of logical SPC modulation is introduced to achieve layered broadcast/multicast for scalable video. It serves as an alternative for practically implementing the proposed framework of coded wireless video broadcast/multicast, if the hardware-based SPC component is not available in a wireless system. In summary, the thesis presents comprehensive analyses, simulations, and experiments to understand, investigate, and justify the effectiveness of the proposed cross-layer framework of coded wireless video broadcast/multicast. More importantly, this thesis contributes to the advancement in the related fields of communication engineering and information theory by introducing a new design dimension in terms of protection. This is unique when compared to previously-reported layered approaches that are often manipulating conventional parameters alone such as power and modulation scheme. The impact of this dimension was unapparent in the past, but is now proven as an effective means to enable high-quality, efficient, and robust wireless video broadcast/multicast for promising media applications.

The demand for wireless data services has been dramatically growing over the last decade. This growth has been accompanied by a significant increase in the number of users sharing the same wireless medium, and as a result, interference management has become a hot topic of research in recent years. In this dissertation, we investigate feedback and transmitter cooperation as two closely related tools to manage the interference and achieve high data rates in several wireless networks, focusing on additive white Gaussian noise (AWGN) interference, X, and broadcast channels. We start by a one-to-many network, namely, the three-user multiple-input multiple-output (MIMO) Gaussian broadcast channel, where we assume that the transmitter obtains the channel state information (CSI) through feedback links after a finite delay. We also assume that the feedback delay is greater than the channel coherence time, and thus, the CSI expires prior to being exploited by the transmitter for its current transmission. Nevertheless, we show that this delayed CSI at the transmitter (delayed CSIT) can help the transmitter to achieve significantly higher data rates compared to having no CSI. We indeed show that delayed CSIT increases the channel degrees of freedom (DoF), which is translated to an unbounded increase in capacity with increasing signal-to-noise-ratio (SNR). For the symmetric case, i.e. with the same number of antennas at each receiver, we propose different transmission schemes whose achievable DoFs meet the upper bound for a wide range of transmit-receive antenna ratios. Also, for the general non-symmetric case, we propose transmission schemes that characterize the DoF region for certain classes of antenna configurations. Subsequently, we investigate channels with distributed transmitters, namely, Gaussian single-input single-output (SISO) K-user interference channel and 2×K X channel under the delayed CSIT assumption. In these channels, in major contrast to the broadcast channel, each transmitter has access only to its own messages. We propose novel multiphase transmission schemes wherein the transmitters collaboratively align the past interference at appropriate receivers using the knowledge of past CSI. Our achievable DoFs are greater than one (which is the channel DoF without CSIT), and strictly increasing in K. Our results are yet the best available reported DoFs for these channels with delayed CSIT. Furthermore, we consider the K-user r-cyclic interference channel, where each transmitter causes interference on only r receivers in a cyclic manner. By developing a new upper bound, we show that this channel has K/r DoF with no CSIT. Moreover, by generalizing our multiphase transmission ideas, we show that, for r=3, this channel can achieve strictly greater than K/3 DoF with delayed CSIT. Next, we add the capability of simultaneous transmission and reception, i.e. full-duplex operation, to the transmitters, and investigate its impact on the DoF of the SISO Gaussian K-user interference and M×K X channel under the delayed CSIT assumption. By proposing new cooperation/alignment techniques, we show that the full-duplex transmitter cooperation can potentially yield DoF gains in both channels with delayed CSIT. This is in sharp contrast to the previous results on these channels indicating the inability of full-duplex transmitter cooperation to increase the channel DoF with either perfect instantaneous CSIT or no CSIT. With the recent technological advances in implementation of full-duplex communication, it is expected to play a crucial role in the future wireless systems. Finally, we consider the Gaussian K-user interference and K×K X channel with output feedback, wherein each transmitter causally accesses the output of its paired receiver. First, using the output feedback and under no CSIT assumption, we show that both channels can achieve DoF values greater than one, strictly increasing in K, and approaching the limiting value of 2 as K→∞. Then, we develop transmission schemes for the same channels with both output feedback and delayed CSIT, known as Shannon feedback. Our achievable DoFs with Shannon feedback are greater than those with the output feedback for almost all values of K.

Diversity methods are used to improve the reliability of the communication between transmitter and receiver. These methods use redundancy to reduce the errors in the communication link. Apart from the conventional diversity methods, multiuser diversity has an aim of maximizing the sum capacity of a multi-user system. To benefit from multiuser diversity, the opportunistic scheduling method grants the channel access to the user which has the best channel quality among all users. Therefore, the cumulative sum of the information sent to all users, which is the sum capacity, is maximized in the long term. Although the opportunistic scheduling maximizes the sum capacity, it has some drawbacks such as the feedback load growing with the number of users and the problem of fairness for the users which may have lower channel quality than some other users. In this thesis, these two issues are investigated for the broadcast channels. Feedback quantization, which gives partial information on the channel state, is studied to mitigate the feedback load with a goal of little loss in the sum capacity. The thresholds for the finite feedback quantization are determined to provide fairness and to reduce the feedback load at the same time. To provide fairness, users are grouped into clusters and thresholds are optimized for each cluster. A method is proposed by extending the one given by Floren et. al. to solve the mentioned problems and the proposed method is compared with some other scheduling methods in the literature.

In an energy harvesting communication system, energy is derived from outside sources and becomes partially available at different points in time. The constraints induced by this property on energy consumption plays an active role in the design of efficient communication systems. This thesis focuses on the optimal design of transmission and networking schemes for energy harvesting wireless communication systems. In particular, an energy harvesting transmitter broadcasting data to two receivers in an AWGN broadcast channel assuming that energy harvests and data arrivals occur at known instants is considered. In this system, optimal packet scheduling that achieves minimum delay is analyzed. An iterative algorithm, DuOpt, that achieves the same structural properties as the optimal schedule is proposed. DuOpt is proved to obtain the optimal solution when weaker user data is ready at the beginning. A dual problem is defined and shown to be strictly convex. Taking advantage of the dual problem, uniqueness of the solution of the main problem is proved. Finally, it is observed that DuOpt is almost two orders of magnitude faster than the SUMT (sequential unconstrained minimization technique) algorithm that solves the same problem.