Capacity Approaching Turbo Coding For Half-Duplex Relaying

In this paper, we develop capacity approaching turbo coding schemes for half-duplex relay systems as an extension of our previous work on coding for full-duplex relays. We consider the use of specific signal constellations (e.g., binary phase-shift keying) in transmission, develop practical coding schemes to be used at the source and the relay nodes, and describe a suitable information combining technique at the destination node. Unlike the full-duplex relay systems, the destination node does not perform joint decoding of multiple consecutive blocks; instead, it works with one frame at a time. Furthermore, for the half-duplex relaying scheme, the optimization of the length of the listening period for the relay node is an issue. By utilizing the information theoretical tools, we perform this optimization, and use it in our development of capacity approaching coding/decoding schemes. Specifically, when the fraction of time turns out to be less than the transmission rate, the relay node is unable to decode all the information bits transmitted, and a partial decoding approach has to be used. Through a comprehensive set of examples, we observe that the proposed scheme is promising to approach the corresponding information theoretical limits (bounds). In particular, for all the cases studied, we have obtained bit error rates of $10^{-5}$ or lower within 1–1.5 dB (in most cases, around within 1.2 dB) of the constrained capacity under a variety of channel conditions. Extensions of the proposed scheme to coded modulation and to multiple-input multiple-output systems are also described.      

半双工译码转发中继信道下的空间耦合RA码设计

针对半双工译码转发中继信道,提出了一种可逼近三节点中继信道容量限的空间耦合RA码的设计方法。针对二进制删除信道,源节点分别向中继节点和目的节点发送空间耦合RA码,中继节点先正确恢复出源节点发送的空间耦合RA,然后再次编码产生额外的校验比特并转发给目的节点;目的节点结合中继节点发送的额外校验比特和源节点发送的空间耦合RA码进行译码,正确恢复出源节点的信息。为了评估所设计的空间耦合RA码在三节点中继信道下的渐近性能,推导了密度进化算法用于计算阈值。阈值分析结果表明,所提出的空间耦合RA码能够同时逼近源到中继链路和源到目的链路的容量限。同时,基于半双工二进制删除中继信道,仿真了所设计的空间耦合RA码的误码性能,结果表明,其误码性能与所推导的密度进化算法计算的阈值结果一致,呈现出逼近于容量限的优异性能,且优于采用空间耦合低密度奇偶校验(Low Density Parity Check,LDPC)码的性能。     

解码前传半双工中继信道下协作LDPC码设计

为逼近解码前传半双工中继信道容量,该文提出一种协作LDPC编码结构及度分布优化方法。与双层删除LDPC码不同,该结构将中继校验比特视为协作LDPC码的一部分,目的端利用从信源和中继接收的消息进行联合译码获得信源信息。为了分析协作LDPC码性能,拓展传统外信息转移(EXIT)图,推导了基于消息错误概率的双层EXIT图噪声门限分析方法。在此基础上,提出了协作LDPC码度分布优化方法,采用差分进化算法搜索了一组具有最大噪声门限的协作LDPC码。实验仿真证明,与双层删除LDPC码相比,协作LDPC码的性能得到了不同程度的改善。     

半双工中继信道下联合LDPC码设计

为了提高解码前传半双工中继通信系统的编码增益,提出了一种联合LDPC码编码结构及其度分布优化方法。该结构视信源和中继子码为联合LDPC码的一部分,目的端根据从信源和中继接收的消息进行联合译码,同时获得信源和中继的信息。为了分析联合LDPC码的渐进性能,推导了AWGN信道下联合LDPC码的高斯近似密度进化算法。结合译码收敛条件和度分布约束关系,提出联合LDPC码的度分布优化问题。仿真结果表明：联合LDPC码的渐进性能及误码性能优于BE-LDPC码和独立处理（SP）码。     

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.     

采用LDPC码的分布式联合信源信道网络编码

提出了采用低密度奇偶校验码的分布式联合信源信道网络编码方案,应用于两源一中继一目的节点的无线传感器网络中.在方案中,信源节点通过传输系统信道码的校验位与部分信息位,同时实现了信源压缩与信道纠错.中继节点有效利用数据的相关性进行译码,并进行部分数据比特删余,减少因中继端网络编码引起的错误传播,仿真验证了方案的有效性.应用了不等差错保护思想,更贴近实际应用场景,利于目的节点进行更好的低误差解码.     

Large intelligent surfaces: Random waypoint mobility and two‐way relaying

In this paper, we first investigate the effect of mobility via the random waypoint (RWP) mobility model on the performance of nonaccess point (non‐AP) or AP large intelligent surfaces (LISs). The theoretical average bit error probability (ABEP) for each of these LISs under mobility is formulated. The presented formulation is complicated to solve; hence, the trapezoidal approximation is employed. Simulation results serve to validate the ABEP. Second, we investigate a two‐way relaying (TWR) network assisted by non‐AP or AP LISs. A network with two source/destination nodes with a single relay node employing decode‐and‐forward placed between these nodes is considered. The transmission interval is broken into two transmission phases. In the first phase, the two source nodes transmit information blocks to the relay node assisted by LISs. On receiving these information blocks, the relay node decodes the two information blocks and encodes these into a single information block via the use of network coding. In the second phase, the relay node forwards the network‐coded information block to the destination nodes assisted by LISs, where the intended information block is decoded via network coding. The theoretical ABEP is formulated for the proposed non‐AP and AP LIS‐assisted TWR schemes and is validated by simulation results. RWP mobility is also demonstrated for the proposed TWR schemes.     

Spectral efficient protocols for half-duplex fading relay channels

We study two-hop communication protocols where one or several relay terminals assist in the communication between two or more terminals. All terminals operate in half-duplex mode, hence the transmission of one information symbol from the source terminal to the destination terminal occupies two channel uses. This leads to a loss in spectral efficiency due to the pre-log factor one-half in corresponding capacity expressions. We propose two new half-duplex relaying protocols that avoid the pre-log factor one-half. Firstly, we consider a relaying protocol where a bidirectional connection between two terminals is established via one amplify-and-forward (AF) or decode-and-forward (DF) relay (two-way relaying). We also extend this protocol to a multi-user scenario, where multiple terminals communicate with multiple partner terminals via several orthogonalize-and-forward (OF) relay terminals, i.e., the relays orthogonalize the different two-way transmissions by a distributed zero-forcing algorithm. Secondly, we propose a relaying protocol where two relays, either AF or DF, alternately forward messages from a source terminal to a destination terminal (two-path relaying). It is shown that both protocols recover a significant portion of the half-duplex loss     

Resource Allocation for Wireless Fading Relay Channels: Max-Min Solution

Resource allocation is investigated for fading relay channels under separate power constraints at the source and relay nodes. As a basic information-theoretic model for fading relay channels, the parallel relay channel is first studied, which consists of multiple independent three-terminal relay channels as subchannels. Lower and upper bounds on the capacity are derived, and are shown to match, and thus establish the capacity for the parallel relay channel with degraded subchannels. This capacity theorem is further demonstrated via the Gaussian parallel relay channel with degraded subchannels, for which the synchronized and asynchronized capacities are obtained. The capacity-achieving power allocation at the source and relay nodes among the subchannels is partially characterized for the synchronized case and fully characterized for the asynchronized case. The fading relay channel is then studied, which is based on the three-terminal relay channel with each communication link being corrupted by a multiplicative fading gain coefficient as well as an additive Gaussian noise term. For each link, the fading state information is assumed to be known at both the transmitter and the receiver. The source and relay nodes are allowed to allocate their power adaptively according to the instantaneous channel state information. The source and relay nodes are assumed to be subject to separate power constraints. For both the full-duplex and half-duplex cases, power allocations that maximize the achievable rates are obtained. In the half-duplex case, the power allocation needs to be jointly optimized with the channel resource (time and bandwidth) allocation between the two orthogonal channels over which the relay node transmits and receives. Capacities are established for fading relay channels that satisfy certain conditions.     

Energy efficiency optimization of one-way and two-way DF relaying considering circuit power

In this paper, the energy efficiency (EE) of a decode and forward (DF) relay system is studied, where two sources communicate through a half-duplex relay node in one-way and two-way relaying strategies. Both the circuitry power and the transmission power of all nodes are taken into consideration. In addition, three different coding schemes for two-way DF relaying strategy with two phases and two-way DF relaying with three phases are considered. The aim is to maximize the EE of the system for a constant spectral efficiency (SE). For this purpose, the transmission time and the transmission power of each node are optimized. Simulations are used to compare the EE–SE curve of different DF strategies with one-way and two-way amplify and forward (AF) strategies and direct transmission (DT), to find the best energy efficient strategy in different SE conditions. Analytical and simulation results demonstrate that in low SE conditions, DF relaying strategies are more energy efficient compared to that of AF strategies and DT. However, in high SE conditions, the EE of two-way AF relaying and DT strategy outperform some of the DF relaying strategies. In simulations, the impact of different circuitry power and different channel conditions on the EE–SE curves are also investigated.     

Impact of Implicit Feedback Channel in Cooperative Relay Networks

In a multi-node network, cooperation among nodes is an effective means to enhance coverage and potentially increase the capacity. For such systems, schemes based on incremental relaying have great potential to improve the spectral efficiency by adapting the transmission to time varying channel conditions. The performance enhancement brought about by the presence of relays in such incremental relaying based cooperative systems is dependent on the level of cooperation (based on the relay information quality) and on coordination among the nodes. Coordination is achieved through the use of feedback channels, which incurs significant bandwidth penalty and brings down the spectral efficiency. In order to mitigate this, one can exploit an implicit feedback channel available due to broadcast nature of relay transmissions. Instead of using dedicated feedback channels, the implicit feedback channel is used to measure the relay information quality. Based on this information, the transmitter (source/relay) for the additional coded (redundancy) bits is determined. Such a mechanism enhances the reliability as it ensures the availability of correct information at the destination node for decoding. This paper studies the impact of such an implicit feedback channel by employing powerful codes which exhibit inherent incremental redundancy features, such as rate-compatible codes (rate-compatible punctured convolutional (RCPC) codes and punctured low-density parity-check (LDPC) codes) and rateless codes (Luby Transform (LT) codes). Theoretical analyses of the proposed scheme are presented, and supported with results from extensive simulation studies.     

LDPC-coded cooperative relay systems: performance analysis and code design

We treat the problem of designing low-density parity-check (LDPC) codes to approach the capacity of relay channels. We consider an efficient analysis framework that decouples the factor graph (FG) of a B-block transmission into successive partial FGs, each of which denotes a two-block transmission. We develop design methods to find the optimum code ensemble for the partial FG. In particular, we formulate the relay operations and the destination operations as equivalent virtual MISO and MIMO systems, and employ a binary symmetric channel (BSC) model for the relay node output. For AWGN channels, we further develop a Gaussian approximation for the detector output at the destination node. Jointly treating the relay and the destination, we analyze the performance of the LDPC-coded relay system using the extrinsic mutual information transfer(EXIT) chart technique. Furthermore, differential evolution is employed to search for the optimum code ensemble. Our results show that the optimized codes always outperform the regular LDPC codes with a significant gain; in the AWGN case, when Protocol-II is employed and the relay is close to the source, the optimized code performs within 0.1dB to the capacity bound.     

Capacity-approaching turbo coding and iterative decoding for relay channels

In this paper, we design turbo-based coding schemes for relay systems together with iterative decoding algorithms. In the proposed schemes, the source node sends coded information bits to both the relay and the destination nodes, while the relay simultaneously forwards its estimate for the previous coded block to the destination after decoding and re-encoding. The destination observes a superposition of the codewords and uses an iterative decoding algorithm to estimate the transmitted messages. Different from the block-by-block decoding techniques used in the literature, this decoding scheme operates over all the transmitted blocks jointly. Various encoding and decoding approaches are proposed for both single-input single-output and multi-input multi-output systems over several different channel models. Capacity bounds and information-rate bounds with binary inputs are also provided, and it is shown that the performance of the proposed practical scheme is typically about 1.0-1.5 dB away from the theoretical limits, and a remarkable advantage can be achieved over the direct and multihop transmission alternatives.     

Diversity–Multiplexing Tradeoff of Asynchronous Cooperative Diversity in Wireless Networks

Synchronization of relay nodes is an important and critical issue in exploiting cooperative diversity in wireless networks. In this paper, two asynchronous cooperative diversity schemes are proposed, namely, distributed delay diversity and asynchronous space-time coded cooperative diversity schemes. In terms of the overall diversity-multiplexing (DM) tradeoff function, we show that the proposed independent coding based distributed delay diversity and asynchronous space-time coded cooperative diversity schemes achieve the same performance as the synchronous space-time coded approach which requires an accurate symbol-level timing synchronization to ensure signals arriving at the destination from different relay nodes are perfectly synchronized. This demonstrates diversity order is maintained even at the presence of asynchronism between relay node. Moreover, when all relay nodes succeed in decoding the source information, the asynchronous space-time coded approach is capable of achieving better DM tradeoff than synchronous schemes and performs equivalently to transmitting information through a parallel fading channel as far as the DM tradeoff is concerned. Our results suggest the benefits of fully exploiting the space-time degrees of freedom in multiple antenna systems by employing asynchronous space-time codes even in a frequency-flat-fading channel. In addition, it is shown asynchronous space-time coded systems are able to achieve higher mutual information than synchronous space-time coded systems for any finite signal-to-noise ratio (SNR) when properly selected baseband waveforms are employed.     

Achievable rate for three-node discrete memoryless relay channel with generalized feedbacks

This paper studies the achievable rate for three-node discrete memoryless relay channel.Specifically in this mode,we explore two generalized feedbacks simultaneously:the source node actively collects feedback signals from the channel;and at the same time,the destination node actively transmits feedback signals to the relay node.These two feedback signals,which are called generalized feedback overheard from the channel that is likely to be noisy,induce that all the three nodes are in full duplex mode.The basic coding strategies of Cover and El Gamal are applied to the relay-source feedback transmission by the source forwarding the compressions of the channel output sequences at the relay node to the destination,and are also applied to the destination-relay feedback transmission to improve the decoding ability at the relay.Based on Cover and El Gamal coding,a new coding scheme adopting rate splitting and four-block Markov superposition encoding is proposed and the corresponding achievable rate is achieved.The proposed scheme is able to exploit two feedbacks simultaneously which can effectively eliminate underlying transmission bottlenecks for the channels.The derived achievable rate result generalizes several previously known results by including them as special cases.     

Transmission scheduling in a multi‐channel wireless network with bidirectional relaying links

Using network coding in a wireless network can potentially improve the network throughput. On the other hand, it increases the complexity of resource allocations as the quality of one transmission is affected by the link conditions of the transmitter to multiple receivers. In this work, we study time slot scheduling and channel allocations jointly for a network with bidirectional relaying links, where the two end nodes of each link can exchange data through a relay node. Two scenarios are considered when the relay node forwards packets to the end nodes. In the first scenario, the relay node always forwards network‐coded packets to both end nodes simultaneously; in the second scenario, the relay node opportunistically uses network coding for two‐way relaying and traditional one‐way relaying. For each scenario, an optimization problem is first formulated for maximizing the total network throughput. The optimum scheduling is not causal because it requires future information of channel conditions. We then propose heuristic scheduling schemes. The slot‐based scheduling maximizes the total transmission rate of all the nodes at each time slot, and the node‐based scheduling schedules transmissions based on achievable transmission rates of individual nodes at different channels. The node‐based one has lower complexity than the slot‐based one. Our results indicate that although the node‐based scheduling achieves slightly lower throughput than the slot‐based one, both the proposed scheduling schemes are very effective in the sense that the difference between their throughput and the optimum scheduling is relatively small in different network settings. Copyright © 2015 John Wiley & Sons, Ltd.     

On the capacity of the single source multiple relay single destination mesh network

In this paper, we derive the information theoretic capacity of a special class of mesh networks. A mesh network is a heterogeneous wireless network in which the transmission among power limited nodes is assisted by powerful relays, which use the same wireless medium. We investigate the mesh network when there is one source, one destination, and multiple relays, which we call the single source multiple relay single destination (SSMRSD) mesh network. We derive the asymptotic capacity of the SSMRSD mesh network when the relay powers grow to infinity. Our approach is as follows. We first look at an upper bound on the information theoretic capacity of these networks in a Gaussian setting. We then show that this bound is achievable asymptotically using the compress-and-forward strategy for the multiple relay channel. We also perform numerical computations for the case when the relays have finite powers. We observe that even when the relay power is only a few times larger than the source power, the compress-and-forward rate gets close to the capacity. The results indicate the value of cooperation in wireless mesh networks. The capacity characterization quantifies how the relays can cooperate, using the compress-and-forward strategy, to either conserve node energy or to increase transmission rate.     

基于中断概率的多跳混合协作地理路由算法

为了减小无线传感器网络中路由的路径长度,该文提出基于中断概率的多跳混合协作地理路由(MHCGR)算法。首先对不同协作机制的链路进行分析,理论分析表明,在一定中断概率要求下,采用译码放大转发混合协作机制可以进一步扩大传输距离,并推导了每跳协作链路的理想最大协作传输距离和理想中继的位置。在无信标地理路由(BLGR)算法的基础上,MHCGR算法结合节点位置信息为每跳选择最佳的中继节点和转发节点,建立从源节点到目的节点的多跳协作路由。仿真表明,与ENBGCR算法和基于DF协作机制的MPCR算法两种协作地理路由算法相比,MHCGR算法可明显减少路由的跳数,改善路由的整体发射功率。     

On cooperative source transmission with partial rate and power control

The problem of transmitting a Gaussian source over a half-duplex fading relay channel with limited channel state feedback is studied. It is shown that under a short-term power constraint, combining a simple feedback scheme with separate source and channel coding outperforms the best known no-feedback strategies even with only a few bits of feedback information. Partial power control is shown to be instrumental in achieving a very fast decaying average distortion, especially in the regime of high bandwidth ratios. Performance limitation due to the lack of full channel state information at the destination is also investigated, where the degradation in terms of the distortion exponent is shown to be significant. However, even in such restrictive scenarios, using partial feedback still yields distortion exponents superior to any no-feedback schemes.     

Performance evaluation of multicast relay network using LDPC and convolutional channel codes along-with XOR network coding

In this paper,we have compared the performance of joint network channel coding(JNCC) for multicast relay network using low density parity check(LDPC) codes and Convolutional codes as channel codes while exclusive or(XOR) network coding used at the intermediate relay nodes.Multicast relay transmission is a type of transmission scheme in which two fixed relay nodes contribute in the second hop of end-to-end transmission between base transceiver station(BTS) and a pair of mobile stations.We have considered one way and two way multicast scenarios to evaluate the bit error rate(BER) and throughput performance.It has been shown that when using XOR network coding at the intermediate relay nodes,the same transmission becomes possible in less time slots hence throughput performance can be improved.Moreover we have also discussed two possible scenarios in the proposed system model,in which both diversity and multiplexing gain has been considered.It is worth notifying that BER and throughput achieved for LDPC codes is better than Convolutional codes for all the schemes discussed.