On the achievable rates of the diamond relay channel with conferencing links

We consider a half-duplex diamond relay channel, which consists of one source-destination pair and two relay nodes connected with two-way rate-limited out-of-band conferencing links. Three basic schemes and their achievable rates are studied: For the decode-and-forward (DF) scheme, we obtain the achievable rate by letting the source send a common message and two private messages; for the compress-and-forward (CF) scheme, we exploit the conferencing links to help with the compression of the received signals; for the amplify-and-forward (AF) scheme, we study the optimal combining strategy between the received signals from the source and the conferencing link. Moreover, we show that these schemes asymptotically achieve the capacity upper bound under certain conditions. Finally, we evaluate the various rates for the Gaussian case with simulations and numerical results.

[1]  Feng Xue,et al.  Cooperation in a Half-Duplex Gaussian Diamond Relay Channel , 2007, IEEE Transactions on Information Theory.

[2]  Amir K. Khandani,et al.  Relay Scheduling in the Half-Duplex Gaussian Parallel Relay Channel , 2010, IEEE Transactions on Information Theory.

[3]  D. Slepian,et al.  A coding theorem for multiple access channels with correlated sources , 1973 .

[4]  Shlomo Shamai,et al.  Communication Via Decentralized Processing , 2005, IEEE Transactions on Information Theory.

[5]  Roy D. Yates,et al.  Capacity of Interference Channels With Partial Transmitter Cooperation , 2007, IEEE Transactions on Information Theory.

[6]  Sennur Ulukus,et al.  Diamond channel with partially separated relays , 2010, 2010 IEEE International Symposium on Information Theory.

[7]  Shuguang Cui,et al.  On the achievable rates of the diamond relay channel with conferencing links , 2010 .

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

[9]  Zhi-Quan Luo,et al.  Distributed Beamforming for Relay Networks Based on Second-Order Statistics of the Channel State Information , 2008, IEEE Transactions on Signal Processing.

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

[11]  Erik G. Larsson,et al.  Complete Characterization of the Pareto Boundary for the MISO Interference Channel , 2008, IEEE Transactions on Signal Processing.

[12]  Ron Dabora,et al.  Broadcast Channels With Cooperating Decoders , 2006, IEEE Transactions on Information Theory.

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

[14]  Ron Dabora,et al.  A Multi-Step Conference for Cooperative Broadcast , 2006, 2006 IEEE International Symposium on Information Theory.

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

[16]  Sae-Young Chung,et al.  Capacity Bounds for Alternating Two-Path Relay Channels , 2007 .

[17]  Nikos D. Sidiropoulos,et al.  Transmit beamforming for physical-layer multicasting , 2006, IEEE Transactions on Signal Processing.

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

[19]  Abbas El Gamal,et al.  Lecture Notes on Network Information Theory , 2010, ArXiv.

[20]  Anders Høst-Madsen,et al.  Capacity bounds and power allocation for wireless relay channels , 2005, IEEE Transactions on Information Theory.

[21]  Wei Kang,et al.  Capacity of a Class of Diamond Channels , 2008, IEEE Transactions on Information Theory.

[22]  Shlomo Shamai,et al.  Compound Multiple-Access Channels With Partial Cooperation , 2008, IEEE Transactions on Information Theory.

[23]  Frans M. J. Willems,et al.  The discrete memoryless multiple access channel with partially cooperating encoders , 1983, IEEE Trans. Inf. Theory.