English

Causal relay networks

Information Theory 2012-07-20 v1 math.IT

Abstract

In this paper, we study causal discrete-memoryless relay networks (DMRNs). The network consists of multiple nodes, each of which can be a source, relay, and/or destination. In the network, there are two types of relays, i.e., relays with one sample delay (strictly causal) and relays without delay (causal) whose transmit signal depends not only on the past received symbols but also on the current received symbol. For this network, we derive two new cut-set bounds, one when the causal relays have their own messages and the other when not. Using examples of a causal vector Gaussian two-way relay channel and a causal vector Gaussian relay channel, we show that the new cut-set bounds can be achieved by a simple amplify-and-forward type relaying. Our result for the causal relay channel strengthens the previously known capacity result for the same channel by El Gamal, Hassanpour, and Mammen.

Cite

@article{arxiv.1207.4587,
  title  = {Causal relay networks},
  author = {Ihn-Jung Baik and Sae-Young Chung},
  journal= {arXiv preprint arXiv:1207.4587},
  year   = {2012}
}

Comments

27 pages, 2 figures, submitted to IEEE Transactions on Information Theory

R2 v1 2026-06-21T21:38:18.596Z