Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks

We develop and analyze space-time coded cooperative diversity protocols for combating multipath fading across multiple protocol layers in a wireless network. The protocols exploit spatial diversity available among a collection of distributed terminals that relay messages for one another in such a manner that the destination terminal can average the fading, even though it is unknown a priori which terminals will be involved. In particular, a source initiates transmission to its destination, and many relays potentially receive the transmission. Those terminals that can fully decode the transmission utilize a space-time code to cooperatively relay to the destination. We demonstrate that these protocols achieve full spatial diversity in the number of cooperating terminals, not just the number of decoding relays, and can be used effectively for higher spectral efficiencies than repetition-based schemes. We discuss issues related to space-time code design for these protocols, emphasizing codes that readily allow for appealing distributed versions.     

Using Orthogonal and Quasi-Orthogonal Designs in Wireless Relay Networks

Distributed space-time coding was proposed to achieve cooperative diversity in wireless relay networks without channel information at the relays. Using this scheme, antennas of the distributive relays work as transmit antennas of the sender and generate a space-time code at the receiver. It achieves the maximal diversity when the transmit power is infinitely large. This paper is on the design of practical distributed space-time codes (DSTCs). We use orthogonal and quasi-orthogonal designs which are originally used in the design of space-time codes for multiple-antenna systems. It is well known that orthogonal space-time codes have full diversity and linear decoding complexity. They are particularly suitable for transmissions in the network setting using distributed space-time coding since their ldquoscale-freerdquo property leads to good performance. Our simulations show that they achieve lower error rates than the random code. We also compare distributed space-time coding to selection decode-and-forward using the same orthogonal designs. Simulations show that distributed space-time coding achieves higher diversity than selection decode-and-forward (DF) when there is more than one relay. We also generalize the distributed space-time coding scheme to wireless relay networks with channel information at the relays. Although our analysis and simulations show that there is no improvement in the diversity, in some networks, having channel information at the relays saves both the transmission power and the transmission time.     

Distributed differential space-time coding for wireless relay networks

Distributed space-time coding is a cooperative transmission scheme for wireless relay networks. With this scheme, antennas of the distributive relays work as transmit antennas of the sender and generate a space-time code at the receiver. It achieves the maximum diversity. Although the scheme needs no channel information at relays, it does require full channel information, both the channels from the transmitter to relays and the channels from relays to the receiver, at the receiver. In this paper, we propose a differential transmission scheme, which requires channel information at neither relays nor the receiver, for wireless relay networks. As distributed space-time coding can be seen as the counterpart of space-time coding in the network setting, this scheme is the counterpart of differential space-time coding. Compared to coherent distributed space-time coding, the differential scheme is 3dB worse. In addition, we show that Alamouti, square real orthogonal, and Sp(2) codes can be used differentially in networks with corresponding numbers of relays. We also propose distributed differential space-time codes that work for networks with any number of relays using circulant matrices.     

Decode and forward polar coding for Half-duplex two-relay channels based on multilevel construction

Polar codes represent an emerging class of error-correcting codes with power to approach the capacity of the physically degraded relay channel and relevant coding schemes have been proposed in the literature. This paper aims to design new cooperative decode-and-forward (DF) polar coding schemes for half-duplex two-relay channel based on the Plotkin’s construction illustrating their performances gain. In these schemes, we consider the use of time-division process in transmission. The source node transmits its polar-coded information to both relays and the destination nodes during the first time slot. Each relay node receives the data from the source and processes it using the DF protocol. For the second transmission period, each relay first decodes the source signal then after reconstruction of the information reduction matrix based on the multilevel characteristics of polar codes, the extracted data at each relay are recoded using another polar code and transmitted to the destination. At destination node, the signals received from each relay and source nodes are processed by using multi-joint successive cancellation decoding for retrieving the original information bits. We demonstrate via simulation results that by carefully constructed polarisation matrix at each relay node, we can achieve the theoretical capacity in the half-duplex relay channel.     

相关瑞利信道下差分空时检测协同分集方案

本文提出了一种采用分布式差分空时分组编码和检测的协同分集方案,在不需要信道状态信息(CSI)的情况下可以实现满分集和全速率发射,并推导了相关瑞利信道下该方案误码率(BER)性能上限的解析表达式。传统的差分空时分组编码对整个码块进行差分,而协同分集下的任何一个协同用户进行差分编码时都不知道整个码块的信息。本文所提出的差分BPSK调制方案,通过将两协同用户的信息分别被调制到相互正交的实轴和虚轴上,从而将码块的联合差分转化为各用户独立差分。分析了在协同用户间不同的信道状态信息(CSI)和协同用户到接收用户不同的CSI情况下本文所提出发射方案的性能。仿真结果表明本文所提出的方案获得了明显的分集增益,同时也较好的吻合了理论分析的结果。     

Distributed Space-Time Cooperative Systems with Regenerative Relays

This paper addresses some of the opportunities and the challenges in the design of multi-hop systems that utilize cooperation with one or two intermediate regenerative relays to provide high-quality communication between a source and a destination. We discuss the limitations of using a distributed Alamouti scheme in the relay channel and the additional complexity required to overcome its loss of diversity. As an alternative to the distributed Alamouti scheme, we propose and analyze two error aware distributed space-time (EADST) systems built around the Alamouti code. First, using a bit error rate based relay selection approach, we design an EADST system with one and two regenerative relays that rely on feedback from the destination and we show that the proposed system improves on the distributed Alamouti scheme. In addition, we prove that the proposed one relay EADST system collects the full diversity of the distributed MISO channel. Second, we introduce an EADST system without feedback in which the relaying energies depend on the error probabilities at the relays. Numerical results show that both EADST systems perform close to the error probability lower bound obtained by considering error-free reception at the relays     

Full Rate Space Time Codes for Large Number of Transmitting Antennas with Linear Complexity Decoding

Among the specification of the 5G networks two crucial aspects are the support of fast mobility and high data rates. With fast mobility, the fading channels phenomenon become crucial, resulting in the need for multiple input/output channel to create spatial diversity. Space time codes (STC) have been shown to be well used with the Multiple Input Multiple Output channel. The Orthogonal STC (OSTC) family of codes is known to achieve full diversity as well as very simple implementation of the Maximum Likelihood (ML) decoder. However, it was also proven that with a complex symbol constellation one cannot achieve a full rate code when the number of transmitting antennas is larger than two. Quasi-OSTC (QSTC) can have full rate even for more than two transmitting antennas but with the penalty of decoding complexity which becomes severe if the constellation size is large. In order to tackle this inherent drawback of the OSTC/QSTC and to be able to support the 5G high data rate demand, we have come up with a different STC code that, when used with a new transmission and decoding methods, achieves full rate while maintaining linear complexity decoding for any number of transmit antennas. It can also be shown that when the transmitter knows the strongest channel (through minimal feedback) the code also achieves full diversity along with better error rate than the OSTC and the QSTC.     

Non-coherent distributed space-time processing for multiuser cooperative transmissions

User cooperation can provide spatial transmit diversity gains, enhance coverage and potentially increase capacity. Existing works have focused on two-user cooperative systems with perfect channel state information at the receivers. In this paper, we develop several distributed space-time processing schemes for general N-user cooperative systems, which do not require channel state information at either relays or destination. We prove that full spatial diversity gain can be achieved in such systems. Simulations demonstrate that these cooperative schemes achieve significant performance gain     

Array Processing for Multi-User Multi-Antenna Interference Channels Using Precoders

In this paper, we investigate how to send space-time codes with full diversity and low decoding complexity for interference channels using precoders. We assume that we have two transmitters and two receivers. Each transmitter sends codewords to respective receiver at the same time. We propose an orthogonal transmission scheme that combines space-time codes and array processing to achieve low-complexity decoding and full diversity for transmitted signals. To our best knowledge, this is the first scheme which can achieve low-complexity decoding and full diversity for any transmitted codeword in interference channel when all the users transmit at the same time. Simulation results validate our theoretical analysis.     

可快速迭代解码的非相干空时编码

提出了一种基于满分集准正交空时分组码构造非酉非相干空时码的方法,该编码能够最大限度地利用信道的相关时间来提高码率.根据代数分集的定义,证明了所构造的编码可获得满代数分集.为了能够充分利用编码的准正交结构简化解码,选用了基于期望最大化的迭代算法对所构造的编码进行解码,该算法能够极大地减小最优解码器的复杂度.仿真结果表明,迭代解码算法可快速收敛且其能够很好地对解码复杂度和误码性能进行折衷.     

Joint iterative decoding for pragmatic irregular LDPC-coded multi-relay cooperations

In this article, a new kind of pragmatic simple-encoding irregular systematic low-density parity-check (LDPC) code for multi-relay coded cooperation is designed, where the introduced joint iterative decoding is performed in the destination based on a proposed joint Tanner graph for all the constituent LDPC codes used by the source and relays in multi-relay cooperation. The theoretical analysis and numerical results show that the coded cooperations outperform the coded non-cooperation under the same code rate, and also achieve a good trade-off between the performance and the decoding complexity associated with the number of relays. This performance gain can be credited to the additional exchange of extrinsic information from the LDPC codes used by the source and the relays in both ideal and non-ideal cooperations.     

一族满分集度酉空时分组码

对于接收端和发送端均不具备信道状态信息的MIMO系统,本文将Cayley变换与对角块正交空时分组码结合,提出了一种新的酉空时分组码构造方法。新构造的空时分组码适用于任意发送天线数为偶数的MIMO系统,能提供满发送分集度和1.5符号/信道利用的信息传输率,并可采用球检测法等低计算复杂度检测算法得到准最优的检测结果。     

非对称双向中继信道中协作分集和网络编码的联合应用

本文应用非对称信道编码和网络编码技术实现了双向中继信道中非对称速率的传输。现实中无线通信环境具有差异性,通信链路状况也不相同。利用非对称编码方式,在较差链路引入更多的冗余信息来保证传输的可靠性,也在较优链路采取较高的传输速率,充分利用较优链路传输更多的信息。同时,通过协作分集技术,在接收端得到传输信息的多个副本,可以实现无线通信系统的分集增益。在中继链路加入网络编码,增加了系统的通信效率和编码增益。仿真结果表明,通过非对称编码方式,在较差链路端使用冗余更多的信道编码方式,不但可以实现可靠性传输,也比对称编码方式传输更多的信息。同时,利用协作分集技术,提供多个译码信息副本,增加了译码的可靠性,降低了系统误比特率。      

无线传感网物理层协作分集的性能分析

该文针对无线传感网中的远距传输问题,研究了一种无需网络同步和正交信道的协作分集方法的性能,给出了在两种典型信道中当解码转发存在误差传播时远程目的节点的误码率及分集指数;分析了当转发节点间为白高斯信道时增加协作节点数能够提高目的节点性能的条件。研究结果表明,当转发节点间为白高斯信道时,只要转发节点处于正常工作点,增加节点数就能提高目的节点的性能;当转发节点间为瑞利平衰落信道时,只有当转发节点处于一定位置时,协作分集相对于直接发送或传统空间分集才有性能增益;当转发节点间为瑞利平衰落信道时增加跳数性能更好,为白高斯信道时增加分支数更有效;当转发节点间为瑞利平衰落信道时,误差传播将使目的节点的分集指数为1,但在较低信噪比条件下对分集性能影响很小。     

Multiuser receiver scheme for full‐rate space–time coded CDMA system with imperfect estimation

By introducing a full‐rate space–time coding (STC) scheme, a synchronous CDMA (code division multiple access) system with full‐rate STC is given, and the corresponding uplink performance is investigated in Rayleigh fading channel with imperfect estimation. Considering that existing STC‐CDMA system has high decoding complexity, low‐complexity multiuser receiver schemes are developed for perfect and imperfect estimations, respectively. The schemes can make full use of the complex orthogonality of STC to reduce the high decoding complexity of the existing scheme, and have linear decoding complexity compared with the existing scheme with exponential decoding complexity. Moreover, the proposed schemes can achieve almost the same performance as the existing scheme. Compared with full‐diversity STC‐CDMA, the given full‐rate STC‐CDMA can achieve full data rate, low complexity, and partial diversity, and form efficient spatial interleaving. Thus, the concatenation of channel coding can effectively compensate for the performance loss due to partial diversity. Simulation results show that the full‐rate STC‐CDMA has lower bit error rate (BER) than full‐diversity STC‐CDMA systems under the same system throughput and concatenation of channel code. Moreover, the system BER with imperfect estimation are worse than that with perfect estimation due to the estimation error, which implies that the developed multiuser receiver schemes are valid and reasonable. Copyright © 2010 John Wiley & Sons, Ltd.     

Outage analysis of blind cooperative diversity

Mobile users with single antennas can still take advantage of spatial diversity through cooperative space–time‐encoded transmission. In this paper, we considered a scheme in which a relay chooses to cooperate only if its source–relay channel is of an acceptable quality, and we evaluate the usefulness of relaying when the source acts blindly and ignores the decision of the relays whether they may cooperate or not. In our study, we consider the regenerative relays in which the decisions to cooperate are based on a targeted end‐to‐end data rate R. We derived the end‐to‐end outage probability for a transmission rate R and a code rate ρ and look at a power allocation strategy between the source and the relays in order to minimize the end‐to‐end outage probability at the destination for high signal‐to‐noise ratio, by using the golden section search method. Performance results show that the computer simulations‐based results coincide with our analytical results. Copyright © 2011 John Wiley & Sons, Ltd.     

基于准正交空时分组码的多中继协作方案

根据准正交空时分组码提出了一种基于选择中继协议的多中继协作方案。从两个方面讨论了该方案的空间分集性能,通过分析成对差错概率证明,若所有的中继都正确译码,该方案可以获得全分集增益;若某些中继不能正确译码,该方案仍可以获得部分分集增益。将所提方案与使用正交空时分组码的协作方案进行比较,仿真结果表明,在信噪比较高时,两个方案都可获得全分集增益,但所提方案具有更高的编码增益。而当信噪比变低时,所提方案具有更高的分集增益和编码增益。     

Cooperative Strategies and Capacity Theorems for Relay Networks

Coding strategies that exploit node cooperation are developed for relay networks. Two basic schemes are studied: the relays decode-and-forward the source message to the destination, or they compress-and-forward their channel outputs to the destination. The decode-and-forward scheme is a variant of multihopping, but in addition to having the relays successively decode the message, the transmitters cooperate and each receiver uses several or all of its past channel output blocks to decode. For the compress-and-forward scheme, the relays take advantage of the statistical dependence between their channel outputs and the destination's channel output. The strategies are applied to wireless channels, and it is shown that decode-and-forward achieves the ergodic capacity with phase fading if phase information is available only locally, and if the relays are near the source node. The ergodic capacity coincides with the rate of a distributed antenna array with full cooperation even though the transmitting antennas are not colocated. The capacity results generalize broadly, including to multiantenna transmission with Rayleigh fading, single-bounce fading, certain quasi-static fading problems, cases where partial channel knowledge is available at the transmitters, and cases where local user cooperation is permitted. The results further extend to multisource and multidestination networks such as multiaccess and broadcast relay channels.     

On the Optimality of the ARQ-DDF Protocol

In this correspondence, the performance of the automatic repeat request-dynamic decode and forward (ARQ-DDF) cooperation protocol is analyzed in two distinct scenarios. The first scenario is the multiple access relay channel where a single relay is dedicated to simultaneously help two multiple access users. For this setup, it is shown that the ARQ-DDF protocol achieves the channel's optimal diversity multiplexing tradeoff (DMT). The second scenario is the cooperative vector multiple access channel where two users cooperate in delivering their messages to a destination equipped with two receiving antennas. For this setup, a new variant of the ARQ-DDF protocol is developed where the two users are purposefully instructed not to cooperate in the first round of transmission. Lower and upper bounds on the achievable DMT are then derived. These bounds are shown to converge to the optimal tradeoff as the number of transmission rounds increases.     

Interference‐resistant cooperative wireless networks based on complementary codes

Spatial diversity in wireless networks can be attained by exploiting the broadcast nature of wireless transmission without the need of multiple antennas in individual device, leading to the implementation of cooperative communication. While most prior works focused on the single source—destination scenario, it should be more realistic to consider how to induce cooperation among multiple source‐destination pairs assisted by multiple relays. In such a case, multiple access interference (MAI) may present due to asynchronous transmissions of the users and relays. In this paper, a cooperative network architecture based on orthogonal complementary (OC) codes inherently immune to MAI is proposed. To efficiently utilize the scarce radio spectrum and codes, a centralized medium access control (MAC) protocol is proposed to coordinate the code assignment and channel access among users and relays. We theoretically analyze the bit error rate (BER) performance of the proposed OC coded cooperative network over multipath Rayleigh fading channel. The performance gain resulted from different numbers of relays is investigated, and compared with a time division multiple access (TDMA) based cooperative scheme. We show that the proposed OC coded cooperative network performs well in the presence of timing offset, and thus is well suited for asynchronous uplink transmission with cooperative relaying. Copyright © 2009 John Wiley & Sons, Ltd.