Full-Diversity Space-Time Block Codes for Integer-Forcing Linear Receivers

In multiple-input multiple-output (MIMO) fading channels, the design criterion for full-diversity space-time block codes (STBCs) is primarily determined by the decoding method at the receiver. Although constructions of STBCs have predominantly matched the maximum-likelihood (ML) decoder, design criteria and constructions of full-diversity STBCs have also been reported for low-complexity linear receivers. A new receiver architecture called Integer-Forcing (IF) linear receiver has been proposed to MIMO channels by Zhan et al. which showed promising results for the high-rate V-BLAST encoding scheme. In this paper, we address the design of full-diversity STBCs for IF linear receivers. In particular, we are interested in characterizing the structure of STBCs that provide full-diversity with the IF receiver. Along that direction, we derive an upper bound on the probability of decoding error, and show that STBCs that satisfy the restricted non-vanishing singular value (RNVS) property provide full-diversity for the IF receiver. Furthermore, we prove that all known STBCs with the non-vanishing determinant property provide full-diversity with IF receivers, as they guarantee the RNVS property. By using the formulation of RNVS property, we also prove the existence of a full-diversity STBC outside the class of perfect STBCs, thereby adding significant insights compared to the existing works on STBCs with IF decoding. Finally, we present extensive simulation results to demonstrate that linear designs with RNVS property provide full-diversity for IF receiver.

[1]  Candice King,et al.  Fundamentals of wireless communications , 2013, 2013 IEEE Rural Electric Power Conference (REPC).

[2]  B. S. Rajan,et al.  An Adaptive Conditional Zero-Forcing decoder with full-diversity, least complexity and essentially-ML performance for STBCs , 2012, 2012 International Symposium on Information Theory and its Applications.

[3]  Uri Erez,et al.  Successive integer-forcing and its sum-rate optimality , 2013, 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton).

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

[5]  Frédérique Oggier,et al.  ar X iv : c s . IT / 0 60 40 93 v 1 2 4 A pr 2 00 6 Perfect Space Time Block Codes , 2006 .

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

[7]  Uri Erez,et al.  Performance of precoded integer-forcing for closed-loop MIMO multicast , 2014, 2014 IEEE Information Theory Workshop (ITW 2014).

[8]  B. Sundar Rajan,et al.  Information-Lossless Space–Time Block Codes From Crossed-Product Algebras , 2006, IEEE Transactions on Information Theory.

[9]  Uri Erez,et al.  Precoded Integer-Forcing Universally Achieves the MIMO Capacity to Within a Constant Gap , 2015, IEEE Trans. Inf. Theory.

[10]  B. Sundar Rajan,et al.  Full-diversity, high-rate space-time block codes from division algebras , 2003, IEEE Trans. Inf. Theory.

[11]  Aria Nosratinia,et al.  Diversity of MMSE MIMO Receivers , 2010, IEEE Transactions on Information Theory.

[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]  Emanuele Viterbo,et al.  The golden code: a 2×2 full-rate space-time code with nonvanishing determinants , 2004, IEEE Trans. Inf. Theory.

[14]  Wen Chen,et al.  Integer-forcing linear receiver design over MIMO channels , 2012, 2012 IEEE Global Communications Conference (GLOBECOM).

[15]  C. Khatri Distribution of the Largest or the Smallest Characteristic Root Under Null Hypothesis Concerning Complex Multivariate Normal Populations , 1964 .

[16]  Tianyi Xu,et al.  Two Designs of Space-Time Block Codes Achieving Full Diversity With Partial Interference Cancellation Group Decoding , 2012, IEEE Transactions on Information Theory.

[17]  Moe Z. Win,et al.  On the marginal distribution of the eigenvalues of wishart matrices , 2009, IEEE Transactions on Communications.

[18]  Christopher Holden,et al.  Perfect Space-Time Block Codes , 2004 .

[19]  Emanuele Viterbo,et al.  On complex LLL algorithm for integer forcing linear receivers , 2013, 2013 Australian Communications Theory Workshop (AusCTW).

[20]  B. Sundar Rajan,et al.  Collocated and Distributed STBCs with Partial Interference Cancellation Decoding, Part II: Code Construction , 2011, IEEE Transactions on Wireless Communications.

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

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

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

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

[25]  Emanuele Viterbo,et al.  Integer-Forcing MIMO Linear Receivers Based on Lattice Reduction , 2012, IEEE Transactions on Wireless Communications.

[26]  B. Sundar Rajan,et al.  Collocated and Distributed STBCs with Partial Interference Cancellation Decoding, Part I: Full-Diversity Criterion , 2011, IEEE Transactions on Wireless Communications.

[27]  Michael Gastpar,et al.  Integer-forcing linear receivers , 2010, 2010 IEEE International Symposium on Information Theory.

[28]  Michael Gastpar,et al.  Integer-Forcing Linear Receivers: A New Low-Complexity MIMO Architecture , 2010, 2010 IEEE 72nd Vehicular Technology Conference - Fall.

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

[30]  B. Sundar Rajan,et al.  MMSE optimal algebraic space-time codes , 2007, IEEE Transactions on Wireless Communications.

[31]  Limin Zou,et al.  A lower bound for the smallest singular value , 2012 .

[32]  Yoopyo Hong,et al.  A lower bound for the smallest singular value , 1992 .

[33]  L. Hogben Handbook of Linear Algebra , 2006 .

[34]  Sergio Barbarossa,et al.  Iterative MMSE Decoder for Trace-Orthogonal Space-Time Coding , 2006, 2006 IEEE International Conference on Acoustics Speech and Signal Processing Proceedings.

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

[36]  Gilles Burel,et al.  Statistical Analysis of the Smallest Singular Value in MIMO Transmission Systems , 2002 .

[37]  Emanuele Viterbo,et al.  Integer-Forcing Linear Receivers Based on Lattice Reduction Algorithms , 2012, ArXiv.