Capacity of a Class of State-Dependent Orthogonal Relay Channels

Aguerri, Iñaki Estella; Gündüz, Deniz

doi:10.1109/tit.2016.2514343

Cited by 6 publications

(9 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…If (34) does not hold, then decode-and-forward achieves the cut-set bound, and it is optimal. Furthermore, if (35) does not hold, then our scheme reduces to compress-and-forward, and the achievable rate is given by (23). As we will see in the proof, we have two slightly different schemes for the cases (i) I(X S ; Y SR ) ≥ I(X S ; Y SD ) and (ii) I(X S ; Y SR ) < I(X S ; Y SD ).…”

Section: Resultsmentioning

confidence: 98%

“…However, we allow different time-sharing strategies across different channels: in the channel from relay to destination, part of the compressed message of the first block is sent together with the message of the second block. This is different from the 'classical' way of implementing time-sharing, which can be realized through the partial decode-compress-and-forward scheme, as described for example in [35]. In [35], in the same block, a part of the message is processed according to the decode-and-forward scheme, and the remaining part is processed according to the compress-and-forward scheme.…”

Section: Remarkmentioning

confidence: 97%

“…This is different from the 'classical' way of implementing time-sharing, which can be realized through the partial decode-compress-and-forward scheme, as described for example in [35]. In [35], in the same block, a part of the message is processed according to the decode-and-forward scheme, and the remaining part is processed according to the compress-and-forward scheme. Therefore, it is not clear that the rate achievable by our scheme can also be achieved by partial decode-compress-and-forward.…”

Section: Remarkmentioning

confidence: 97%

“…Partial decode-compress-and-forward is a generalization of partial decode-and-forward and compress-and-forward. Futhermore, it can strictly improve on both, e.g., for the state-dependent orthogonal relay channel with state information available at the destination [35]. Let us consider the case of the primitive relay channel and pick V = ∅.…”

Section: Partial Decode-compress-and-forward Lower Boundmentioning

confidence: 99%

“…For a review on the relay 34 channel, see also [17,Chapter 16] and [18,Chapter 9]. 35 Polar codes, introduced by Arıkan in [19], have been employed to devise practical schemes for the relay 36 channel. In particular, for the case of the degraded relay channel where…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

A New Coding Paradigm for the Primitive Relay Channel

2019

View full text Add to dashboard Cite

We consider the primitive relay channel, where the source sends a message to the relay and to the destination, and the relay helps the communication by transmitting an additional message to the destination via a separate channel. Two well-known coding techniques have been introduced for this setting: decode-and-forward and compress-and-forward. In decode-and-forward, the relay completely decodes the message and sends some information to the destination; in compress-and-forward, the relay does not decode, and it sends a compressed version of the received signal to the destination using Wyner–Ziv coding. In this paper, we present a novel coding paradigm that provides an improved achievable rate for the primitive relay channel. The idea is to combine compress-and-forward and decode-and-forward via a chaining construction. We transmit over pairs of blocks: in the first block, we use compress-and-forward; and, in the second block, we use decode-and-forward. More specifically, in the first block, the relay does not decode, it compresses the received signal via Wyner–Ziv, and it sends only part of the compression to the destination. In the second block, the relay completely decodes the message, it sends some information to the destination, and it also sends the remaining part of the compression coming from the first block. By doing so, we are able to strictly outperform both compress-and-forward and decode-and-forward. Note that the proposed coding scheme can be implemented with polar codes. As such, it has the typical attractive properties of polar coding schemes, namely, quasi-linear encoding and decoding complexity, and error probability that decays at super-polynomial speed. As a running example, we take into account the special case of the erasure relay channel, and we provide a comparison between the rates achievable by our proposed scheme and the existing upper and lower bounds.

show abstract

Section: Resultsmentioning

confidence: 98%

Section: Remarkmentioning

confidence: 97%

Section: Remarkmentioning

confidence: 97%

Section: Partial Decode-compress-and-forward Lower Boundmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

A New Coding Paradigm for the Primitive Relay Channel

2019

View full text Add to dashboard Cite

show abstract

Deep Joint Source-Channel Coding Over the Relay Channel

Bian,

Shao,

et al. 2024

2024 IEEE International Conference on Machine Learning for Communication and Networking (ICMLCN)

View full text Add to dashboard Cite

Cooperative binning for semi-deterministic channels with non-causal state information

Gattegno

Permuter

Shamai

et al. 2017

2017 IEEE International Symposium on Information Theory (ISIT)

View full text Add to dashboard Cite

The capacity of the semi-deterministic relay channel (SD-RC) with non-causal channel state information (CSI) only at the encoder and decoder is characterized. The capacity is achieved by a scheme based on cooperative-bin-forward. This scheme allows cooperation between the transmitter and the relay without the need of the later to decode a part of the message. The transmission is divided into blocks, and each deterministic output of the channel (observed by the relay) is mapped to a bin. The bin index is used by the encoder and the relay to choose the cooperation codeword in the next transmission block. In causal settings, the cooperation is independent of the state. In non-causal settings, dependence between the relay's transmission and the state can increase the transmission rates. The encoder implicitly conveys partial state information to the relay. In particular, it uses the states of the next block and selects a cooperation codeword accordingly, and the relay transmission depends on the cooperation codeword and, therefore, also on the states. We also consider the multiple access channel with partial cribbing as a semi-deterministic channel. The capacity region of this channel with non-causal CSI is achieved by the new scheme. Examining the result in several cases, we introduce a new problem of a point-to-point (PTP) channel where the state is provided to the transmitter by a state encoder. Interestingly, even though the CSI is also available at the receiver, we provide an example showing that the capacity with non-causal CSI at the state encoder is strictly larger than the capacity with causal CSI. Index Terms-Cooperative binning, random binning, relay channel, multiple-access channel, semi-deterministic channel. I. INTRODUCTION S EMI-DETERMINISTIC models describe a variety of communication problems in which there exists a deterministic link between a transmitter and a receiver [1]. The semi-deterministic relay channel plays an important role in the study of relay channels, as it is the canonical model where various schemes are known to achieve capacity. This

show abstract

Capacity of a Class of State-Dependent Orthogonal Relay Channels

Cited by 6 publications

References 30 publications

A New Coding Paradigm for the Primitive Relay Channel

A New Coding Paradigm for the Primitive Relay Channel

Deep Joint Source-Channel Coding Over the Relay Channel

Cooperative binning for semi-deterministic channels with non-causal state information

Contact Info

Product

Resources

About