Virtual-MIMO systems with compress-and-forward cooperation

Multiple-input multiple-output (MIMO) systems have recently emerged as one of the most significant wireless techniques, as they can greatly improve the channel capacity and link reliability of wireless communications. These benefits have encouraged extensive research on a virtual MIMO system where the transmitter has multiple antennas and each of the receivers has a single antenna. Single-antenna receivers can work together to form a virtual antenna array and reap some performance benefits of MIMO systems. The idea of receiver-side local cooperation is attractive for wireless networks since a wireless receiver may not have multiple antennas due to size and cost limitations. In this thesis we investigate a virtual-MIMO wireless system using the receiver-side cooperation with the compress-and-forward (CF) protocol. Firstly, to perform CF at the relay, we propose to use standard source coding techniques, based on the analysis of its expected rate bound and the tightness of the bound. We state upper bounds on the system error probabilities over block fading channels. With sufficient source coding rates, the cooperation of the receivers enables the virtual-MIMO system to achieve almost ideal MIMO performance. A comparison of ideal and non-ideal conference links within the receiver group is also investigated. Considering the short-range communication and using a channel-aware adaptive CF scheme, the impact of the non-ideal cooperation link is too slight to impair the system performance significantly. It is also evident that the practicality of CF cooperation will be greatly enhanced if a efficient source coding technique can be used at the relay. It is even more desirable that CF cooperation should not be unduly sensitive to carrier frequency offsets (CFOs). Thus this thesis then presents a practical study of these two issues. Codebook designs of the Voronoi VQ and the tree-structure vector quantization (TSVQ) to enable CF cooperation at the relay are firstly described. A comparison in terms of the codebook design complexity and encoding complexity is presented. It is shown that the TSVQ is much simpler to design and operate, and can achieve a favourable performance-complexity tradeoff. We then demonstrate that CFO can lead to significant performance degradation for the virtual MIMO system. To overcome it, it is proposed to maintain clock synchronization and jointly estimate the CFO between the relay and the destination. This approach is shown to provide a significant performance improvement. Finally, we extend the study to the minimum mean square error (MMSE) detection, as it has a lower complexity compared to maximum likelihood (ML) detection. A closed-form upper bound for the system error probability is derived, based on which we prove that the smallest singular value of the cooperative channel matrix determines the system error performance. Accordingly, an adaptive modulation and cooperation scheme is proposed, which uses the smallest singular value as the threshold strategy. Depending on the instantaneous channel conditions, the system could therefore adapt to choose a suitable modulation type for transmission and an appropriate quantization rate to perform CF cooperation. The adaptive modulation and cooperation scheme not only enables the system to achieve comparable performance to the case with fixed quantization rates, but also eliminates unnecessary complexity for quantization operations and conference link communication

Lecture Notes on Network Information Theory

These lecture notes have been converted to a book titled Network Information Theory published recently by Cambridge University Press. This book provides a significantly expanded exposition of the material in the lecture notes as well as problems and bibliographic notes at the end of each chapter. The authors are currently preparing a set of slides based on the book that will be posted in the second half of 2012. More information about the book can be found at http://www.cambridge.org/9781107008731/. The previous (and obsolete) version of the lecture notes can be found at http://arxiv.org/abs/1001.3404v4/

Optimal Power Allocation for a Successive Refinable Source with Multiple Descriptions over a Fading Relay Channel Using Broadcast/Multicast Strategies

In a wireless fading relay system with multicast/broadcast transmission, one of the most crucial challenges is the optimization of a transmission rate under multiuser channel diversity. Previously reported solutions for mitigating the vicious effect due to multi-user channel diversity have been mainly based on superposition coded multicast, where an optimal power allocation to each layer of modulated signals is determined. Many previous studies investigated a harmonic interplay between the successively re nable (SR) content source and a layered modulation via superposition coding (SPC) over the multicast/broadcast channels. By jointly considering the successive re nement characteristic at the source and the dependency of the layered modulation at the channel, a graceful fexibility can be achieved on a group of users with di erent channel realizations. Here most of the receivers are supposed to obtain the base quality layer information modulated in a lower rate, while the receivers with better channel realizations will obtain more information by re ning the base quality layer information using the enhancement quality layer information. In particular, the optimal power allocation for a SR source over a fading relay channel using broadcast/multicast strategy can be determined such that the minimum distortion of total received information is produced. However, a quality layer of data in a successively refined source may not be decodable if there is any loss of channel codewords, even if the corresponding longterm channel realization is su cient for decoding. To overcome this problem, one of the previous studies introduced a framework of coded video multicast, where multiple description coding (MDC) is applied to an SR content source and is further mapped into a layered modulation via SPC at the channel. Up till now, there has not been a rigorous proof provided on the bene t of manipulating the two coding techniques, (i.e. MDC and SPC), nor has any systematic optimization approach been developed for quantifying the parameter selection. Cooperative relaying in wireless networks has recently received much attention. Because the received signal can be severely degraded due to fading in wireless communications, time, frequency and spatial diversity techniques are introduced to overcome fading. Spatial diversity is typically envisioned as having multiple transmit and/or receive antennas. Cooperation can be used here to provide higher rates and results in a more robust system. Recently proposed cooperation schemes, which take into account the practical constraint that the relay cannot transmit and receive at the same time, include amplify-forward(AF), decode-forward(DF), and compress-forward(CF). In this study, in a fading relay scenario, a proposed framework is investigated to tackle the task of layered power allocation, where an in-depth study is conducted on achieving an optimal power allocation in SPC, such that the information distortion perceived at the users can be minimized. This thesis provides a comprehensive formulation on the information distortion at the receivers and a suite of solution approaches for the developed optimization problem by jointly considering MDC and SPC parameter selection over the fading relay channel

Everlasting Secrecy by Exploiting Eavesdropper\u27s Receiver Non-Idealities

This dissertation focuses on secrecy, which is a primary concern in modern communication. Secrecy has traditionally been obtained by cryptography, which is based on assumptions on current and future computational capabilities of the eavesdropper. However, there are numerous examples of cryptographic schemes being broken that were supposedly secure, often when the signal was recorded by the adversary for later processing. This motivates seeking types of secrecy that are provably everlasting for sensitive applications. The desire for such everlasting security suggests considering information-theoretic approaches, where the eavesdropper cannot extract any information about the secret message from the received signal. However, since the location and channel state information of a passive eavesdropper is generally unknown, it is challenging to know whether the advantage required to achieve information-theoretic security for a given scenario is provided, and thus attempting to obtain information-theoretic security via commonly-envisioned approaches leads to a significant risk in wireless communication. In this dissertation, we present a new perspective on how to generate the necessary information-theoretic advantage required for secret communication in the wireless environment. The proposed technique does not rely on the channel between the transmitter and the eavesdropper\u27s receiver because we exploit receiver\u27s processing effects for security. In particular, we attack the eavesdropper\u27s analog-to-digital (A/D) converter to generate the advantage required to obtain information-theoretic secrecy, as follows. Based on a key pre-shared between the legitimate nodes that only needs to be kept secret during transmission (and we pessimistically assume it will be handed to the adversary immediately afterward) we insert intentional distortion on the transmitted signal. Since the intended recipient of the signal knows the key and hence the distortion, it can undo the distortion before his/her A/D, whereas the eavesdropper must store the signal in memory and try to compensate for the distortion after the A/D conversion. Since the A/D is necessarily a non-linear component of the receiver, the operations are not necessarily commutative and there is the potential for information-theoretic security. This dissertation studies two practical instantiations of this approach to obtain everlasting secrecy against eavesdroppers with different hardware capabilities. As a first step, the transmitted signal is modulated by two vastly different power levels at the transmitter based on the key. Since the intended recipient knows the key, he/she can undo the power modulation before the A/D, putting the signal in the appropriate range for analog-to-digital conversion. The eavesdropper, on the other hand, must compromise between larger quantization noise and more A/D overflows, and thus will lose information required to recover the message. Hence, information-theoretic security is obtained. We show that this method can provide information-theoretic secrecy even when the eavesdropper has perfect access to the output of the transmitter, and even when the eavesdropper has an A/D that has better quality than the legitimate receiver\u27s A/D. A risk of the power modulation approach is a sophisticated eavesdropper with multiple A/Ds. In our second approach, in order to attack such an eavesdropper, we introduce the idea of adding random jamming (based on the ephemeral key) to the signal. In this case the intended recipient can simply subtract off the jamming signal and its signal will be well-matched to the span of its A/D converter, while the eavesdropper has difficulty because it does not know the key during transmission: if it does not change the span of the A/D, it will lose information due to A/D overflows, and, if it enlarges the span of the A/D to cover all possible received signal values, the width of each quantization level will be increased, and thus the eavesdropper will lose information due to high quantization noise. Hence, the desired advantage for information-theoretic secrecy is obtained. Finally, we study the combination of random jamming and frequency hopping in wideband channels, and show that considering the current fundamental limits of analog-to-digital conversion, this method can provide everlasting secrecy in wireless environments against any eavesdropper