Performance Bounds for Bidirectional Coded Cooperation Protocols

In coded bidirectional cooperation, two nodes wish to exchange messages over a shared half-duplex channel with the help of a relay. In this correspondence, we derive performance bounds for this problem for each of three decode-and-forward protocols. The first protocol is a two phase protocol where both users simultaneously transmit during the first phase and the relay alone transmits during the second. In this protocol, our bounds are tight. The second protocol considers sequential transmissions from the two users followed by a transmission from the relay while the third protocol is a hybrid of the first two protocols and has four phases. In the latter two protocols the bounds are not identical. Numerical evaluation shows that in some cases of interest our bounds do not differ significantly. Finally, in the Gaussian case with path loss, we derive achievable rates and compare the relative merits of each protocol. This case is of interest in cellular systems. Surprisingly, we find that in some cases, the achievable rate region of the four phase protocol contains points that are outside the outer bounds of the other two protocols.

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

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

[3]  A. Robert Calderbank,et al.  Space-Time Codes for High Data Rate Wireless Communications : Performance criterion and Code Construction , 1998, IEEE Trans. Inf. Theory.

[4]  J. Neukirch Algebraic Number Theory , 1999 .

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

[6]  Jean-Claude Belfiore,et al.  Quaternionic lattices for space-time coding , 2003, Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674).

[7]  Lizhong Zheng,et al.  Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels , 2003, IEEE Trans. Inf. Theory.

[8]  B. Sundar Rajan,et al.  Full-diversity, high-rate space-time block codes from division algebras , 2003, IEEE Trans. Inf. Theory.

[9]  Christopher Holden,et al.  Perfect Space-Time Block Codes , 2004 .

[10]  Yunnan Wu,et al.  Information Exchange in Wireless Networks with Network Coding and Physical-layer Broadcast , 2004 .

[11]  J. Belfiore,et al.  Optimal Space-Time Codes for the Amplify-and-Forward Cooperative Channel , 2005 .

[12]  P. Vijay Kumar,et al.  Perfect space-time codes with minimum and non-minimum delay for any number of antennas , 2005, 2005 International Conference on Wireless Networks, Communications and Mobile Computing.

[13]  P. Vijay Kumar,et al.  Explicit Space–Time Codes Achieving the Diversity–Multiplexing Gain Tradeoff , 2006, IEEE Transactions on Information Theory.

[14]  Hsiao-feng Lu Explicit Constructions of Multi-Block Space-Time Codes That Achieve The Diversity-Multiplexing Tradeoff , 2006, 2006 IEEE International Symposium on Information Theory.

[15]  Petar Popovski,et al.  The Anti-Packets Can Increase the Achievable Throughput of a Wireless Multi-Hop Network , 2006, 2006 IEEE International Conference on Communications.

[16]  Jean-Claude Belfiore,et al.  Perfect Space-Time Block Codes for parallel MIMO channels , 2006, 2006 IEEE International Symposium on Information Theory.

[17]  Petar Popovski,et al.  Bi-directional Amplification of Throughput in a Wireless Multi-Hop Network , 2006, 2006 IEEE 63rd Vehicular Technology Conference.

[18]  Niklas Johansson,et al.  Coded Bi-directional Relaying , 2006, 2006 IEEE 63rd Vehicular Technology Conference.

[19]  Armin Wittneben,et al.  Achievable Rate Regions for the Two-way Relay Channel , 2006, 2006 IEEE International Symposium on Information Theory.

[20]  B. Sundar Rajan,et al.  Information-Lossless Space–Time Block Codes From Crossed-Product Algebras , 2006, IEEE Transactions on Information Theory.

[21]  Tobias J. Oechtering,et al.  Achievable Rate Region of a Two Phase Bidirectional Relay Channel , 2007, 2007 41st Annual Conference on Information Sciences and Systems.

[22]  Frédérique E. Oggier,et al.  Cyclic Division Algebras: A Tool for Space-Time Coding , 2007, Found. Trends Commun. Inf. Theory.

[23]  Camilla Hollanti,et al.  Normalized Minimum Determinant Calculation for Multi-block and Asymmetric Space-Time Codes , 2007, AAECC.

[24]  Frédérique E. Oggier,et al.  Space-Time Codes from Crossed Product Algebras of Degree 4 , 2007, AAECC.

[25]  Liang-Liang Xie Network Coding and Random Binning for Multi-User Channels , 2007, 2007 10th Canadian Workshop on Information Theory (CWIT).

[26]  27th International Conference on Distributed Computing Systems Workshops (ICDCS 2007 Workshops), June 25-29, 2007, Toronto, Ontario, Canada , 2007, ICDCS Workshops.

[27]  Hsiao-feng Lu Optimal Code Constructions for SIMO-OFDM Frequency Selective Fading Channels , 2007, 2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks.

[28]  Camilla Hollanti,et al.  On the Densest MIMO Lattices From Cyclic Division Algebras , 2007, IEEE Transactions on Information Theory.

[29]  Frédérique E. Oggier,et al.  On the Existence of Perfect Space–Time Codes , 2009, IEEE Transactions on Information Theory.