Causal Relay Networks
From MaRDI portal
Publication:2977224
DOI10.1109/TIT.2015.2461674zbMATH Open1359.94921arXiv1207.4587OpenAlexW1481578368MaRDI QIDQ2977224
Sae-Young Chung, Ihn-Jung Baik
Publication date: 28 April 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1207.4587
Communication networks in operations research (90B18) Analytic circuit theory (94C05) Information theory (general) (94A15)
Recommendations
- Title not available (Why is that?) 👍 👎
- A distributed artificial network solving complex and multiple causal associations 👍 👎
- Causal graph dynamics 👍 👎
- Causal Graph Dynamics 👍 👎
- INFORMATION FLOWS IN CAUSAL NETWORKS 👍 👎
- Causal behaviours and nets 👍 👎
- Causal Belief Inference in Multiply Connected Networks 👍 👎
- Causal Network Inference by Optimal Causation Entropy 👍 👎
- Causal Erasure Channels 👍 👎
This page was built for publication: Causal Relay Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2977224)
