Distributed decode-forward for multicast

A new coding scheme for multicasting a message over a general relay network is presented that extends both network coding for graphical networks by Ahlswede, Cai, Li, and Yeung, and partial decode-forward for relay channels by Cover and El Gamal. For the N-node Gaussian multicast network, the scheme achieves within 0.5N bits from the capacity, improving upon the best known capacity gap results. The key idea is to use multicoding at the source as in Marton coding for broadcast channels. Instead of recovering a specific part of the message as in the original partial decode-forward scheme, a relay in the proposed distributed decode-forward scheme recovers an auxiliary index that implicitly carries some information about the message and forwards it in block Markov coding. This scheme can be adapted to broadcasting multiple messages over a general relay network, extending and refining a recent result by Kannan, Raja, and Viswanath.

[1]  Sreeram Kannan,et al.  Approximately Optimal Wireless Broadcasting , 2012, IEEE Transactions on Information Theory.

[2]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[3]  Abdel R. El Gamal,et al.  On information flow in relay networks , 1981 .

[4]  Panganamala Ramana Kumar,et al.  An achievable rate for the multiple-level relay channel , 2005, IEEE Transactions on Information Theory.

[5]  Panganamala Ramana Kumar,et al.  A Digital Interface for Gaussian Relay and Interference Networks: Lifting Codes From the Discrete Superposition Model , 2011, IEEE Transactions on Information Theory.

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

[7]  R. Gallager,et al.  The Gaussian parallel relay network , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[8]  Sae-Young Chung,et al.  Noisy Network Coding , 2010, IEEE Transactions on Information Theory.

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

[10]  Mohammad Reza Aref,et al.  Slepian–Wolf Coding Over Cooperative Relay Networks , 2011, IEEE Transactions on Information Theory.

[11]  Sae-Young Chung,et al.  Gaussian Relay Channel Capacity to Within a Fixed Number of Bits , 2010, ArXiv.

[12]  E. Meulen,et al.  Three-terminal communication channels , 1971, Advances in Applied Probability.

[13]  Gerhard Kramer,et al.  Short Message Noisy Network Coding With a Decode–Forward Option , 2013, IEEE Transactions on Information Theory.

[14]  Abbas El Gamal,et al.  Network Information Theory , 2021, 2021 IEEE 3rd International Conference on Advanced Trends in Information Theory (ATIT).

[15]  Sung Hoon Lim,et al.  Distributed decode-forward for broadcast , 2014, 2014 IEEE Information Theory Workshop (ITW 2014).

[16]  Gregory W. Wornell,et al.  Cooperative diversity in wireless networks: Efficient protocols and outage behavior , 2004, IEEE Transactions on Information Theory.

[17]  Thomas M. Cover,et al.  Network Information Theory , 2001 .

[18]  Michael Gastpar,et al.  Cooperative strategies and capacity theorems for relay networks , 2005, IEEE Transactions on Information Theory.

[19]  Mohammad Reza Aref,et al.  The capacity of the semideterministic relay channel , 1982, IEEE Trans. Inf. Theory.

[20]  Suhas N. Diggavi,et al.  Wireless Network Information Flow: A Deterministic Approach , 2009, IEEE Transactions on Information Theory.