High-Rate, Single-Symbol ML Decodable Precoded DSTBCs for Cooperative Networks

Distributed orthogonal space-time block codes (DOSTBCs) achieving full-diversity order and single-symbol maximum-likelihood (ML) decodability have been introduced recently by Yi and Kim for cooperative networks, and an upper bound on the maximal rate of such codes along with code constructions has been presented. In this paper, a new class of single-symbol ML decodable precoded distributed space-time block codes (SSD-PDSTBCs) called semiorthogonal SSD-PDSTBCs (semi-SSD-PDSTBCs) is introduced wherein, the source performs linear precoding of information symbols appropriately before transmitting it to all the relays. It is shown that DOSTBCs are a special case of semi-SSD-PDSTBCs. A special class of semi-SSD-PDSTBCs having diagonal covariance matrix at the destination is studied and an upper bound on the maximal rate of such codes is derived. The bounds obtained are approximately twice larger than that of the DOSTBCs. A systematic construction of semi-SSD-PDSTBCs is presented when the number of relays K ges 4. The constructed codes are shown to achieve the upper bound on the rate when K is of the form 0 or 3 modulo 4 . For the rest of the values of K, the constructed codes are shown to have rates higher than that of DOSTBCs. It is shown that semi-SSD-PDSTBCs cannot be constructed with any form of linear processing at the relays when the source does not perform linear precoding of the information symbols.

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

[2]  Il-Min Kim,et al.  The Impact of Noise Correlation and Channel Phase Information on the Data-Rate of the Single-Symbol ML Decodable Distributed STBCs , 2007, ArXiv.

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

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

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

[6]  Dong Wang,et al.  On Optimal Quasi-Orthogonal Space–Time Block Codes With Minimum Decoding Complexity , 2005, IEEE Transactions on Information Theory.

[7]  B. Sundar Rajan,et al.  Minimum-Decoding-Complexity, Maximum-rate Space-Time Block Codes from Clifford Algebras , 2006, 2006 IEEE International Symposium on Information Theory.

[8]  B. Sundar Rajan,et al.  Distributed Space-Time Codes with Reduced Decoding Complexity , 2006, 2006 IEEE International Symposium on Information Theory.

[9]  B. Sundar Rajan,et al.  A Non-orthogonal Distributed Space-Time Coded Protocol Part II: Code Construction and DM-G Tradeoff , 2006, 2006 IEEE Information Theory Workshop - ITW '06 Chengdu.

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

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

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

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

[14]  B. Sundar Rajan,et al.  Distributed Space-Time Codes for Cooperative Networks with Partial CSI , 2007, 2007 IEEE Wireless Communications and Networking Conference.

[15]  B. Sundar Rajan,et al.  On Four-Group ML Decodable Distributed Space Time Codes for Cooperative Communication , 2007, 2007 IEEE Wireless Communications and Networking Conference.

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

[17]  B. Sundar Rajan,et al.  Single-Symbol ML Decodable Precoded DSTBCs for Cooperative Networks , 2008, 2008 IEEE International Conference on Communications.

[18]  B. Sundar Rajan,et al.  Multigroup Decodable STBCs From Clifford Algebras , 2009, IEEE Transactions on Information Theory.

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

[20]  Il-Min Kim,et al.  Single-Symbol ML Decodable Distributed STBCs for Cooperative Networks , 2006, IEEE Transactions on Information Theory.

[21]  Ari Hottinen,et al.  Square-matrix embeddable space-time block codes for complex signal constellations , 2002, IEEE Trans. Inf. Theory.

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

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