On Space-Time Code Design With a Conditional PIC Group Decoding

Space-time code designs based on a partial interference cancellation (PIC) group decoding have been recently proposed. The PIC group decoding complexity depends on the group size and is between the lowest linear receiver complexity and the highest ML decoding complexity. The symbol rate for a space-time code achieving full diversity with the PIC group decoding is also between those for the linear receivers and the ML decoding. In this paper, we propose a new decoding, called conditional PIC group decoding, that is between the PIC group decoding and the ML decoding. With the proposed new decoding, we obtain a new design criterion for space-time codes to achieve full diversity, which is also between the one with the PIC group decoding and the one with the ML decoding. We then present some designs that satisfy the new criterion and in the meantime have higher symbol rates than that for the PIC group decoding.

[1]  Emanuele Viterbo,et al.  A universal lattice code decoder for fading channels , 1999, IEEE Trans. Inf. Theory.

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

[3]  M. O. Damen,et al.  Generalised sphere decoder for asymmetrical space-time communication architecture , 2000 .

[4]  Xiang-Gen Xia,et al.  Closed form designs of complex orthogonal space-time block codes of rates (k+1)/(2k) for 2k_1 or 2k transmit antennas , 2005, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[5]  Hamid Jafarkhani.  A quasi-orthogonal space-time block code , 2001, IEEE Trans. Commun..

[6]  Robert W. Heath,et al.  Linear dispersion codes for MIMO systems based on frame theory , 2002, IEEE Trans. Signal Process..

[7]  Xiang-Gen Xia,et al.  On full diversity space-time block codes with partial interference cancellation group decoding , 2009, IEEE Trans. Inf. Theory.

[8]  Babak Hassibi,et al.  On the sphere-decoding algorithm II. Generalizations, second-order statistics, and applications to communications , 2005, IEEE Transactions on Signal Processing.

[9]  Frédérique E. Oggier,et al.  Perfect Space–Time Block Codes , 2006, IEEE Transactions on Information Theory.

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

[11]  A. Robert Calderbank,et al.  Fast Optimal Decoding of Multiplexed Orthogonal Designs by Conditional Optimization , 2010, IEEE Transactions on Information Theory.

[12]  Wei Zhang,et al.  A simple design of space-time block codes achieving full diversity with linear receivers , 2009, 2009 IEEE International Conference on Acoustics, Speech and Signal Processing.

[13]  A. Robert Calderbank,et al.  Highly parallel decoding of space-time codes on graphics processing units , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

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

[15]  P. Vijay Kumar,et al.  Perfect Space–Time Codes for Any Number of Antennas , 2007, IEEE Transactions on Information Theory.

[16]  B. Sundar Rajan,et al.  STBC-schemes with nonvanishing determinant for certain number of transmit antennas , 2005, IEEE Transactions on Information Theory.

[17]  Chau Yuen,et al.  On the Decoding and Optimizing Performance of Four-Group Decodable Space-Time Block Codes , 2006, 2006 First International Conference on Communications and Electronics.

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

[19]  X. Xia,et al.  Closed Form Designs of Complex Orthogonal Space-Time Block Codes of Rates for or Transmit Antennas , 2004 .

[20]  Babak Hassibi,et al.  On the sphere-decoding algorithm I. Expected complexity , 2005, IEEE Transactions on Signal Processing.

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

[22]  Jing Liu,et al.  On the Design of Minimum BER Linear Space-Time Block Codes for MIMO Systems Equipped With MMSE Receivers , 2006, IEEE Transactions on Signal Processing.

[23]  Jing Liu,et al.  Full-Diversity Codes for MISO Systems Equipped With Linear or ML Detectors , 2008, IEEE Transactions on Information Theory.

[24]  Bin Li,et al.  Space–Time Block Codes Achieving Full Diversity With Linear Receivers , 2008, IEEE Transactions on Information Theory.

[25]  Xiang-Gen Xia,et al.  A Systematic Design of Space-Time Block Codes Achieving Full-Diversity with Partial Interference Cancellation Group Decoding , 2009, GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference.

[26]  Mohamed Oussama Damen,et al.  Lattice code decoder for space-time codes , 2000, IEEE Communications Letters.

[27]  Xiang-Gen Xia,et al.  On Full Diversity Space–Time Block Codes With Partial Interference Cancellation Group Decoding , 2009, IEEE Transactions on Information Theory.

[28]  Chau Yuen,et al.  Quasi-orthogonal STBC with minimum decoding complexity , 2005, IEEE Transactions on Wireless Communications.

[29]  Jocelyn Fiorina,et al.  A rate-3/2 full-diversity 4×4 space-time code with fast Maximum-Likelihood Decoding , 2009, 2009 IEEE 20th International Symposium on Personal, Indoor and Mobile Radio Communications.

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

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

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

[33]  Petre Stoica,et al.  Space-Time block codes: A maximum SNR approach , 2001, IEEE Trans. Inf. Theory.

[34]  Ari Hottinen,et al.  Minimal non-orthogonality rate 1 space-time block code for 3+ Tx antennas , 2000, 2000 IEEE Sixth International Symposium on Spread Spectrum Techniques and Applications. ISSTA 2000. Proceedings (Cat. No.00TH8536).

[35]  Serdar Sezginer,et al.  Full-rate full-diversity 2 x 2 space-time codes of reduced decoder complexity , 2007, IEEE Communications Letters.

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

[37]  Wai Ho Mow,et al.  Universal lattice decoding: principle and recent advances , 2003, Wirel. Commun. Mob. Comput..

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

[39]  E. Biglieri,et al.  A universal decoding algorithm for lattice codes , 1993 .

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

[41]  Xiang-Gen Xia,et al.  Space-Time Block Codes Achieving Full Diversity With Linear Receivers , 2008, IEEE Trans. Inf. Theory.

[42]  Constantinos B. Papadias,et al.  Improved quasi-orthogonal codes through constellation rotation , 2003, IEEE Trans. Commun..