Achievability of Chong-Motani-Garg relay channel capacity bounds using forward decoding

To reduce decoding delay of a communication scheme which is backward-decoding-based and achievable Chong Motani-Garg capacity bounds, a novel forward-sliding-window decoding-based communication scheme is proposed. In this scheme, if w = （w1, w2） is the message to be sent in block b, the relay will decode message w1 and generate a new message z at the end of block b, and the receiver will decode message w1 at the end of block b ＋ 1 and decode message z and w2 at the end of block b ＋ 2. Analysis results show that this new communication scheme can achieve the same Chong-Motani-Garg bounds and the decoding delay is only two blocks which is much shorter than that of backward decoding. Therefore, Chong-Motani-Garg bounds can be achieved by a forward decoding-based communication scheme with short decoding delay.

Capacity of a Class of Dirty-Tape Gaussian Orthogonal Relay Channel with State Information at the Source and Relay

A Gaussian channel with additive interference that is causally known to the transmitter is called a Dirty-Tape Channel(DTC).In this paper,we consider a state-dependent dirty-tape Gaussian relay channel with orthogonal channels from the source to the relay and from the source and relay to the destination.The orthogonal channels are corrupted by two independent additive interferences causally known to both the source and relay.The lower and upper bounds of the channel capacity are established.The lower bound is obtained by employing superposition coding at the source,Partial Decode-and-Forward(PDF)relaying at the relay,and a strategy similar to that used by Shannon at the source and relay.The explicit capacity is characterised when the power of the relay is sufficiently large.Finally,several numerical examples are provided to illustrate the impact of additive interferences and the role of the relay in information transmission and in removing the interference.

Performance of Physical-Layer Network Coding in Asymmetric Two-Way Relay Channels

In this paper, we study the performance of physical-layer network coding in asymmetric two-way relay channels using four different cases having different poor channels:phase asymmetry, downlink asymmetry, uplink asymmetry and node asymmetry. The decision and mapping rule for symmetric and asymmetric cases are studied. The performance in terms of bit error rate for each case will be studied and analysed by computer simulation. Analytical and simulation results show that uplink asymmetry is the worst case;intra-phase asymmetry and unreliable uplink channels will more severely affect the performance degradation, which is caused by channel asymmetry.

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.

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.

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.

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.

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.

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.

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.

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.

Secure Transmission Scheme for Parallel Relay Channels Based on Polar Coding

This paper considers the use of polar codes to enable secure transmission over parallel relay channels.By exploiting the properties of polar codes over parallel channels, a polar encoding algorithm is designed based on Channel State Information（CSI） between the legitimate transmitter（Alice） and the legitimate receiver（Bob）.Different from existing secure transmission schemes, the proposed scheme does not require CSI between Alice and the eavesdropper（Eve）. The proposed scheme is proven to be reliable and shown to be capable of transmitting information securely under Amplify-and-Forward（AF） relay protocol, thereby providing security against passive and active attackers.

Achieving the capacity of half-duplex degraded relay channels using polar coding

In this paper, a novel transmission protocol based on polar coding is proposed for the half-duplex degraded relay channel. In the proposed protocol, referred to as the partial message relaying, the relay only needs to forward a part of the decoded source message that the destination needs according to the exquisite nested structure of polar codes. Theoretically, it is proved that the scheme can achieve the capacity of the half-duplex relay channel under the decode-and-forward （DF） cooperation strategy while enjoying low encoding/decoding complexity. Practically, in order to minimize the global transmission power, the optimization of the power allocation is performed between the source and the relay by using information theoretic tools. Furthermore, a joint iterative soft parallel interference cancellation receiver structure is developed to suit to the proposed scheme. Simulation results show that the proposed scheme outperforms the conventional scheme designed by low-density parity-check （LDPC） codes.

Optimal energy-efficient scheme for two-way relay channel using physical layer network coding

Systems are always designed and optimized based on full traffic load in the current literatures. However, practical systems are seldom operating at full load, even at peak traffic hours. Instead of maximizing system rate to achieve the full load, an optimal energy-efficient scheme to minimize the transmit power with required rates is investigated in this article. The considered scenario is a two-way relay channel using amplify-and-forward protocol of physical layer network coding, where two end nodes exchange messages via multiple relay nodes within two timeslots. A joint power allocation and relay selection scheme is designed to achieve the minimum transmit power. Through convex optimization theory, we firstly prove that single relay selection scheme is the most energy-efficient way for physical layer network coding. The closed-form expressions of power allocation are also given. Numerical simulations demonstrate the performance of the designed scheme as well as the comparison among different schemes.

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).

RELAY ASSISTED TRANSMISSSION WITH BIT-INTERLEAVED CODED MODULATION

We investigate an adaptive cooperative protocol in a Two-Hop-Relay (THR) wireless system that combines the following: (1) adaptive relaying based on repetition coding; (2) single or two transmit antennas and one receive antenna configurations for all nodes, each using high order constellation; (3) Bit-Interleaved Coded Modulation (BICM). We focus on a simple decoded relaying (i.e. no error correcting at a relay node) and simple signal quality thresholds for relaying. Then the impact of the two simple thresholds on the system performance is studied. Our results suggest that compared with the traditional scheme for direct transmission, the proposed scheme can increase average throughput in high spectral efficiency region with low implementa-tion-cost at the relay.

Capacity evaluation of the backhaul link in the outdoor relay system at 2.35GHz

A measurement campaign has been conducted at 2.35 GHz with a bandwidth of 50 MHz to ob- tain the statistics and evaluate the capacity of the backhaul link. Based on the measured channel im- pulse response, the channel gain, the eigenvalue statistics and the capacity are investigated. The distribution and corresponding parameters for describing the eigenvalue dispersion, the maximum and minimum eigenvalues are given. It is found that the backhaul link is relatively stable, which shows small variance of the channel gain. In spite of the fact that there are not many scatterers in the backhaul link, the channel rank can be enhanced by using dual-polarized antennas. Thus, the backhaul link can provide enough capacity.

Network Coding Based on Linear Block Codes for Multi-source Cooperative Relaying Networks

In order to improve link performance of future wireless relay networks,a network coding scheme with linear block codes was proposed,which could be deployed in a relay network consisting of multi-source sending data to a common base station(BS) with the assistance of one relay node.At BS,an iterative decoding structure between one cooperative decoder and a number of single-source decoders was established using the relayed network codes and source codes.Further,the extrinsic information transfer(EXIT) chart technique was used to predict and analyze the convergence behavior of iterative decoder.The analysis and simulation results show that the bit error ratio(BER) performance of the proposed scheme outperforms reference scheme under different relay network coding matrices.Compared with a reference scheme without the multisource cooperation,the proposed scheme can obtain network coding gain from the relay network while not reduce its code rate.

Performance analysis of selection cooperative networks over asymmetric fading channels

The performances of selection cooperation are investigated over asymmetric fading channels where the source-relay and the relay-destination channels experience Nakagami-m and Rayleigh fading,respectively.Decode-and-forward(DF)protocol is adopted and the Nth best relay is selected from M available relays.Probability density function(PDF)for the instantaneous signal-to-noise ratio(SNR)at the destination is derived first.Then,it is used to derive the exact expressions for outage probability and average symbol error rate(SER).The results hold for arbitrary M or N.Finally,simulations are carried out to verify the correctness of our theoretical analysis and results show that M and N almost have the same effect on the performance of outage probability and SER.