Short-message quantize-forward network coding

Recent work for single-relay channels shows that quantize-forward (QF) with long-message encoding achieves the same reliable rates as compress-forward (CF) with short-message encoding. It is shown that short-message QF with backward or pipelined (sliding-window) decoding also achieves the same rates. Similarly, for many relays and sources, short-message QF with backward decoding achieves the same rates as long-message QF. Several practical advantages of short-message encoding are pointed out, e.g., reduced delay and simpler modulation. Furthermore, short-message encoding lets relays use decode-forward (DF) if their channel quality is good, thereby enabling multi-input, multi-output (MIMO) gains that are not possible with long-message encoding. Finally, one may combine the advantages of long- and short-message encoding by hashing a long message to short messages.

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

[2]  Young-Han Kim,et al.  Capacity of a Class of Deterministic Relay Channels , 2006, 2007 IEEE International Symposium on Information Theory.

[3]  Panganamala Ramana Kumar,et al.  A network information theory for wireless communication: scaling laws and optimal operation , 2004, IEEE Transactions on Information Theory.

[4]  Michael Gastpar,et al.  The multiple-relay channel: coding and antenna-clustering capacity , 2002, Proceedings IEEE International Symposium on Information Theory,.

[5]  Xiugang Wu,et al.  On the Optimal Compressions in the Compress-and-Forward Relay Schemes , 2010, IEEE Transactions on Information Theory.

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

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

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

[9]  Xiugang Wu,et al.  On the optimality of successive decoding in compress-and-forward relay schemes , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[10]  Aydano B. Carleial,et al.  Multiple-access channels with different generalized feedback signals , 1982, IEEE Trans. Inf. Theory.

[11]  Ayfer Özgür,et al.  Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks , 2006, IEEE Transactions on Information Theory.

[12]  Gerhard Kramer Pipelined encoding for deterministic and noisy relay networks , 2009, 2009 Workshop on Network Coding, Theory, and Applications.

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

[14]  Mikael Skoglund,et al.  Quantifying the Loss of Compress–Forward Relaying Without Wyner–Ziv Coding , 2009, IEEE Transactions on Information Theory.

[15]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .