Single-Symbol ML Decodable Distributed STBCs for Cooperative Networks

In this correspondence, the distributed orthogonal space-time block codes (DOSTBCs), which achieve the single-symbol maximum likelihood (ML) decodability and full diversity order, are first considered. However, systematic construction of the DOSTBCs is very hard, since the noise covariance matrix is not diagonal in general. Thus, some special DOSTBCs, which have diagonal noise covariance matrices at the destination terminal, are investigated. These codes are referred to as the row-monomial DOSTBCs. An upper bound of the data-rate of the row-monomial DOSTBC is derived and it is approximately twice higher than that of the repetition-based cooperative strategy. Furthermore, systematic construction methods of the row-monomial DOSTBCs achieving the upper bound of the data-rate are developed when the number of relays and/or the number of information-bearing symbols are even.

[1]  Yindi Jing,et al.  Using Orthogonal and Quasi-Orthogonal Designs in Wireless Relay Networks , 2007, IEEE Transactions on Information Theory.

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

[3]  Hong Shen,et al.  A counterexample for the open problem on the minimal delays of orthogonal designs with maximal rates , 2005, IEEE Transactions on Information Theory.

[4]  Elisa Bertino,et al.  Association rule hiding , 2004, IEEE Transactions on Knowledge and Data Engineering.

[5]  Xiang-Gen Xia,et al.  A Family of Distributed Space-Time Trellis Codes With Asynchronous Cooperative Diversity , 2005, IEEE Transactions on Communications.

[6]  Xue-Bin Liang,et al.  Orthogonal designs with maximal rates , 2003, IEEE Trans. Inf. Theory.

[7]  Lutz H.-J. Lampe,et al.  Distributed space-time block coding , 2006, IEEE Transactions on Communications.

[8]  Joydeep Ghosh,et al.  Privacy-preserving distributed clustering using generative models , 2003, Third IEEE International Conference on Data Mining.

[9]  Yan Mei,et al.  Wireless antennas - making wireless communications perform like wireline communications , 2003, 2003 IEEE Topical Conference on Wireless Communication Technology.

[10]  Poorvi L. Vora,et al.  The channel coding theorem and the security of binary randomization , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[11]  Xiang-Gen Xia,et al.  A systematic design of high-rate complex orthogonal space-time block codes , 2004, IEEE Communications Letters.

[12]  Elza Erkip,et al.  User cooperation diversity. Part II. Implementation aspects and performance analysis , 2003, IEEE Trans. Commun..

[13]  Elisa Bertino,et al.  State-of-the-art in privacy preserving data mining , 2004, SGMD.

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

[15]  B. Sundar Rajan,et al.  Single-symbol maximum likelihood decodable linear STBCs , 2006, IEEE Transactions on Information Theory.

[16]  Xiang-Gen Xia,et al.  On the nonexistence of rate-one generalized complex orthogonal designs , 2003, IEEE Trans. Inf. Theory.

[17]  Mazen O. Hasna,et al.  Harmonic mean and end-to-end performance of transmission systems with relays , 2004, IEEE Transactions on Communications.

[18]  Helmut Bölcskei,et al.  Fading relay channels: performance limits and space-time signal design , 2004, IEEE Journal on Selected Areas in Communications.

[19]  Jayant R. Haritsa,et al.  Maintaining Data Privacy in Association Rule Mining , 2002, VLDB.

[20]  Alejandro Ribeiro,et al.  Symbol error probabilities for general cooperative links , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[21]  Mostafa Kaveh,et al.  Exact symbol error probability of a Cooperative network in a Rayleigh-fading environment , 2004, IEEE Transactions on Wireless Communications.

[22]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

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

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

[25]  Poorvi L. Vora.  Information Theory and the Security of Binary Data Perturbation , 2004, INDOCRYPT.

[26]  Yindi Jing,et al.  Distributed Space-Time Coding in Wireless Relay Networks , 2006, IEEE Transactions on Wireless Communications.

[27]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[28]  Yindi Jing,et al.  CTH17-1: Using Orthogonal and Quasi-Orthogonal Designs in Wireless Relay Networks , 2006, IEEE Globecom 2006.

[29]  Xiang-Gen Xia,et al.  On Space-Time Block Codes from Complex Orthogonal Designs , 2003, Wirel. Pers. Commun..

[30]  Jean-Claude Belfiore,et al.  Optimal Space–Time Codes for the MIMO Amplify-and-Forward Cooperative Channel , 2005, IEEE Transactions on Information Theory.

[31]  Nabil R. Adam,et al.  Security-control methods for statistical databases: a comparative study , 1989, ACM Comput. Surv..

[32]  Xiang-Gen Xia,et al.  Upper bounds of rates of complex orthogonal space-time block code , 2003, IEEE Trans. Inf. Theory.

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

[34]  Xiang-Gen Xia,et al.  Two generalized complex orthogonal space-time block codes of rates 7/11 and 3/5 for 5 and 6 transmit antennas , 2003, IEEE Trans. Inf. Theory.

[35]  J. Nicholas Laneman,et al.  Modulation and demodulation for cooperative diversity in wireless systems , 2006, IEEE Transactions on Wireless Communications.

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

[37]  P. Vijay Kumar,et al.  Approximately universal optimality over several dynamic and non-dynamic cooperative diversity schemes for wireless networks , 2005, ArXiv.

[38]  Hesham El Gamal,et al.  Distributed space-time filtering for cooperative wireless networks , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[39]  Rathindra Sarathy,et al.  Security of random data perturbation methods , 1999, TODS.

[40]  Gregory W. Wornell,et al.  Energy-efficient antenna sharing and relaying for wireless networks , 2000, 2000 IEEE Wireless Communications and Networking Conference. Conference Record (Cat. No.00TH8540).

[41]  Mazen O. Hasna,et al.  End-to-end performance of transmission systems with relays over Rayleigh-fading channels , 2003, IEEE Trans. Wirel. Commun..