On Outage Probability and Diversity-Multiplexing Tradeoff in MIMO Relay Channels

Fading MIMO relay channels are studied analytically, when the source and destination are equipped with multiple antennas and the relays have a single one. Compact closed-form expressions are obtained for the outage probability under i.i.d. and correlated Rayleigh-fading links. Low-outage approximations are derived, which reveal a number of insights, including the impact of correlation, of the number of antennas, of relay noise and of relaying protocol. The effect of correlation is shown to be negligible, unless the channel becomes almost fully correlated. The SNR loss of relay fading channels compared to the AWGN channel is quantified. The SNR-asymptotic diversity-multiplexing tradeoff (DMT) is obtained for a broad class of fading distributions, including, as special cases, Rayleigh, Rice, Nakagami, Weibull, which may be non-identical, spatially correlated and/or non-zero mean. The DMT is shown to depend not on a particular fading distribution, but rather on its polynomial behavior near zero, and is the same for the simple "amplify-and-forward" protocol and more complicated "decode-and-forward" one with capacity achieving codes, i.e. the full processing capability at the relay does not help to improve the DMT. There is however a significant difference between the SNR-asymptotic DMT and the finite-SNR outage performance: while the former is not improved by using an extra antenna on either side, the latter can be significantly improved and, in particular, an extra antenna can be traded-off for a full processing capability at the relay. The results are extended to the multi-relay channels with selection relaying and typical outage events are identified.Comment: accepted by IEEE Trans. on Comm., 201

From Multi-Keyholes to Measure of Correlation and Power Imbalance in MIMO Channels: Outage Capacity Analysis

An information-theoretic analysis of a multi-keyhole channel, which includes a number of statistically independent keyholes with possibly different correlation matrices, is given. When the number of keyholes or/and the number of Tx/Rx antennas is large, there is an equivalent Rayleigh-fading channel such that the outage capacities of both channels are asymptotically equal. In the case of a large number of antennas and for a broad class of fading distributions, the instantaneous capacity is shown to be asymptotically Gaussian in distribution, and compact, closed-form expressions for the mean and variance are given. Motivated by the asymptotic analysis, a simple, full-ordering scalar measure of spatial correlation and power imbalance in MIMO channels is introduced, which quantifies the negative impact of these two factors on the outage capacity in a simple and well-tractable way. It does not require the eigenvalue decomposition, and has the full-ordering property. The size-asymptotic results are used to prove Telatar's conjecture for semi-correlated multi-keyhole and Rayleigh channels. Since the keyhole channel model approximates well the relay channel in the amplify-and-forward mode in certain scenarios, these results also apply to the latterComment: accepted by IEEE IT Trans., 201

DMT Optimality of LR-Aided Linear Decoders for a General Class of Channels, Lattice Designs, and System Models

The work identifies the first general, explicit, and non-random MIMO encoder-decoder structures that guarantee optimality with respect to the diversity-multiplexing tradeoff (DMT), without employing a computationally expensive maximum-likelihood (ML) receiver. Specifically, the work establishes the DMT optimality of a class of regularized lattice decoders, and more importantly the DMT optimality of their lattice-reduction (LR)-aided linear counterparts. The results hold for all channel statistics, for all channel dimensions, and most interestingly, irrespective of the particular lattice-code applied. As a special case, it is established that the LLL-based LR-aided linear implementation of the MMSE-GDFE lattice decoder facilitates DMT optimal decoding of any lattice code at a worst-case complexity that grows at most linearly in the data rate. This represents a fundamental reduction in the decoding complexity when compared to ML decoding whose complexity is generally exponential in rate. The results' generality lends them applicable to a plethora of pertinent communication scenarios such as quasi-static MIMO, MIMO-OFDM, ISI, cooperative-relaying, and MIMO-ARQ channels, in all of which the DMT optimality of the LR-aided linear decoder is guaranteed. The adopted approach yields insight, and motivates further study, into joint transceiver designs with an improved SNR gap to ML decoding.Comment: 16 pages, 1 figure (3 subfigures), submitted to the IEEE Transactions on Information Theor

Throughput Scaling of Wireless Networks With Random Connections

This work studies the throughput scaling laws of ad hoc wireless networks in the limit of a large number of nodes. A random connections model is assumed in which the channel connections between the nodes are drawn independently from a common distribution. Transmitting nodes are subject to an on-off strategy, and receiving nodes employ conventional single-user decoding. The following results are proven: 1) For a class of connection models with finite mean and variance, the throughput scaling is upper-bounded by $O(n^{1/3})$ for single-hop schemes, and $O(n^{1/2})$ for two-hop (and multihop) schemes. 2) The $\Theta (n^{1/2})$ throughput scaling is achievable for a specific connection model by a two-hop opportunistic relaying scheme, which employs full, but only local channel state information (CSI) at the receivers, and partial CSI at the transmitters. 3) By relaxing the constraints of finite mean and variance of the connection model, linear throughput scaling $\Theta (n)$ is achievable with Pareto-type fading models.Comment: 13 pages, 4 figures, To appear in IEEE Transactions on Information Theor

Wireless transmission protocols using relays for broadcast and information exchange channels

Relays have been used to overcome existing network performance bottlenecks in meeting the growing demand for large bandwidth and high quality of service (QoS) in wireless networks. This thesis proposes several wireless transmission protocols using relays in practical multi-user broadcast and information exchange channels. The main theme is to demonstrate that efficient use of relays provides an additional dimension to improve reliability, throughput, power efficiency and secrecy. First, a spectrally efficient cooperative transmission protocol is proposed for the multiple-input and singleoutput (MISO) broadcast channel to improve the reliability of wireless transmission. The proposed protocol mitigates co-channel interference and provides another dimension to improve the diversity gain. Analytical and simulation results show that outage probability and the diversity and multiplexing tradeoff of the proposed cooperative protocol outperforms the non-cooperative scheme. Second, a two-way relaying protocol is proposed for the multi-pair, two-way relaying channel to improve the throughput and reliability. The proposed protocol enables both the users and the relay to participate in interference cancellation. Several beamforming schemes are proposed for the multi-antenna relay. Analytical and simulation results reveal that the proposed protocol delivers significant improvements in ergodic capacity, outage probability and the diversity and multiplexing tradeoff if compared to existing schemes. Third, a joint beamforming and power management scheme is proposed for multiple-input and multiple-output (MIMO) two-way relaying channel to improve the sum-rate. Network power allocation and power control optimisation problems are formulated and solved using convex optimisation techniques. Simulation results verify that the proposed scheme delivers better sum-rate or consumes lower power when compared to existing schemes. Fourth, two-way secrecy schemes which combine one-time pad and wiretap coding are proposed for the scalar broadcast channel to improve secrecy rate. The proposed schemes utilise the channel reciprocity and employ relays to forward secret messages. Analytical and simulation results reveal that the proposed schemes are able to achieve positive secrecy rates even when the number of users is large. All of these new wireless transmission protocols help to realise better throughput, reliability, power efficiency and secrecy for wireless broadcast and information exchange channels through the efficient use of relays

Quantifying Potential Energy Efficiency Gain in Green Cellular Wireless Networks

Conventional cellular wireless networks were designed with the purpose of providing high throughput for the user and high capacity for the service provider, without any provisions of energy efficiency. As a result, these networks have an enormous Carbon footprint. In this paper, we describe the sources of the inefficiencies in such networks. First we present results of the studies on how much Carbon footprint such networks generate. We also discuss how much more mobile traffic is expected to increase so that this Carbon footprint will even increase tremendously more. We then discuss specific sources of inefficiency and potential sources of improvement at the physical layer as well as at higher layers of the communication protocol hierarchy. In particular, considering that most of the energy inefficiency in cellular wireless networks is at the base stations, we discuss multi-tier networks and point to the potential of exploiting mobility patterns in order to use base station energy judiciously. We then investigate potential methods to reduce this inefficiency and quantify their individual contributions. By a consideration of the combination of all potential gains, we conclude that an improvement in energy consumption in cellular wireless networks by two orders of magnitude, or even more, is possible.Comment: arXiv admin note: text overlap with arXiv:1210.843

Data mixing at the source, relay, and in the air in multiple-access relay networks

The concept of cooperative relay is an essential technique for future cellular networks such as wireless mesh networking or wireless ad-hoc networking. In a practical relay network, channel coding, network coding, and antenna arrays, will coexist and yet the joint optimization of these conventional coding schemes and cooperative relay is not well understood. To build a design guideline for relay network, this dissertation develop a joint optimization methodology for multiple coding schemes in multiple access relay network. There are four major contributions in this thesis: First, we jointly optimize conventional coding schemes and radio resources of multiple access relay network with multiple antennas. The combined design of MIMO transmission modes, channel coding at the source, network coding at the relay have been investigated. We develop optimal design rule that minimize the end-to-end error probability. Second, we derive the fundamental tradeoff between achievable rate and reliability of multiple access relay network with multiple antennas. We consider three MIMO transmission modes, spatial multiplexing (SM), Alamouti coding as transmit diversity (TD), and Golden Coding, and random linear network coding at the relay. We compare the average decoding error probability of each transmission mode. Third, we present an interference cancellation scheme for multi-user MIMO. The proposed Log-likelihood-ratio (LLR) ordered successive interference cancellation (SIC) scheme provides 1 ~ 3 dB gain over the conventional SNR-ordered SIC and the gain increases with increasing number of users. Finally, we present a new architecture for MIMO receivers that cancel the co-channel interference (CCI) using a single radio frequency (RF) and baseband (BB) chain, while still achieving nearly the same bit error rate that can be provided by the conventional receiver requiring multiple RF/BB chains