Compress-and-forward strategy for the relay channel with causal state information

Mirmohseni, Mahtab; Akhbari, Bahareh; Aref, Mohammad Reza

doi:10.1109/itw.2009.5351399

Cited by 18 publications

(21 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…With the causal CSI, the relay nodes both exploit Shannon strategy [19,23] and transmit compressed CSI to the destination. So the receiver can use the received CSI to improve decoding.…”

Section: Causal Csi Only At Relay Nodesmentioning

confidence: 99%

Noisy network coding with causal channel state information

Wang

Gui

2012

2012 International Symposium on Network Coding (NetCod)

View full text Add to dashboard Cite

This paper considers a noisy network coding scheme for relay noisy networks with causal channel state information (CSI). We mainly focus on two models: discrete memoryless multicast network (DM-MN) and discrete memoryless network (DMN). Two different situations are investigated: 1) causal CSI only at the relay nodes, 2) causal CSI at all the nodes. The second situation is easily specialized to other cases: causal CSI at both the source and relay nodes; causal CSI at both the destination and relay nodes.Typically, causal CSI at the transmitter is only used for precoding, known as Shannon strategy. However, in our scheme causal CSI is compressed and transmitted with message information. Wyner-Ziv binning is used for compression and Shannon strategy is exploited to transmit both the message and CSI. It is a channel coding problem with respect to the message. On the other hand, it is a distributed source coding problem for sharing the CSI. We are the first to characterize noisy network coding inner bound with causal CSI. We also recover the result for relay channel (RC) as special case of DM-MN. And we indicate that our bound contains others in previous work. We also discuss some cases in which our scheme is strictly better.

show abstract

“…With the causal CSI, the relay nodes both exploit Shannon strategy [19,23] and transmit compressed CSI to the destination. So the receiver can use the received CSI to improve decoding.…”

Section: Causal Csi Only At Relay Nodesmentioning

confidence: 99%

Noisy network coding with causal channel state information

Wang

Gui

2012

2012 International Symposium on Network Coding (NetCod)

View full text Add to dashboard Cite

show abstract

“…So the destination can use the received CSI to help it decode. In all the previous work on SD-RC with CSI [8,9,10,13], the CSI is only used for precoding. That is using Shannon strategy for causal CSI and GP coding for noncausal CSI.…”

Section: Introductionmentioning

confidence: 99%

“…By setting 3 N = , DM-MN reduces to RC. The bound (7) reduces to (13) and we get the upper bound for RC with noncausal CSI at the relay.…”

mentioning

confidence: 99%

See 1 more Smart Citation

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

“…The model in which the state is non-causally known only at the relay is studied in [12] while causal and non-causal knowledge is considered in [13]. Similarly, the relay channel with state causally known at the source and relay is considered in [14], and state non-causally known at the source, relay and destination in [15]. Recently a generalization of pDF, called the cooperative-bin-forward scheme, has been shown to achieve the capacity of state-dependent semi-deterministic relay channels with causal state information at the source and destination [16].…”

mentioning

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

Compress-and-forward strategy for the relay channel with causal state information

Cited by 18 publications

References 19 publications

Noisy network coding with causal channel state information

Noisy network coding with causal channel state information

Decode-Forward Relaying with State Available Noncausally at the Relay

Capacity of a Class of State-Dependent Orthogonal Relay Channels

Contact Info

Product

Resources

About