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 asymm...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.展开更多
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 rel...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.展开更多
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 ...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.展开更多
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,whic...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.展开更多
基金supported by the National Natural Science Foundation of China under Grant No.61101248the Equipment Advance Research Projectof"Twelfth Five-Year"Plan under Grant No.51306040202And this work has been performed in the Project"Advanced Communication Research Program(ACRP)"supported by the Directorate of Research and Development,Defense Science and Technology Agency,Singapore under Grant No.DSOCL04020
文摘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.
基金supported by the National Natural Science Foundation of China under Grant No.60902092
文摘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.
基金supported by the National Natural Science Foundation of China under Grants No.60972045,No.61071089the Natural Science Foundation of Jiangsu Province under Grant No. BK2010077+4 种基金the Open Project of State Key Laboratory of Networking and Switching under Grant No.SKLNST-2009-1-12the Priority Academic Program Development of Jiangsu Provincethe University Postgraduate Research and Innovation Project in Jiangsu Province under Grant No.CXZZ11_0395the Fundamental Research Funds for the Central Universities under Grant No.2009B32114the Excellent Innovative Research Team of High Schools in Jiangsu Province under Grant No.TJ208029
文摘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.
基金Supported by the National Basic Research Program of China(No.2012CB316100)the National Natural Science Foundation of China(No.61072064,61201140,61301177)
文摘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.