Advanced factorization strategies for lattice-reduction-aided preequalization

Lattice-reduction-aided preequalization (LRA PE) is a powerful technique for interference handling on the multi-user multiple-input/multiple-output (MIMO) broadcast channel. However, recent advantages in the strongly related field of compute-and-forward and integer-forcing equalization have raised the question, if the factorization task present in LRA PE is really solved in an optimum way. In this paper, advanced factorization strategies are presented, significantly increasing the transmission performance. Specifically, the signal constellation and its related lattice as well as the factorization task/strategy are discussed. The impact of dropping the common unimodularity constraint in LRA PE is studied. Numerical simulations are given to show the effectiveness of all presented strategies.

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

[2]  Kimmo Kansanen,et al.  Exact SMP Algorithms for Integer-Forcing Linear MIMO Receivers , 2015, IEEE Transactions on Wireless Communications.

[3]  Robert F. H. Fischer,et al.  Precoding and Signal Shaping for Digital Transmission , 2002 .

[4]  Wolfgang Utschick,et al.  Minimum Mean Square Error Vector Precoding , 2005, 2005 IEEE 16th International Symposium on Personal, Indoor and Mobile Radio Communications.

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

[6]  Robert F. H. Fischer,et al.  Lattice-reduction-aided preequalization over algebraic signal constellations , 2015, 2015 9th International Conference on Signal Processing and Communication Systems (ICSPCS).

[7]  Robert F. H. Fischer,et al.  Lattice-reduction-aided Tomlinson–Harashima precoding for point-to-multipoint transmission , 2006 .

[8]  Shlomo Shamai,et al.  Uplink-downlink duality for integer-forcing , 2014, 2014 IEEE International Symposium on Information Theory.

[9]  W. Fischer,et al.  Sphere Packings, Lattices and Groups , 1990 .

[10]  Qifu Tyler Sun,et al.  Lattice Network Codes Based on Eisenstein Integers , 2012, IEEE Transactions on Communications.

[11]  Wai Ho Mow,et al.  Complex Lattice Reduction Algorithm for Low-Complexity Full-Diversity MIMO Detection , 2009, IEEE Transactions on Signal Processing.

[12]  Amir K. Khandani,et al.  LLL Reduction Achieves the Receive Diversity in MIMO Decoding , 2006, IEEE Transactions on Information Theory.

[13]  Robert F. H. Fischer,et al.  Factorization Approaches in Lattice-Reduction-Aided and Integer-Forcing Equalization , 2016 .

[14]  Huguette Napias,et al.  A generalization of the LLL-algorithm over euclidean rings or orders , 1996 .

[15]  Gregory W. Wornell,et al.  Lattice-reduction-aided detectors for MIMO communication systems , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[16]  Giuseppe Caire,et al.  Compute-and-Forward Strategies for Cooperative Distributed Antenna Systems , 2012, IEEE Transactions on Information Theory.

[17]  Yu-Chih Huang,et al.  Lattices Over Eisenstein Integers for Compute-and-Forward , 2014, IEEE Transactions on Information Theory.

[18]  Robert F. H. Fischer,et al.  Complexity-performance trade-off of algorithms for combined lattice reduction and QR decomposition , 2012 .

[19]  David Tse,et al.  Sum capacity of the vector Gaussian broadcast channel and uplink-downlink duality , 2003, IEEE Trans. Inf. Theory.

[20]  Robert F. H. Fischer,et al.  Lattice-reduction-aided broadcast precoding , 2004, IEEE Transactions on Communications.