Outage analysis of coded cooperation

Cooperative communication is an emerging paradigm where multiple mobiles share their resources (bandwidth and power) to achieve better overall performance. Coded cooperation is a mechanism where cooperation is combined with-and operates through-channel coding, as opposed to the repetition-based methods. This work develops expressions for outage probability of coded cooperation. In this work, each node acts as both a data source as well as a relay, i.e., only active (transmitting) nodes are available to assist other nodes, and each node operates under overall (source + relay) power and bandwidth constraints. Outage expressions confirm that full diversity is achieved by coded cooperation. This shows that despite superficial similarities, coded cooperation is distinct from decode-and-forward, which has been shown to have diversity one. The outage probability expressions developed in this work characterize coded performance at various rates. Furthermore, outage probabilities yield bounds that are arguably more insightful than the bit-error rate (BER) results previously available for coded cooperation. Numerical comparisons shed light on the relative merits of coded cooperation and various repetition-based methods, under various inter-user and uplink channel conditions.     

基于SWIPT的Polar编码协作码的设计与系统性能研究

极化（Polar）编码协作可同时获得编码增益与分集增益,实现可靠通信。为了解决中继能量受限问题,本文研究了基于无线信息与能量同传（Simultaneous Wireless Information and Power Transfer, SWIPT）技术的Polar编码协作系统。首先,建立了基于SWIPT的Polar编码协作系统模型。其次,鉴于Polar码的Plotkin构造方法将一个长码分裂成两个短码,非常适用于编码协作场景,使用Plotkin构造方法联合设计信源节点和中继节点Polar码,并在目的节点对其进行联合串行相消（Successive Cancellation, SC）译码。相比传统点对点系统,基于SWIPT的Polar编码协作系统使得系统中断概率大幅度降低;与随机低密度奇偶校验（Low Density Parity Check, LDPC）编码协作系统相比,在译码迭代次数低时所提方案误码性能更佳。      

Network‐coded multiple‐source cooperation aided relaying for free‐space optical transmission

A network‐coded cooperative relaying aided free‐space optical (FSO) transmission scheme is designed. The resultant multiple‐source cooperation diversity is exploited by the relay to mitigate the strong turbulence‐induced fading experienced in FSO channels. At the destination, an iterative multiple source detection algorithm is proposed in conjunction with a chip‐level soft network decoding method. Our performance evaluation results using simulation analysis demonstrate that the proposed FSO multiple source detection is capable of approaching the single‐user‐bound for transmission over Gamma–Gamma turbulence channels. Also, the network‐coded cooperative FSO scheme can achieve a significant BER improvement in comparison with conventional noncooperation schemes. Copyright © 2012 John Wiley & Sons, Ltd.     

联合网络编码和中继选择的协作传输方案及其性能分析

研究了Nakagami信道中联合网络编码和双向协作中继选择的中断与平均误码率的性能,基于3个时隙的网络编码方案提出了一种最小化较差用户误码率的协作中继选择策略。在Nakagami信道下,从双向通信的角度,通过理论分析得出其中断概率和平均误码率的解析式和渐近式,同时推导了无协作中继选择时网络编码的中断概率和平均误码率解析式。通过理论分析发现,当Nakagami信道衰落参数降低时,联合网络编码的协作中继选择方案相对于无协作中继选择时的性能增益将逐渐升高。数值仿真实验结果表明,所提策略的平均误码率性能要显著高于无协作中继选择时的网络编码性能。     

Research on the NOMA performance in cognitive cooperation network

The non-orthogonal multiple access (NOMA) technology was studied in a downlink cognitive relay cooperation network.A cognitive multiuser relay cooperation based NOMA scheme was proposed (CM-RC-NOMA),in which,the outage performance of PU and SU were given under different cognitive relay cooperation schemes and the corresponding outage expressions were also derived.At the same time,the AF based relay cooperation method and the DF based relay cooperation method were compared.The simulation results show that the lower outage of PU can be achieved by AF method compared with DF method,when the channel condition of BS to PU is no more than that of SU to PU.It is also revealed that the optimal outage performance of PU can be achieved by the proposed best cognitive relay cooperation scheme in contrast to the traditional best cognitive relay cooperation scheme.     

Outage Probability Analysis of Three-User Reed–Solomon Coded Cooperation Scheme for Wireless Slow Fading Channel

In a coded cooperation scheme, the relay must decode and re-encode data. This process needs to be completed rapidly. Therefore, a simple channel coding/decoding scheme that requires low computational loads is needed. Reed–Solomon (RS) codes are simple, forward error-correction codes with low decoding computational loads. This paper introduces a three-user RS coded cooperation scheme that aims to have simple encoding/decoding complexity as well as to increase diversity order. It also presents the mathematical derivations of outage probability and investigates the outage performance of the three-user RS coded cooperation scheme. The derived outage probability expressions prove that the three-user RS coded cooperation scheme can achieve full diversity. Numerical bit error rate comparisons show that the three-user RS coded cooperation scheme performs better than a two-user scheme under various inter-user and uplink channel conditions. Outage probability performance improves at approximately 5 dB for regions with low signal-to-noise ratio (SNR) and 10 dB for regions with high SNR under a slow-fading channel. The paper also presents the complete calculated numerical tables for outage probability terms (integral terms) that do not have closed-form solutions.     

Distributed polar-coded OFDM based on Plotkin’s construction for half duplex wireless communication

A Plotkin-based polar-coded orthogonal frequency division multiplexing (P-PC-OFDM) scheme is proposed and its bit error rate (BER) performance over additive white gaussian noise (AWGN), frequency selective Rayleigh, Rician and Nakagami-m fading channels has been evaluated. The considered Plotkin’s construction possesses a parallel split in its structure, which motivated us to extend the proposed P-PC-OFDM scheme in a coded cooperative scenario. As the relay’s effective collaboration has always been pivotal in the design of cooperative communication therefore, an efficient selection criterion for choosing the information bits has been inculcated at the relay node. To assess the BER performance of the proposed cooperative scheme, we have also upgraded conventional polar-coded cooperative scheme in the context of OFDM as an appropriate bench marker. The Monte Carlo simulated results revealed that the proposed Plotkin-based polar-coded cooperative OFDM scheme convincingly outperforms the conventional polar-coded cooperative OFDM scheme by 0.5 ~ 0.6 dBs over AWGN channel. This prominent gain in BER performance is made possible due to the bit-selection criteria and the joint successive cancellation decoding adopted at the relay and the destination nodes, respectively. Furthermore, the proposed coded cooperative schemes outperform their corresponding non-cooperative schemes by a gain of 1 dB under an identical condition.     

基于Turbo码的机会编码协同策略

提出一种多中继协同无线网络的机会编码协同策略,该策略基于Turbo编码,利用信道条件信息机会选择最优协同节点。通过数学分析,给出了系统中断性能和瑞利衰落下的中断概率表达式,计算机仿真结果进一步揭示了机会编码协同相对于传统编码协同的优势。     

机会协同通信系统的中继公平性研究

为提高机会协同通信系统的中继选择公平性,提出了以不影响系统中断性能为目标的协同方案。在建立了协同通信系统模型的基础上,提出机会协同方案,并引入比例公平算法对机会协同方案进行改进;分别对2种方案下的中继选择概率与系统中断概率进行了分析,根据定义的公平因子表征中继公平性与理想公平上限。仿真结果表明,提出的基于比例公平的机会协同方案,显著改善了中继选择的公平性,在大信噪比条件下趋近理想公平上限,同时保持了系统中断性能。     

新型机会中继编码协作:源自适应传输校验信息

在多中继协作网络中,机会中继编码协作已然成为一种高效且被广泛研究的协作策略,然而现有工作存在着资源浪费或者系统复杂度高的问题。为此,针对如何在资源利用率与系统复杂度之间获得良好折中的问题,该文提出一种新型的机会中继编码协作策略,在不增加额外开销的情况下,使源节点能够自适应地向目的节点发送校验信息。并在Nakagami信道模型下,给出了系统中断概率的解析表达和误比特率上界的闭式表达。仿真结果表明,与已有机会中继编码协作策略相比,在获得性能提升的同时,所提策略对系统复杂度和资源利用率均有所改善。     

基于冗余前置的机会编码协同中继策略

对于多节点的协同网络,机会编码协同总是选择最佳中继参与协同,能够取得优越的中断概率性能。为了进一步提高中断概率性能,提出了基于冗余前置的机会编码协同中继策略,并对其在瑞利平坦慢衰落信道条件下的中断概率性能进行了计算机仿真。结果表明,所提策略的中断概率性能明显优于机会编码协同中继策略,若所要求的中断概率为10-3,当潜在协同中继数目为7,协同等级为0.5,目标信息速率为1 bit/s/Hz的条件下,所提策略较机会编码协同中继策略可以获得1.9 dB的信噪比增益。     

Joint iterative decoding for simple-encoding systematic irregular-LDPC-based coded cooperation in non-ideal relay channel

In this paper, a new kind of simple-encoding irregular systematic LDPC codes suitable for one-relay coded cooperation is designed, where the proposed joint iterative decoding is effectively performed in the destination which is in accordance with the corresponding joint Tanner graph characterizing two different component LDPC codes used by the source and relay in ideal and non-ideal relay cooperations. The theoretical analysis and simulations show that the coded cooperation scheme obviously outperforms the coded non-cooperation one under the same code rate and decoding complex. The significant performance improvement can be virtually credited to the additional mutual exchange of the extrinsic information resulted by the LDPC code employed by the source and its counterpart used by the relay in both ideal and non-ideal cooperations.     

A Convolutional-Based Distributed Coded Cooperation Scheme for Relay Channels

In this paper, we consider a coded cooperation diversity scheme that is suitable for $L$-relay channels that operate in the decode–forward mode. The proposed scheme is based on convolutional coding, where each codeword of the source node is partitioned into two frames that are transmitted in two phases. In the first phase, the first frame is broadcast from the source to the relays and destination. In the second phase, the second frame is transmitted on orthogonal subchannels from the source and relay nodes to the destination. Each relay is assumed to be equipped with a cyclic redundancy check (CRC) code for error detection. Only these relays (whose CRCs check) transmit in the second phase. Otherwise, they keep silent. At the destination, the received replicas (of the second frame) are combined using maximal ratio combining. The entire codeword, which comprises the two frames, is decoded via the Viterbi algorithm. We analyze the proposed scheme in terms of its probability of bit error and outage probability. Explicit upper bounds are obtained, assuming $M$-ary phase-shift keying transmission. Our analytical results show that the full diversity order is achieved, provided that the source-relay link is more reliable than the other links. Otherwise, the diversity degrades. However, in both cases, it is shown that it is possible to achieve substantial performance improvements over noncooperative coded systems. Several numerical and simulation results are presented to demonstrate the efficacy of the proposed scheme.      

A Parallel Concatenated Convolutional-Based Distributed Coded Cooperation Scheme for Relay Channels

In this paper, we investigate a coded cooperation diversity scheme suitable for L-relay channels operating in the soft-decode-and-forward (soft-DF) mode. The proposed scheme is based on parallel concatenated convolutional codes (PCCC). To improve the overall performance through diversity, the coded cooperation operates by sending the systematic and the first parity outputs via L?+?1 independent fading paths. Instead of using only a centralized turbo code system at the source node, we have proposed a DCC scheme, where the first recursive systematic coding is done at both source and relay nodes. At the destination, the received replicas are combined using the maximal ratio combining (MRC). The entire codeword, comprising the MRC sequence and the second parity part, is decoded via the maximum a-posteriori (MAP) algorithm and turbo decoding principle. We analyze the proposed scheme in terms of bit error rate (BER). In fact, we define the explicit upper bounds for error rate assuming Binary phase shift keying (BPSK) transmission for fully interleaved channels with channel state information (CSI). We use the Rayleigh fading channels with independent fading. Our study shows that the full diversity order is achieved when the source-relay link is more reliable than the other links. Otherwise, the diversity decreases. However, in both cases, it is shown that significant performance improvements are possible to achieve over non-cooperative coded systems. Theorical and simulation results are presented to demonstrate the efficacy of the proposed scheme.     

Performance analysis of spectrally efficient amplify‐and‐forward opportunistic relaying scheme for adaptive cooperative wireless systems

In this paper, we propose an adaptive amplify‐and‐forward (AF) relaying scheme that selects the best relay among the available relay nodes opportunistically to cooperate with a source node for improvement of the spectral efficiency. This improvement can be achieved by introducing a policy that gives the useful cooperative regions and defines a switching threshold signal‐to‐noise ratio that guarantees the bit error rate (BER) of cooperative transmission is below the target. We model all links as independent non‐identically distributed Rayleigh fading channels. We then derive closed‐form expressions for the average spectral efficiency, average BER, and outage probability when an upper bound for the signal‐to‐noise ratio of the end‐to‐end relay path is applied and adaptive discrete rate is considered. Numerical and simulation results show that the proposed scheme, compared with the outage‐based AF incremental relaying, AF fixed relaying, and the conventional direct transmission, can achieve the maximum average spectral efficiency while maintaining the average BER and outage probability. Copyright © 2013 John Wiley & Sons, Ltd.     

Cooperative quadrature physical layer network coding in wireless relay networks

This paper proposes a cooperative quadrature physical layer network coding (CQPNC) scheme for a dual‐hop cooperative relay network, which consists of two source nodes, one relay node and one destination node. All nodes in the network have one antenna, and the two source nodes transmit their signals modulated with quadrature carriers. In this paper, a cooperative quadrature physical layer network coded decode‐and‐forward (DF) relay protocol (CQPNC‐DF) is proposed to transmit the composite information from the two source nodes via the relay node to the destination node simultaneously to reduce the number of time slots required for a transmission. The proposed CQPNC‐DF relay protocol is compared with time‐division multiple‐access amplify‐and‐forward (TDMA‐AF), TDMA‐DF, cooperative network coded DF (CNC‐DF) and cooperative analog network coded AF (CANC‐AF) relay protocols to demonstrate its effectiveness in terms of bit error rate (BER) and system throughput under different propagation conditions. The simulation results reveal that the proposed CQPNC‐DF relay protocol can significantly improve the network performance. Compared with two TDMA schemes and CNC‐DF, the proposal can provide up to 100% and 50% throughput gains, respectively. Moreover, no matter what the scene, the proposed scheme always has the lowest BER in the low SNR region. Copyright © 2013 John Wiley & Sons, Ltd.     

非理想载波同步物理层网络编码误比特性能分析

采用相干检测的物理层网络编码系统的误比特性能与载波同步精度密切相关,收发双方的载波同步误差将引起系统性能恶化。本文研究了残余载波同步误差对采用相同星座和正交星座BPSK信号的两种物理层网络编码双向中继系统误比特性能的影响。首先基于最大似然准则推导了存在残余载波同步误差时中继节点及源节点处接收信号的判决区域,然后运用Craig极坐标法分析了系统多址接入、广播阶段及总的端到端误比特性能,得出了精确的误比特率表达式,文中的分析方法可推广到采用其他调制方式的物理层网络编码系统。计算机仿真表明:文中的理论分析与仿真结果完全吻合,所推导的理论公式可以效地评估BPSK调制物理层网络编码系统的误比特性能;正交星座系统对载波同步误差更为敏感,相同的同步误差对正交星座系统的性能恶化更为严重。      

BER-Constrained Incremental Relaying with Relay Selection in Cooperative Wireless Networks

One of the main drawbacks of cooperative communication systems with half-duplex relaying is inefficient use of spectrum. Incremental relaying is an effective technique that overcomes this limitation, particularly in the high-SNR regime. In this paper, for a multi-relay cooperative network with arbitrary number of relay nodes, we propose a spectrally-efficient incremental relaying scheme that eliminates redundant relay transmissions such that an average end-to-end bit error rate (BER) constraint is satisfied. For detect-and-forward relaying, under the assumption of error propagation from the relays to the destination, we analyze the performance of the system in terms of the end-to-end BER, the average spectral efficiency and the outage probability for Rayleigh fading environment. The performance of the system depends on a single threshold employed by the relays and the destination. We optimize this threshold such that the average spectral efficiency of the system is maximized under an average end-to-end BER constraint. This optimization criterion results in a constant-BER, variable-spectral efficiency relaying scheme. The proposed scheme makes use of spectrum as efficiently as possible, while providing the required quality of service at the destination.     

A Threshold-Free LLR-Based Scheme to Minimize the BER for Decode-and-Forward Relaying

In cooperative communications, the problem of error propagation has a detrimental effect on the diversity order of the wireless system. To mitigate such an effect, we present a relaying scheme that is based on the absolute value of the log-likelihood ratio (LLR) of the received message signals at both the relay node and the destination node. The calculated LLR values are then compared to each other and based on the result of the comparison, a decision is made on whether or not to activate the relay node. The proposed scheme does not rely on any threshold, and is thus simple in nature. A closed-form expression is derived for the bit-error-rate (BER) of the proposed scheme. The theoretical developments are validated by simulations. As a means for performance measurement, the proposed scheme is compared to its counterparts and is shown to provide a better BER performance at a much lower complexity. Furthermore, a closed-form expression of the outage probability is also derived.     

Security versus reliability analysis for multi-eavesdropper cooperation wireless networks with best relay

Physical-layer security could be used to effectively combat eavesdroppers and the transmission reliability of the main link could be improved.A wireless relay network with multiple both decode and forward eavesdroppers and relays were considered,in the presence of the link from source to destination.A best relay selection scheme based on multieavesdropper’s cooperation was proposed,and the outage probability and the intercept probability was deduced under both schemes without relay and with best relay.Then,the security and reliability influenced by different relay selection schemes were analyzed.The simulation results show that the achievable channel capacity at the destination node and the system outage probability are directly affected by different relay selection scheme.Lower system outage probability can be achieved by the proposed scheme,and the system outage probability and intercept probability are both decreased with the increase of the number of relays.The intercept probability increases with the increase of the number of eavesdroppers,which,however,can be reduced by increasing the number of relays to ensure the main link’s reliable transmission.