Cooperative Symbol-Based Signaling for Networks with Multiple Relays

Wireless channels suffer from severe inherent impairments and hence reliable and high data rate wireless transmission is particularly challenging to achieve. Fortunately, using multiple antennae improves performance in wireless transmission by providing space diversity, spatial multiplexing, and power gains. However, in wireless ad-hoc networks multiple antennae may not be acceptable due to limitations in size, cost, and hardware complexity. As a result, cooperative relaying strategies have attracted considerable attention because of their abilities to take advantage of multi-antenna by using multiple single-antenna relays. This study is to explore cooperative signaling for different relay networks, such as multi-hop relay networks formed by multiple single-antenna relays and multi-stage relay networks formed by multiple relaying stages with each stage holding several single-antenna relays. The main contribution of this study is the development of a new relaying scheme for networks using symbol-level modulation, such as binary phase shift keying (BPSK) and quadrature phase shift keying (QPSK). We also analyze effects of this newly developed scheme when it is used with space-time coding in a multi-stage relay network. Simulation results demonstrate that the new scheme outperforms previously proposed schemes: amplify-and-forward (AF) scheme and decode-and-forward (DF) scheme

Distributed Space-Time Message Relaying for Uncoded/Coded Wireless Cooperative Communications

During wireless communications, nodes can overhear other transmissions through the wireless medium, suggested by the broadcast nature of plane wave propagation, and may help to provide extra observations of the source signals to the destination. Modern research in wireless communications pays more attention to these extra observations which were formerly neglected within networks. Cooperative communication processes this abundant information existing at the surrounding nodes and retransmits towards the destination in various forms to create spatial and/or coding diversity, thereby to obtain higher throughput and reliability. The aim of this work is to design cooperative communication systems with distributed space-time block codes (DSTBC) in different relaying protocols and theoretically derive the BER performance for each scenario. The amplify-and-forward (AF) protocol is one of the most commonly used protocols at the relays. It has a low implementation complexity but with a drawback of amplifying the noise as well. We establish the derivation of the exact one-integral expression of the average BER performance of this system, folloby a novel approximation method based on the series expansion. An emerging technology, soft decode-and-forward (SDF), has been presented to combine the desired features of AF and DF: soft signal representation in AF and channel coding gain in DF. In the SDF protocol, after decoding, relays transmit the soft-information, which represents the reliability of symbols passed by the decoder, to the destination. Instead of keeping the source node idling when the relays transmit as in the traditional SDF system, we let the source transmit hard information and cooperate with the relays using DSTBC. By theoretically deriving the detection performance at the destination by either using or not using the DSTBC, we make comparisons among three SDF systems. Interesting results have been shown, together with Monte-Carlo simulations, to illustrate that our proposed one-relay and two-relay SDF & DSTBC systems outperform traditional soft relaying for most of the cases. Finally, these analytic results also provide a way to implement the optimal power allocation between the source and the relay or between relays, which is illustrated in the line model

다중입출력 간섭 채널에서 알라무티 부호 기반 간섭 정렬 후 제거 기법

학위논문 (박사)-- 서울대학교 대학원 : 전기·컴퓨터공학부, 2015. 2. 노종선.본 논문은 알라무티 부호와 협동 통신, 그리고 간섭 정렬에 관한 다음 세 가지 연구 결과를 포함하고 있다. 첫째, 다중입출력 간섭 채널에서 알라무티 부호를 활용하는 기법을 제시한다. 다원 접속 채널에서의 알라무티 부호 기반 간섭 제거 기법이 K-사용자 간섭 채널에서도 활용 가능한 것을 보인다. 수신 단에서 알라무티 구조를 이용하여 간섭 신호를 제거함으로써 심볼 단위 복호가 가능하고 다이버시티 차수 2를 얻을 수 있다. 또한 간섭 정렬 기법과 달리 송신 단에서 채널 상태 정보를 필요로 하지 않는다는 이점이 있다. 그러나 알라무티 부호 기반 간섭 제거 기법이 간섭 정렬 기법과 같은 자유도를 달성하기 위해서는 수신 단에서 많은 수의 안테나를 이용해야만 한다. 수신 안테나의 수를 줄이기 위한 노력의 일환으로, 3-사용자 간섭 채널에서의 알라무티 부호 기반 간섭 정렬 후 제거 기법을 제시한다. 제안된 기법은 송신 단에서 부분적 채널 상태 정보를 필요로 하는 대신에 적은 수신 안테나를 이용하여 간섭 제거 기법과 같은 자유도 및 다이버시티 차수를 얻는다. 본 논문에서는 제안된 두 가지 기법에 대해 쌍 오류 확률을 분석하여 기존의 간섭 정렬 기법보다 우수한 다이버시티 차수를 얻을 수 있다는 것을 증명한다. 본 논문의 두 번째 결과로, 알라무티 부호를 기반으로 한 양방향 중계 기법 두 가지를 제시한다. 첫 번째 기법은 K-사용자 간섭 채널에서의 알라무티 부호 기반 간섭 제거 기법을 양방향 중계 채널에 활용한 것이고, 이를 통해 심볼 단위 복호가 가능할 뿐만 아니라 다이버시티 이득을 얻는다. 더욱 많은 다이버시티 이득을 달성하기 위해 두 번째 양방향 중계 기법에서는 빔형성 행렬을 이용하여 중계기에 신호를 정렬시킨다. 컴퓨터 모의실험을 실시하여 두 기법에 대한 비교를 통해, 제안된 두 번째 기법의 다이버시티 이득이 첫 번째 기법보다 우수하다는 결론을 도출한다. 마지막으로, 여러 개의 중계기를 갖는 연판정 후 전달 협동 통신망에서 중계기 선택 방식을 제안하고, 이의 성능을 분석한다. 제안된 중계기 선택 기법은 가장 큰 end-to-end 신호 대 잡음비를 갖는 중계기를 선택하여 전송에 참여시킨다. 중계기 선택 기법의 쌍 오류 확률과 비트 오류 확률을 분석하고, 이를 모든 중계기가 전송에 참여하는 기존 방식의 성능과 비교한다. Fox H-함수의 극한값으로부터 중계기 선택 방식과 기존 방식의 다이버시티 차수를 구한다. 두 시스템에 대한 비교를 통해, 중계기 선택 방식은 비티 오류 확률이나 전송률 측면에서 기존의 방식보다 우수한 성능을 가짐을 확인한다.This dissertation contains the following three contributions to the interesting research topics on Alamouti code, interference alignment (IA), and cooperative communications. First, the methods on how to apply Alamouti code to MIMO interference channels are proposed. The IC method based on Alamouti codes for the multi-access scenario can be used for the K-user interference channel, which enables the receivers to perform symbol-by-symbol decoding by cancelling interfering signals by utilizing Alamouti structure and achieve diversity order of two. Moreover it does not require channel state information at the transmitters (CSIT) unlike the IA scheme. However, it requires more receive antennas than the IA scheme to achieve the same degrees of freedom (DoF). In order to reduce the number of receive antennas, especially for the three-user MIMO interference channel, an IAC scheme based on Alamouti codes is proposed, which keeps the same DoF as that of the IC scheme, but it requires partial CSIT. It is analytically shown that the IC and IAC schemes enable symbol-by-symbol decoding and achieve diversity order of two, while the conventional IA scheme achieves diversity order of one. In the second part of this dissertation, we propose two schemes for a TWRC based on Alamouti codes. Our IC method based on Alamouti codes for the K-user interference channel can be used for the TWRC, which enables the nodes to perform symbol-by-symbol decoding and achieve diversity order of two. In order to achieve more diversity gain, we propose a new two-way relaying scheme based on Alamouti codes which utilizes beamforming matrices to align signals at the relay node. From the simulation results, it is shown that the proposed scheme achieves diversity order of four. Finally, we analyze the best relay selection scheme for the SDF cooperative networks with multiple relays. The term best relay selectionimplies that the relay having the largest end-to-end signal-to-noise ratio is selected to transmit in the second phase transmission. The upper and lower bounds on the average pairwise error probability (PEP) are analyzed and compared with the conventional multiple-relay transmission scheme, where all the relays participate in the second phase transmission. Using the upper and lower bounds on the PEP and the asymptotes of the Fox's H-function, the diversity orders of the best relay selection and conventional relay schemes for the SDF cooperative networks are derived. It is shown that both schemes have the same full diversity order.Abstract i Contents v List of Tables viii List of Figures ix 1. Introduction 1 1.1. Background .......................................... 1 1.2. Overview of the Dissertation ........................ 5 1.3. Terms and Notations ................................. 7 2. Preliminaries 10 2.1. MIMO Communications ................................ 11 2.2. Space-Time Coding and Selection Diversity .......... 12 2.3. Cooperative Communications ......................... 16 2.3.1. Amplify-and-Forward Protocol ..................... 18 2.3.2. Decode-and-Forward Protocol ...................... 20 2.4. Interference Alignment ............................. 21 3. Interference Alignment-and-Cancellation Scheme Based on Alamouti Codes for the Three-User Interference Channel 25 3.1. Introduction ....................................... 25 3.2. Interference Cancellation Scheme Based on Alamouti Codes 28 3.2.1. Proof of Theorem 3.1 for K = 2 ................... 29 3.2.2. Proof of Theorem 3.1 for K ≥ 3 .................. 34 3.3. Interference Alignment-and-Cancellation Scheme for the Three-User MIMO Interference Channel .................... 36 3.3.1. Transmission and Reception Schemes ............... 37 3.3.2. Diversity Analysis ............................... 40 3.3.2.1. Proof of Theorem 3.2 for Receiver 1 when M = 1 . 41 3.3.2.2. Proof of Theorem 3.2 for Receivers 2 and 3 when M = 1 ............................................ 47 3.3.2.3. Proof of Theorem 3.2 for M ≥ 2 ................ 50 3.3.3. Extension to K-User MIMO Interference Channel .... 52 3.4. Simulation Results ................................. 53 3.5. Conclusions ........................................ 55 4. Two-Way Relaying Schemes with Alamouti Codes 57 4.1. Introduction ....................................... 57 4.2. Two-Way Relaying Scheme I Based on Alamouti Codes .. 58 4.3. Two-Way Relaying Scheme II Based on Alamouti Codes . 60 4.4. Simulation Results ................................. 62 4.5. Conclusion ......................................... 62 5. Analysis of Soft-Decision-and-Forward Cooperative Networks with Multiple Relays 64 5.1. Introduction ....................................... 64 5.2. Soft-Decision-and-Forward Protocol ................. 67 5.3. SDF Protocol with the Conventional Multiple-Relay Transmission ............................................ 72 5.3.1. System Model ..................................... 72 5.3.2. PEP and Diversity Order for the Conventional Scheme .................................................. 75 5.4. SDF Protocol with the Best Relay Selection ......... 77 5.4.1. System Model ..................................... 78 5.4.2. PEP and Diversity Order for the Best Relay Scheme 79 5.5. Simulation Results ................................. 81 5.6. Conclusion ......................................... 84 6. Conclusion 85 Bibliography 88 초록 98Docto

Performance analysis of collaborative hybrid-arq protocols over fading channels

Impairments due to multipath signal propagation on the performance of wireless communications systems can be efficiently mitigated with time, frequency or spatial diversity. To exploit spatial diversity, multiple-antenna technology has been thoroughly investigated and emerged as one of the most mature communications areas. However, the need for smaller user terminals, which results in insufficient spacing for antenna collocation, tends to limit the practical implementation of this technology. Without compromising terminal dimensions, future wireless networks will therefore have to exploit their broadcast nature and rely on collaboration between single-antenna terminals for exploiting spatial diversity. Among cooperative schemes, Collaborative ARQ transmission protocols, prescribing cooperation only when needed, i.e., upon erroneous decoding by the destination, emerge as an interesting solution in terms of achievable spectral efficiency. In this thesis, an information theoretical approach is presented for assessing the performance of Collaborative Hybrid-ARQ protocols based on Space-Time Block Coding. The expected number of retransmissions and the average throughput for Collaborative Hybrid-ARQ Type I and Chase Combining are derived in explicit form, while lower and upper bound are investigated for Collaborative Hybrid-ARQ Incremental Redundancy protocol, for any number of relays. Numerical results are presented to supplement the analysis and give insight into the performance of the considered scheme. Moreover, the issue of practical implementation of Space-Time Block Coding is investigated

Cooperative diversity for the cellular uplink: Sharing strategies, performance analysis, and receiver design

In this thesis, we propose data sharing schemes for the cooperative diversity in a cellular uplink to exploit diversity and enhance throughput performance of the system. Particularly, we consider new two and three-or-more user decode and forward (DF) protocols using space time block codes. We discuss two-user and three-user amplify and forward (AF) protocols and evaluate the performance of the above mentioned data sharing protocols in terms of the bit error rate and the throughput in an asynchronous code division multiple access (CDMA) cellular uplink. We develop a linear receiver for joint space-time decoding and multiuser detection that provides full diversity and near maximum-likelihood performance.;We also focus on a practical situation where inter-user channel is noisy and cooperating users can not successfully estimate other user\u27s data. We further design our system model such that, users decide not to forward anything in case of symbol errors. Channel estimation plays an important role here, since cooperating users make random estimation errors and the base station can not have the knowledge of the errors or the inter-user channels. We consider a training-based approach for channel estimation. We provide an information outage probability analysis for the proposed multi-user sharing schemes. (Abstract shortened by UMI.)