Diversity-multiplexing tradeoff of half-duplex multi-input multi-output two-way relay channel with decode-and-forward protocol

A multi-input multi-output(MIMO) separated two-way relay channel(STWRC) is considered,where two users exchange their messages via a relay node.When each link is quasi-static Rayleigh fading,the achievable diversity-multiplexing tradeoff(DMT) of the half-duplex STWRC is analyzed.Firstly,the achievable DMT of the STWRC with static decode-and-forward(DF) protocol is obtained.Then,a dynamic decode-and-forward(DDF) protocol for the STWRC is proposed,where the relay listening time varies dynamically with the channel qualities of the links between two users and the relay.Finally,the achievable DMT of the proposed DDF protocol is derived in a case-bycase manner.Numerical examples are also provided to verify the theoretical analysis of both protocols.

Channel Modeling and Performance Analysis for UAV Relay Systems

In this paper, a multi-hop relay channel model based on unmanned aerial vehicles(UAVs) is established by taking into account of the propagation loss, shadowing, and multi-path fading. Based on the proposed channel model, the cascaded propagation loss of relay link and the cascaded probability density function(PDF) of channel fading are derived. Moreover, the theoretical performance of the UAV-based relay system, i.e., the outage probability, bit error rate(BER), and channel capacity, is also analysed and derived. Simulation results show agreement with theoretical results for the hill, mountain, and sea scenarios, indicating the accuracy of both the simulations and derivations.

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.

Energy Efficient Relay Positioning and Power Allocation for One-Way N-Relay Channel

Two end-users which have symmetric traffic requirements in terms of data rate are considered. They exchange information in Rayleigh flat-fading channels and multiple serial half-duplex relay nodes are employed to extend the communication coverage and assist the bidirectional communication between them using the analog network coding( ANC) protocol. With the objective of minimizing the sum transmit energy at the required data rate c,the optimal relay positioning and power allocation problem is firstly investigated and then the sub-optimal solutions for a two-relay channel are proposed,due to no close-form optimal solution. Furthermore,a sub-optimal scheme of relay positioning and power allocation,called equal-distance equal-transmit-power( EDEP) for an arbitrary Nrelay channel,N > 1 is proposed. Simulation results demonstrate a consistence with our proposed scheme.

A Decode-and-Forward Scheme for LDPC Coded Three-Way Relay Fading Channels

In this paper a low-density pairwise check(LDPC) coded three-way relay system is considered, where three user nodes desire to exchange messages with the help of one relay node. Since physical-layer network coding is applied, two time slots are sufficient for one round information exchange. In this paper, we present a decode-and-forward(DF) scheme based on joint LDPC decoding for three-way relay channels, where relay decoder partially decodes the network code rather than fully decodes all the user messages. Simulation results show that the new DF scheme considerably outperforms other common schemes in three-way relay fading channels.

Two-Hop Gaussian Relay Channel with Linear Relaying： Achievable Rate and Optimization Design

The relay node with linear relaying transmits the linear combination of its past received signals.The optimization of two-hop relay channel with linear relaying is discussed in this paper.The capacity for the two-hop Gaussian relay channel with linear relaying is derived,which can be formulated as an optimization problem over the relaying matrix and the covariance matrix of the signals transmitted at the source.It is proved that the solution to this optimization problem is equivalent to a "single-letter" optimization problem.We also show that the solution to this "single-letter" optimization problem has the same form as the expression of the rate achieved by Time-Sharing Amplify and Forward(TSAF).In order to solve this equivalent problem,we proposed an iterative algorithm.Simulation results show that if channel gain of one hop is relatively smaller,the achievable rate with TSAF is closer to the max-flow min-cut capacity bound,but at a lower complexity.

Outage Probability Analysis of Relay Systems over K-μ Fading Channels

This paper provides an analytical framework for the outage probability evaluation of dual-hop decode-and-forward relay systems operating over κ-μ fading channels in the presence of co-channel interference.The interferers are independent non-identically distributed κ-μ fading.An accurate analytical-form expression for the cumulative distribution function of the received signal power to interference and noise ratio is derived.Various numerical results are compared with Monte Carlo simulation results in order to corroborate the accuracy of the proposed expressions.Our results show that increasing the value of kappa of main links will decrease the outage probability of relay systems.Furthermore,the system performance degrades with the number of interferences.

Opportunistic Relaying Schemes for Amplify and Forward Bidirectional Relay Channels with Multi antenna Sources

We consider a two-way relay network where the Amplify-and-Forward (AF) protocol is adopted by all relays in this paper.The network consists of two multi-antenna source nodes and multiple distributed single-antenna relays.Two opportunistic relaying schemes are proposed to efficiently utilize the antennas of the source nodes and the relay nodes.In the first scheme,the best relay is selected out by a max-min-max criterion before transmitting.After that,at each source,only the antenna with the largest channel gain between itself and the best relay is activated to transmit and receive signals with full power.In the second scheme,assisted by the best relay which is selected by the typical max-min criterion,both source nodes use all their antennas to exchange data,and match filter beamforming techniques are employed at both source nodes.Further analyses show that all schemes can achieve the full diversity order,and the conclusions are not only mathematically demonstrated but numerically illustrated.System performance comparisons are carried out by numerical methods in terms of rate sum and outage probability,respectively.The beamforming assisted scheme can be found to be superior to the antenna selection scheme when accurate Channel State Information (CSI) is available at the transmitters.Otherwise,the latter is very suitable.

MSMSE-based optimal beamforming design and simplification on AF MIMO two-way relay channels

An optimal cooperative beamforming for the amplify-and-forward (AF) MIMO two-way relay channels was designed. Supposing the channel state information (CSI) was perfectly known by the receiver and transmitter as well as the relay, optimal beamforming vectors (matrices) of all nodes were jointly designed based on the criterion of minimizing the sum mean square errors (MSMSE). The analysis result shows that the performance effect of transmitting and receiving beamforming pairs is to maximize the receive signal-to-noise ratio (SNR) at two communication nodes, and the rank of the optimal relay beamforming matrix is no larger than two when there is only one data stream at each source node. A simplified algorithm was put forward to accomplish the design based on the analysis conclusions. Simulation results provide that the system performance, which is characterized in terms of bit error rates (BER), is significantly improved by cooperative beamforming, and the performance of the simplified method is not only very close to the optimal one but also with faster iteration speed and much lower computational complexity.

Energy efficiency enhancement of two-way amplifier forward relaying with channel estimation error

In order to save energy consumption of two-way amplifier forward(AF) relaying with channel estimation error, an energy efficiency enhancement scheme is proposed in this work. Firstly, through the analysis of two-way AF relaying mode with channel estimation error, the resultant instantaneous SNRs at end nodes is obtained. Then, by using a high SNR approximation, outage possibility is acquired and its simple closed-form expression is represented. Specially, for using the energy resource more efficiently, a low-complexity power allocation and transmission mode selection policy is proposed to enhance the energy efficiency of two-way AF relay system. Finally, relay priority region is identified in which cooperative diversity energy gain can be achieved. The computer simulations are presented to verify our analytical results, indicating that the proposed policy outperforms direct transmission by an energy gain of 3 dB at the relative channel estimation error less than 0.001. The results also show that the two-way AF relaying transmission loses the two-way AF relaying transmission loses its superiority to direct transmission in terms of energy efficiency when channel estimation error reaches 0.03.

Generalized Physical Layer Channel Model for RelayBased Super Dense Networks

The κ-μ fading model is an advanced channel model in super dense wireless networks.In this paper,we evaluate the performance of the system over κ-μ fading channel in super dense relay networks with consideration of multiple independent but not necessarily identically distributed(i.n.i.d.) cochannel interference(CCI) under interferencelimited environment.More specifically,we derive a useful and accurate cumulative distribution function(CDF) expression of the end-to-end signal-to-interference plus noise(SINR) ratio.Moreover,we derive novel analytical expressions of the outage probability(OP),average bit error probability(ABEP) and average capacity for binary modulation types and arbitrary positive values of κ-and μ of such system.Furthermore,we propose asymptotic analysis for both the OP and ABEP to give physical insights.A simplified analytical form for the ABEP at high-SNR regimes is provided as well.Finally,the accuracy of the derived expressions is well validated by Monte Carlo simulations.

CHANNEL ESTIMATION TECHNIQUE IN MULTI-ANTENNA AF RELAY COMMUNICATION SYSTEMS

The channel estimation technique is investigated in OFDM communication systems with multi-antenna Amplify-and-Forward(AF) relay.The Space-Time Block Code(STBC) is applied at the transmitter of the relay to obtain diversity gain.According to the transmission characteristics of OFDM symbols on multiple antennas,a pilot-aided Linear Minimum Mean-Square-Error(LMMSE) channel estimation algorithm with low complexity is designed.Simulation results show that,the proposed LMMSE estimator outperforms least-square estimator and approaches the optimal estimator without error in the performance of Symbol Error Ratio(SER) under several modulation modes,and has a good estimation effect in the realistic relay communication scenario.

Optimal cooperative beamforming design schemes for AF MOMO two-way relay channels

In this paper,beamforming parameters in multiple input multiple output(MIMO) two-way relay channels(TWRCs) are designed.We investigate three communicating scenarios,in which,the source nodes are all equipped with multiple antennas.In the first scenario,one pair of source nodes are communicating with each other under the help of a single multi-antenna equipped relay.A centralized scheme is correspondingly developed where the optimal relay beamforming(RaB) is jointly designed with the transmit beamformings(TBs) and the receive beamformings(RcBs) at both source nodes to minimize the sum of mean square errors(SMSE).In the second scenario,one pair of users in the first scenario is extended to multi-pair of source nodes.We derive a general expression of the optimal RaB matrix of this scenario in the second scheme,and based on which,a RaB matrix is designed to cancel the inter-pair interference(IPI) and to minimize the intra-pair SMSE.At last,we consider a distributed scenario where multiple single-antenna equipped relays are helping the communication between one pair of source nodes.In the scheme associated with this scenario,beamformings are developed under relay total power constraint and relay individual power constraint,respectively.The simulation results reveal that beamformings at source and relay nodes significantly improve the performance in the sense of average bit error rate(BER).The proposed multi-pair scheme has made superior progress in BER performance because it not only can cancel the IPIs but also can balance the useful signal and the noise at each user.Moreover,in one-pair scenarios,the performance of the centralized scheme is better than the distributed one,but the latter is nevertheless much more practical.

Distributed Coding Modulation Adaptation Scheme for Relay Channel

Rate adaptation is an effective approach to achieve high spectrum efficiency under varying channel condition, especially for wireless communication. This paper proposes rate adaptation at receiver for wireless relay system. In this scheme, source node uses a new modulation technology, called random projections code (RPC), to achieve rate adaptation. Both relay node and destination node decode the received RPC encoding signals. If destination does not decode RPC correctly, relay node will act compressing and forwarding role by performing LDPC syndrome encoding and sending syndrome coded information to destination node. We discuss how to jointly decode at destination node when it receives RPC coded information from source node and syndrome coded information from relay node. Finally, we evaluate the scheme by bit-error-rate (BER) and good put evaluation metrics. Simulation results show that the coding gain is about 4 dB, 3.1 dB, 2.2 dB and 1.6 dB for LDPC coding rate 0.8, 0.89, 0.94, 0.99 at BER 10-5 respectively. The throughput of the schemes is at least 0.3 bit/s/Hz higher than RPC at SNR ranging from 5 dB to 25 dB.

Polar Codes for Soft Decode-and-Forward in HalfDuplex Relay Channels

Soft decode-and-forward(DF) can combine the advantages of both amplify-and-forward and hard DF in relay channels. In this paper, we propose a low-complexity soft DF scheme based on polar codes, which features two key techniques: a low-complexity cyclic redundancy check(CRC) aided list successive cancellation(CALSC) decoder and a soft information calculation method. At the relay node, a low-complexity CALSC decoder is designed to reduce the computational complexity by adjusting the list size according to the reliabilities of decoded bits. Based on the path probability metric of the CALSC decoder, we propose a method to compute the soft information of the decoded bits in CALSC. Simulation results show that our proposed scheme outperforms the soft DF based on low-density parity-check codes and the soft DF with belief propagation or soft cancellation decoder, especially in the case when the source-relay channel is at the high signal-to-ratio region.

Enhancing Security in Multicellular Multicast Channels Reducing Interference Power with the Best Relay Selection

The capacity of wireless networks is fundamentally limited by interference. A few research has focused on the study of the simultaneous effect of interference and correlation, and less attention has been paid to the topic of canceling simultaneous effect of interference and correlation until recently. This paper considers a secure wireless multicasting scenario through multicellular networks over spatially correlated Nakagami-m fading channel in the presence of multiple eavesdroppers. Authors are interested to protect the desired signals from eavesdropping considering the impact of perfect channel estimation (PCE) with interference and correlation. The protection of eavesdropping is also made strong reducing the simultaneous impact of interference and correlation on the secrecy multicast capacity employing opportunistic relaying technique. In terms of the signal-to-interference plus noise ratio (SINR), fading parameter, correlation coefficient, the number of multicast users and eavesdroppers and the number of antennas at the multicast users and eavesdroppers, the closed-form analytical expressions are derived for the probability of non-zero secrecy multicast capacity and the secure outage probability for multicasting to understand the insight of the effects of aforementioned parameters. The results show that the simultaneous effects of correlation and interference at the multicast users degrade security in multicasting. Moreover, the security in multicasting degrades with the intensity of fading and the number of multicast users, eavesdroppers and antennas at the eavesdroppers. The effects of these parameters on the security in multicasting can be significantly reduced by using opportunistic relaying technique with PCE. Finally, the analytical results are verified via Monte-Carlo simulation to justify the validity of derived closed-form analytical expressions.

Enhancement of Multicast Security with Opportunistic Relaying Technique over κ-μ Shadowed Fading Channels

The effects of scatterers, fluctuation parameter and propagation clusters significantly affect the performance of κ-μ shadowed fading channel. On the other hand, opportunistic relaying is an efficient technique to improve the performance of fading channels reducing the effects of aforementioned parameters. Motivated by these issues, in this paper, a secure wireless multicasting scenario through κ-μ shadowed fading channel is considered in the presence of multiple eavesdroppers with opportunistic relaying. The main purpose of this paper is to ensure the security level in wireless multicasting compensating the loss of security due to the effects of power ratio between dominant and scattered waves, fluctuation parameter, and the number of propagation clusters, multicast users and eavesdroppers, by opportunistic relaying technique. The closed-form analytical expressions are derived for the probability of non-zero secrecy multicast capacity (PNSMC) and the secure outage probability for multicasting (SOPM) to understand the insight of the effects of above parameters. The results show that the loss of security in multicasting through κ-μ shadowed fading channel can be significantly enhanced using opportunistic relaying technique by compensating the effects of scatterers, fluctuation parameter, and the number of propagation clusters, multicast users and eavesdroppers.

Design of bilayer lengthened LDPC codes over expanded graph for relay channels

This paper presents a low complexity optimized algorithm for design of bilayer lengthened LDPC(BL-LDPC) code for decode-and-forward relay system.The design is performed over the expanded graph of the BL-LDPC code,which consists of the original bilayer graph and the extra added relaygenerated parity check bits.To build up our proposed optimized algorithm,we present a modified Gaussian approximation algorithm for the expanded structure of the BL-LDPC code.Then using the proposed optimized algorithm,we find the optimum overall expanded graph of the BL-LDPC code.Simulation results show that the BL-LDPC codes obtained by our proposed optimized algorithm have excellent bit-error-rate performances and small gaps between the convergence thresholds and the theoretical limits when transmitted over the additive white Gaussian noise channels.

Arbitrary Decode-Forward Relaying with Re-Encoded Bits Selection Strategy for Polar Codes

In this paper,we propose an arbitrary decode-forward single-relay scheme for finite blocklength polar codes,which can be applied to the general symmetric discrete memoryless relay channel with orthogonal receiver components.The relay node decodes the received message.The relay node selectively re-encodes the message and transmits it to the destination node.Furthermore,in order to minimize the upper-bound of the block error probability,we propose a selection strategy to decide the proper re-encoded bit set by the relay.Simulation results are presented to illustrate the improvement in decoding performance of the proposed scheme compared to conventional relay schemes in both additive white Gaussian noise(AWGN)channel and Rayleigh fading channel(RFC).