Cooperative Relaying With State Available Noncausally at the Relay

Zaidi, Abdellatif; Kotagiri, Shiva Prasad; Laneman, J. Nicholas; Vandendorpe, Luc

doi:10.1109/tit.2010.2043782

Cited by 62 publications

(63 citation statements)

References 50 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This models a relay channel, where Encoder 2 is a relay which has no message of its own and learns the information of the transmitter by cribbing (modeling excellent SNR conditions on this path). This model relates to [42], if the structure of the primary user (X 3 ) is not accounted for, thus assuming i.i.d. state symbols known a-causally at the relay, as in [42].…”

Section: Definitionmentioning

confidence: 99%

See 1 more Smart Citation

Cognition and Cooperation in Interfered Multiple Access Channels

Shimonovich

Somekh-Baruch

Shlomo

2017

Entropy

View full text Add to dashboard Cite

Abstract:In this work, we investigate a three-user cognitive communication network where a primary two-user multiple access channel suffers interference from a secondary point-to-point channel, sharing the same medium. While the point-to-point channel transmitter-transmitter 3-causes an interference at the primary multiple access channel receiver, we assume that the primary channel transmitters-transmitters 1 and 2-do not cause any interference at the point-to-point receiver.It is assumed that one of the multiple access channel transmitters has cognitive capabilities and cribs causally from the other multiple access channel transmitter. Furthermore, we assume that the cognitive transmitter knows the message of transmitter 3 in a non-causal manner, thus introducing the three-user multiple access cognitive Z-interference channel. We obtain inner and outer bounds on the capacity region of the this channel for both causal and strictly causal cribbing cognitive encoders. We further investigate different variations and aspects of the channel, referring to some previously studied cases. Attempting to better characterize the capacity region we look at the vertex points of the capacity region where each one of the transmitters tries to achieve its maximal rate. Moreover, we find the capacity region of a special case of a certain kind of more-capable multiple access cognitive Z-interference channels. In addition, we study the case of full unidirectional cooperation between the 2 multiple access channel encoders. Finally, since direct cribbing allows us full cognition in the case of continuous input alphabets, we study the case of partial cribbing, i.e., when the cribbing is performed via a deterministic function.

show abstract

Section: Definitionmentioning

confidence: 99%

“…This model relates to [42], if the structure of the primary user (X 3 ) is not accounted for, thus assuming i.i.d. state symbols known a-causally at the relay, as in [42].…”

Section: Definitionmentioning

confidence: 99%

Cognition and Cooperation in Interfered Multiple Access Channels

Shimonovich

Somekh-Baruch

Shlomo

2017

Entropy

View full text Add to dashboard Cite

show abstract

“…We also note that the relay can acquire some knowledge about the channel state sequence Z n from its channel output Y n R , and could use it in the transmission over the relay-destination link, which depends on the same state information sequence. In general, non-causal state information available at the relay can be exploited to increase the achievable throughput in multi-user setups [21], [22]. However, it follows from Theorem 1 that this knowledge is useless.…”

Section: Proofmentioning

confidence: 99%

Capacity of a Class of State-Dependent Orthogonal Relay Channels

Aguerri

Gündüz

2016

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

Abstract-The class of orthogonal relay channels in which the orthogonal channels connecting the source terminal to the relay and the destination, and the relay to the destination, depend on a state sequence, is considered. It is assumed that the state sequence is fully known at the destination while it is not known at the source or the relay. The capacity of this class of relay channels is characterized, and shown to be achieved by the partial decode-compress-and-forward (pDCF) scheme. Then the capacity of certain binary and Gaussian state-dependent orthogonal relay channels are studied in detail, and it is shown that the compress-and-forward (CF) and partial-decode-andforward (pDF) schemes are suboptimal in general. To the best of our knowledge, this is the first single relay channel model for which the capacity is achieved by pDCF, while pDF and CF schemes are both suboptimal. Furthermore, it is shown that the capacity of the considered class of state-dependent orthogonal relay channels is in general below the cut-set bound. The conditions under which pDF or CF suffices to meet the cut-set bound, and hence, achieve the capacity, are also derived.Index Terms-Capacity, channels with state, relay channel, decode-and-forward, compress-and-forward, partial decodecompress-and forward.

show abstract

“…Recently, the state dependent relay channel (SDRC) with discrete memoryless (DM) channel state has been studied excessively. For SD-RC with noncausal CSI, the DF lower bound is established in [8,9]. And the CF lower bound is characterized in [10,11].…”

Section: Introductionmentioning

confidence: 99%

Decode-Forward Relaying with State Available Noncausally at the Relay

Shen¹,

Wang²,

Wang³

et al. 2017

dtcse

View full text Add to dashboard Cite

Abstract. The problem of relay channel (RC) with noncausal channel state information (CSI) available at the relay is considered. With the CSI, the relay can help communication in two ways: 1) by relaying message information; 2) by conveying the CSI to help the destination decode. In previous work, Zaidi et al. established a lower bound by letting the relay send message information by performing Gelfand-Pinsker (GP) coding. While in our schemes, we combine the two ways by letting the relay send message information as well as the compressed CSI to the receivers. We investigate three decode-forward (DF) lower bounds. The first two bounds are obtained by transmitting the message information and the CSI directly. We find this scheme is surprisingly equivalent to Zaidi's. The third bound is established by exploiting a new coding scheme. We show that the third bound is tighter than others. We also generalize RC to discrete memoryless multicast network (DM-MN). To our knowledge, we are the first to characterize the DF lower bound and cutset upper bound for DM-MN with noncausal CSI only at the relay nodes. We also give the condition under which DF lower bound is tight.

show abstract

Cooperative Relaying With State Available Noncausally at the Relay

Cited by 62 publications

References 50 publications

Cognition and Cooperation in Interfered Multiple Access Channels

Cognition and Cooperation in Interfered Multiple Access Channels

Capacity of a Class of State-Dependent Orthogonal Relay Channels

Decode-Forward Relaying with State Available Noncausally at the Relay

Contact Info

Product

Resources

About