Reliable versus unreliable transmission for energy efficient transmission in relay networks

A network code is said to be reliable when all transmissions in the network are (deterministic) functions of the source messages; well-known examples include decode-forward for relay networks. It is said to be unreliable when transmissions depend on the noise realization at nodes; examples include compress-forward and amplify-forward. The deterministic capacity of a network is defined as the supremum of the rates achievable by reliable codes. In this paper we derive the deterministic capacity of some relay networks in the low power regime. The resulting energy per bit is then compared with the one achievable by arbitrary transmission.

[1]  Patrick P. Bergmans,et al.  A simple converse for broadcast channels with additive white Gaussian noise (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[2]  Abbas El Gamal,et al.  Capacity theorems for the relay channel , 1979, IEEE Trans. Inf. Theory.

[3]  Shlomo Shamai,et al.  Mutual information and minimum mean-square error in Gaussian channels , 2004, IEEE Transactions on Information Theory.

[4]  Wei Yu,et al.  Parity Forwarding for Multiple-Relay Networks , 2006, IEEE Transactions on Information Theory.

[5]  A. Høst-Madsen.  Deterministic Capacity of Networks in the Low Power Regime , 2011 .

[6]  Abbas El Gamal,et al.  An outer bound to the capacity region of the broadcast channel , 2006, ISIT.

[7]  Suhas N. Diggavi,et al.  The Approximate Capacity of the Gaussian n-Relay Diamond Network , 2013, IEEE Transactions on Information Theory.

[8]  A.H. Madsen,et al.  Deterministic Capacity of Networks , 2007, 2007 IEEE Information Theory Workshop.

[9]  Katalin Marton,et al.  A coding theorem for the discrete memoryless broadcast channel , 1979, IEEE Trans. Inf. Theory.