Cooperative Binning for Semideterministic Channels

Kolte, Ritesh; Özgür, Ayfer; Permuter, Haim H.

doi:10.1109/tit.2016.2515095

“…Before proving the achievability part, let us investigate important properties of the cooperative-bin-forward scheme. This scheme was derived by Kolte et al [4] and is based on mapping the discrete finite space Z n to a range of indexes L = [1 : 2 nRB ]. We refer this function as cooperative-binning for two reasons: 1) it randomly maps Z n into 2 nRB bins, and 2) the random binning is independent of all other random variables, which make 'suitable' for cooperation.…”

Section: A Directmentioning

confidence: 99%

Cooperative Binning for Semi-Deterministic Channels With Non-Causal State Information

Gattegno

¹

,

Permuter

²

,

Shamai

³

et al. 2019

IEEE Trans. Inform. Theory

Self Cite

0

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-binforward. This scheme allows cooperation between the transmitter and the relay without the need to decode a part of the message by the relay. 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 dependency 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 which shows that the capacity with non-causal CSI at the state encoder is strictly larger than the capacity with causal CSI. Index TermsCooperative-bin-forward, cooperation, cribbing, multiple-access channel, non-causal state information, random binning, relay channel, semi-deterministic channel, state encoder, wireless networks. Fig. 1: SD-RC with causal/non-causal CSI at encoder and decoder.The capacity of the relay channel was first studied by van der Muelen [1]. In the relay channel, an encoder receives a message, denoted by M , and sends it to a decoder over a channel with two outputs. A relay observes one of the channel outputs, denoted by Z, and uses past observations in order to help the encoder deliver the message.The decoder observes the other output, denoted by Y , and uses it to decode the message that was sent by the encoder. Cover and El-Gamal [2] established achievable rates for the general relay channel, using a partial-decodeforward scheme. If the channel is semi-deterministic (i.e. the output to the relay is a function of the channel inputs),El-Gamal and Aref [3] showed that this scheme achieves the capacity. Partial-decode-forward operates as follows:first, the transmission is divided into B blocks, each of length n; in each block b we send a message M (b) , at rate R, that is independent of the messages in the other blocks. The message is split; after each transmission block, the relay decodes a part of the message and forwards it to the decoder in the next block using its transmission sequence.Since the encoder also k...

show abstract

“…3. In case (a), we can use the extra advantage of Decoder 2 to reduce transmission rate on the common link to (14). In case (b), we can set the rates of l u , l v to be negligible and still ensure that the common rate is given by (14).…”

Section: Definitionmentioning

confidence: 99%

“…Our codebook generation, which has the same spirit as in [8,Section II,Remark 6], is similar to [14]. The codebook is deliberately constructed such that given available messages and the current side information symbol y i , both decoders are able to identify the output symbolx ki uniquely for all k = 1, 2 and i = 1, .…”

Section: Proof Of Theoremmentioning

confidence: 99%

Successive refinement with cribbing and side information

Vu

¹

,

Oechtering

²

,

Wiese

³

et al. 2016

2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton)

View full text Add to dashboard Cite

show abstract

“…The cooperation is expressed in the joint PMF, in which X and X r are dependent. However, when the channel depends on a state that is unknown to the relay, the partial-decode-forward scheme is suboptimal [5], i.e., it does not achieve the capacity. The partial-decoding procedure at the relay is too restrictive since the relay is not aware of the channel state.…”

mentioning

confidence: 99%

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)

Self Cite

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

Cooperative Binning for Semideterministic Channels

Cited by 7 publications

References 33 publications

Cooperative Binning for Semi-Deterministic Channels With Non-Causal State Information

Cooperative Binning for Semi-Deterministic Channels With Non-Causal State Information

Successive refinement with cribbing and side information

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

Contact Info

Product

Resources

About