Nested cooperative encoding protocol for wireless networks with high energy efficiency

Recently, distributed space-time code designs with high cooperative diversity for wireless communication networks, such as ad hoc and sensor networks, have received much attention. Amplify forward and decoding forward are the widely used protocols for the cooperative diversity in the wireless communication networks. In both protocols, the information received by relay terminals are "forwarded" to destination or next relay terminals. Since signals sent at relay terminals and ones sent at the source terminal are correlated, there is information redundancy. To improve the energy efficiency of cooperative networks, we propose an encoding protocol, which is referred to as a nested cooperative encoding protocol. In our proposed protocol, the received signal at each relay terminal is divided into several sub-signals with the nest lattice structure of source information. Each of the sub-signals contains only a partial information with a smaller size of constellation compared to the original information sent by the source terminal. We show that our new protocols can achieve both high cooperative diversity and high energy efficiency.

[1]  Norman C. Beaulieu,et al.  On two high-rate algebraic space-time codes , 2003, IEEE Trans. Inf. Theory.

[2]  Jack K. Wolf,et al.  Noiseless coding of correlated information sources , 1973, IEEE Trans. Inf. Theory.

[3]  Emanuele Viterbo,et al.  The golden code: a 2 x 2 full-rate space-time code with non-vanishing determinants , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[4]  Ram Zamir,et al.  The rate loss in the Wyner-Ziv problem , 1996, IEEE Trans. Inf. Theory.

[5]  Xiang-Gen Xia,et al.  Systematic and optimal cyclotomic lattices and diagonal space-time block code designs , 2004, IEEE Transactions on Information Theory.

[6]  Sandra Galliou,et al.  A new family of full rate, fully diverse space-time codes based on Galois theory , 2002, Proceedings IEEE International Symposium on Information Theory,.

[7]  Gregory W. Wornell,et al.  Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks , 2003, IEEE Trans. Inf. Theory.

[8]  Shlomo Shamai,et al.  Nested linear/Lattice codes for structured multiterminal binning , 2002, IEEE Trans. Inf. Theory.

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

[10]  Emanuele Viterbo,et al.  The golden code: a 2×2 full-rate space-time code with nonvanishing determinants , 2004, IEEE Trans. Inf. Theory.

[11]  Siavash M. Alamouti,et al.  A simple transmit diversity technique for wireless communications , 1998, IEEE J. Sel. Areas Commun..

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

[13]  Georgios B. Giannakis,et al.  Full-diversity full-rate complex-field space-time coding , 2003, IEEE Trans. Signal Process..

[14]  Mohamed Oussama Damen,et al.  A construction of a space-time code based on number theory , 2002, IEEE Trans. Inf. Theory.

[15]  Babak Hassibi,et al.  High-rate codes that are linear in space and time , 2002, IEEE Trans. Inf. Theory.

[16]  A. Robert Calderbank,et al.  Space-Time block codes from orthogonal designs , 1999, IEEE Trans. Inf. Theory.

[17]  Genyuan Wang,et al.  On optimal multilayer cyclotomic space-time code designs , 2005, IEEE Transactions on Information Theory.

[18]  Elza Erkip,et al.  User cooperation diversity. Part I. System description , 2003, IEEE Trans. Commun..

[19]  Thomas L. Marzetta,et al.  Multiple-antennas and isotropically random unitary inputs: The received signal density in closed form , 2002, IEEE Trans. Inf. Theory.

[20]  Karim Abed-Meraim,et al.  Diagonal algebraic space-time block codes , 2002, IEEE Trans. Inf. Theory.

[21]  Mohamed Oussama Damen,et al.  Universal space-time coding , 2003, IEEE Trans. Inf. Theory.