Sharif Digital Repository

The Partially Cooperative Relay-Broadcast Channel (PC-RBC) is a generalization of Relay Channel in which the relay node decodes its own private message. In this paper, we introduce a class of parallel PC-RBCs with three unmatched subchannels, in which the first component of the channel is assumed to be degraded, the second to be orthogonal and the third to be deterministic. We characterize the capacity region of this channel for the case where the source sends a private message for each of the users. We also investigate a class of parallel relay channels with three unmatched subchannels, in which the first component of the channel is degraded, the second is orthogonal and the third is... 

In this paper, we propose a concept of relaying named symetric relaying strategy for two relay network. In our strategy, we have two relays in the network and both relays can completely decode the message transmitted by the other relay. The proposed rate is shown to subsume the previously proposed rate for feed-forward relay network based on decodeand- forward. © 2008 IEEE  

A symmetric semideterministic relay network is introduced, generalizing Aref networks. In the considered model, there is no interference at the relays, but the links from the source and the relays to the sink are interfering and nondeterministic. An achievable rate is determined for an arbitrary number of relays, based on symmetric relaying and simultaneous partial and backward decoding at the sink. The information expressions of the achievable rate match those of the standard cut-set bound, but the set of probability distributions is substantially different. We also study a wireless example of the defined network where nondeterministic links are replaced with fading AWGN channels, and... 

In this paper we define Broadcast Relay Networks (BRN) with two relays. There are a transmitter, two relays and two receivers in the network. We find an achievable rate region for it by considering full cooperation between relays. We use symmetric relaying method at relays and Marton's broadcast code construction for the transmitter.We will show that Kramer's rate region for Broadcast Relay Channel (BRC), Ghabeli's rate for symmetric two-relay network, and Marton's rate region for Broadcast Channel are special cases of our achievable rate region  

Symmetric relaying is a method of relaying in which the relays can decode the message of other relays in the network in addition to the source message. In this paper an achievable rate is presented for a symmetric two-relay network based on partial decoding. The strategy make use of familiar techniques such as product binning, regular encoding/sliding window decoding and regular encoding/backward decoding. The proposed rate is shown to subsume the previously proposed rate for feed-forward relay network based on decode-and-forward. This rate is also used to establish the capacity of a generalisation of Aref network called 'semi-deterministic relay network with no interference at the relays'... 

In this paper, we investigate optimal coding strategies for a class of linear deterministic relay networks. The network under study is a relay network, with one source, one destination, and two relay nodes. Additionally, there is a disturbing source of signals that causes interference with the information signals received by the relay nodes. Our model captures the effect of the interference of message signals and disturbing signals on a single relay network, or the interference of signals from multiple relay networks with each other in the linear deterministic framework. For several ranges of the network parameters we find upper bounds on the maximum achievable source-destination rate in the... 

In this paper, we consider a different strategy for Broadcast-Relay- Networks (BRN) with two relays. There are a transmitter, two relays and two receivers in this network. The message of the transmitter intended to the receivers, has both common and private parts. The relays partially cooperate with each other and with the transmitter to send the common part of the message. The private parts of the message are sent to the corresponding receiver by the cooperation of the corresponding relay. We propose an achievable rate region for this network. In the proof, we take advantage of regular encoding/sliding window decoding at relays and simultaneous backward decoding analysis at receivers. The... 

In this study, the authors extend the concept of relay channel with orthogonal components to define a class of symmetric relay networks with orthogonal components named symmetric orthogonal relay network. In the defined network, the channels diverge from each node sender use different frequency bands whereas the channels converge to each node receiver use the same frequency band. This structure is very well understood in half-duplex transmission systems where the relays cannot send and receive at the same time or over the same frequency band. The authors show that the unicast capacity of the defined network is equal to the cut-set bound. In the achievability proof, the authors take advantage... 

Partial decoding scheme is a scheme in which each relay decodes only part of the transmitted message. Obviously, the achievable rates proposed by the partial decoding scheme subsume the achievable rates proposed by the full decoding scheme. The other motivation of using partial decoding scheme is that there are some special classes of relay networks such as semi-deterministic and orthogonal relay networks such that their capacities are obtained via this scheme. The authors propose a comprehensive partial decoding scheme based on regular encoding/sliding window decoding analysis to propose a new achievable rate for two-level relay networks. In contrast with the previously proposed methods,... 

The authors consider the problem of broadcast-relay-networks with two cooperative relays. There are a transmitter, two relays and two receivers in the network. The message of the transmitter intended to the receivers has common and private parts. The relays fully cooperate with each other and with the transmitter to send the common part of the message, whereas the private parts of the message are sent through the direct links between the transmitter and receivers. The authors found an achievable rate region for this network by using the symmetric relaying strategy. In this strategy, each relay completely decodes the message of other relay. In the proof the authors took advantage of regular... 

In this paper, we study the sum mean square error (SMSE) performance of all users by applying joint MIMO filter-and-forward relay and post-processing at base stations (BSs) for uplink coordinated multi-point (CoMP) reception in case of users-to-relay and relay-to-BSs frequency-selective fading channels. In order to combat the interference due to frequency-selectivity of channels, MIMO relay passes its received signals through a finite impulse response (FIR) filter. For further reducing SMSE, each BS applies a post-processing to its received signals. The goal is minimizing the SMSE subject to transmitted power constraint of MIMO relay. An iterative algorithm is proposed to jointly optimize... 

The interference channel with a cognitive relay is a variation of the classical two-user interference channel in which a relay aids the transmission among the users. The relay is assumed to have genie-aided cognition: that is it has full, a-priori, knowledge of the messages to be transmitted. We obtain a new outer bound for this channel model and prove capacity for a class of channels in which the transmissions of the two users are non interfering. This capacity result improves on a previous result for the Gaussian case in which the capacity was proved to within a gap of 3 bits/s/Hz  

Compress-and-Forward (CF) is a well-known coding strategy proposed for relay channels. Few works which were done about the generalization of the CF strategy to the relay networks, are based on irregular encoding/successive decoding. In this paper, a new generalization of the CF strategy to the relay networks based on regular encoding/backward decoding is presented. In general, backward decoding has been shown to yield higher rates in comparison with successive decoding. Here we will investigate the performance of backward decoding in our problem and show that our achievable rate includes the previously proposed rates  

For a fading full-duplex decode-and-forward relay channel, the authors analytically derive optimum power allocation schemes subject to individual power constraints at the source and the relay. The authors prove that the problem is a convex optimisation problem over the feasible power set, and by proposing a systematic technique to solve min-max problems, optimum power allocations are derived in closed-forms. Finally, for a Rayleigh-fading channel model, optimum power allocations are derived and the respective achievable rate and an upper bound are evaluated. The implications of the derived theoretical results are discussed through some graphs  

In this paper, we consider partially and fully cooperative state-dependent relay broadcast channels with perfect causal Channel State Information (CSI). For these two channels, we study three different situations: 1) both the source and the relay nodes have access to perfect CSI, 2) perfect CSI is only known to the relay nodes, 3) perfect CSI is only available at the source node. In each situation we obtain the capacity region for a degraded version of the channel. Our work subsumes previously obtained results for the degraded broadcast and relay channels with perfect causal CSI. © 2009 IEEE  

This paper presents an analytical study of average delay and throughput in a two-way relay network exploiting network coding to exchange source packets, where arrival and departure of packets are stochastic. In this case, a fundamental problem for the relay node is whether to wait in order to obtain a coding opportunity, leading to reduction of the number of transmissions, or sending a packet (coded/uncoded) whenever it has a transmission opportunity, leading to reduction of the packet delay. In order to address the fundamental trade-off between packet delay and transmission power, we develop three network coding schemes based on power-delay constraint of the application. We devise a... 

The focus of the paper is on cross-layer transmission based on rateless coding for relay networks. In the proposed method, rateless coding is used at the packet level and a separate physical layer coding is used at the physical layer. As rateless codes are originally designed and optimized for erasure channels, using these codes at the physical layer can lead to significant performance degradation. The proposed scheme has the advantage of a cross-layer design which uses a rateless code at the packet level modeled by an erasure channel. Based on the analysis and simulation results provided in this paper, the cross-layer scheme results in earlier successful decoding at the destination  

This paper focuses on cross-layer transmission based on rateless coding for relay channels. In the proposed method, rateless coding is used at packet level and a separate physical layer coding is used at the physical layer. As rateless codes are originally designed and optimized for erasure channels, using these codes at the physical layer can lead to significant performance degradation. The proposed scheme has the advantage of a cross-layer design which uses a rateless code at the packet level modeled by an erasure channel. Based on the analysis and simulation results provided in this paper, there is an exact tradeoff between physical layer code rate and rateless code depth, and the optimum... 

In this paper, we consider a new scheme based on jointly network and rateless coding for a multiple-access relay channel. In the scheme, whenever the relay can decode multiple messages of the users, it jointly encodes them using a larger rateless code. This scheme is compared with direct transmission and the conventional relaying scheme in which the relay helps each user independently at orthogonal channels. The comparison is made by evaluating the throughput of different schemes. The analytical and the simulation results show that the proposed scheme outperforms the other ones at the cases considered