Space-Time Block Codes Achieving Full Diversity With Linear Receivers

In most of the existing space-time code designs, achieving full diversity is based on maximum-likelihood (ML) decoding at the receiver that is usually computationally expensive and may not have soft outputs. Recently, Zhang-Liu-Wong introduced Toeplitz codes and showed that Toeplitz codes achieve full diversity when a linear receiver, zero-forcing (ZF) or minimum mean square error (MMSE) receiver, is used. Motivated from Zhang-Liu-Wong's results on Toeplitz codes, in this paper, we propose a design criterion for space-time block codes (STBC), in which information symbols and their complex conjugates are linearly embedded, to achieve full diversity when ZF or MMSE receiver is used. The (complex) orthogonal STBC (OSTBC) satisfy the criterion as one may expect. We also show that the symbol rates of STBC under this criterion are upper bounded by 1. Subsequently, we propose a novel family of STBC that satisfy the criterion and thus achieve full diversity with ZF or MMSE receiver. Our newly proposed STBC are constructed by overlapping the 2times2 Alamouti code and hence named overlapped Alamouti codes in this paper. The new codes are close to orthogonal and their symbol rates can approach 1 for any number of transmit antennas. Simulation results show that overlapped Alamouti codes significantly outperform Toeplitz codes for all numbers of transmit antennas and also outperform OSTBC when the number of transmit antennas is above 4.

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

[2]  Dirk T. M. Slock,et al.  Achieving the Optimal Diversity-Versus-Multiplexing Tradeoff for MIMO Flat Channels With QAM Space–Time Spreading and DFE Equalization , 2006, IEEE Transactions on Information Theory.

[3]  David Tse,et al.  Fundamentals of Wireless Communication , 2005 .

[4]  Stephan ten Brink,et al.  Achieving near-capacity on a multiple-antenna channel , 2003, IEEE Trans. Commun..

[5]  John M. Cioffi,et al.  Iterative soft interference cancellation for multiple antenna systems , 2000, 2000 IEEE Wireless Communications and Networking Conference. Conference Record (Cat. No.00TH8540).

[6]  Xiang-Gen Xia,et al.  On optimal quasi-orthogonal space-time block codes with minimum decoding complexity , 2005, ISIT.

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

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

[9]  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).

[10]  Petre Stoica,et al.  Space-Time block codes: A maximum SNR approach , 2001, 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]  Weifeng Su,et al.  On orthogonal space-time block codes and transceiver signal linearization , 2006, IEEE Communications Letters.

[13]  Jack H. Winters,et al.  Two signaling schemes for improving the error performance of frequency division duplex (FDD) transmission systems using transmitter antenna diversity , 1994, Int. J. Wirel. Inf. Networks.

[14]  Reinaldo A. Valenzuela,et al.  Detection algorithm and initial laboratory results using V-BLAST space-time communication architecture , 1999 .

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

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

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

[18]  P. Maher,et al.  Handbook of Matrices , 1999, The Mathematical Gazette.

[19]  M. Fiedler Bounds for the determinant of the sum of hermitian matrices , 1971 .

[20]  Xiang-Gen Xia,et al.  Iterative demodulation/decoding methods based on Gaussian approximations for lattice based space-time coded systems , 2006, IEEE Transactions on Wireless Communications.

[21]  Jian-Kang Zhang,et al.  Linear toeplitz space time block codes , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[22]  Giuseppe Caire,et al.  Lattice coding and decoding achieve the optimal diversity-multiplexing tradeoff of MIMO channels , 2004, IEEE Transactions on Information Theory.

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

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

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

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

[27]  Moe Z. Win,et al.  MMSE reception and successive interference cancellation for MIMO systems with high spectral efficiency , 2005, IEEE Transactions on Wireless Communications.

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

[29]  H. Vincent Poor,et al.  Probability of error in MMSE multiuser detection , 1997, IEEE Trans. Inf. Theory.

[30]  Michael P. Fitz,et al.  Signal design for transmitter diversity wireless communication systems over Rayleigh fading channels , 1999, IEEE Trans. Commun..

[31]  Li Ping,et al.  Interleave-division multiple access and chip-by-chip iterative multi-user detection , 2005, IEEE Commun. Mag..

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

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

[34]  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.

[35]  Reinaldo A. Valenzuela,et al.  Simplified processing for high spectral efficiency wireless communication employing multi-element arrays , 1999, IEEE J. Sel. Areas Commun..

[36]  Constantinos B. Papadias,et al.  Capacity-approaching space-time codes for systems employing four transmitter antennas , 2003, IEEE Trans. Inf. Theory.

[37]  Jack M. Holtzman,et al.  Analysis of a simple successive interference cancellation scheme in a DS/CDMA system , 1994, IEEE J. Sel. Areas Commun..

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

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

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

[41]  Mohamed-Slim Alouini,et al.  Digital Communication Over Fading Channels: A Unified Approach to Performance Analysis , 2000 .

[42]  J. Hagenauer Forward error correcting for CDMA systems , 1996, Proceedings of ISSSTA'95 International Symposium on Spread Spectrum Techniques and Applications.

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

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

[45]  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..

[46]  S. Haykin,et al.  Modern Wireless Communications , 1939, Nature.

[47]  H. Vincent Poor,et al.  Iterative (turbo) soft interference cancellation and decoding for coded CDMA , 1999, IEEE Trans. Commun..

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

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

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

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

[52]  Mohamed-Slim Alouini,et al.  A unified approach to the performance analysis of digital communication over generalized fading channels , 1998, Proc. IEEE.