Integer-Forcing Linear Receivers

Linear receivers are often used to reduce the implementation complexity of multiple-antenna systems. In a traditional linear receiver architecture, the receive antennas are used to separate out the codewords sent by each transmit antenna, which can then be decoded individually. Although easy to implement, this approach can be highly suboptimal when the channel matrix is near singular. This paper develops a new linear receiver architecture that uses the receive antennas to create an effective channel matrix with integer-valued entries. Rather than attempting to recover transmitted codewords directly, the decoder recovers integer combinations of the codewords according to the entries of the effective channel matrix. The codewords are all generated using the same linear code, which guarantees that these integer combinations are themselves codewords. Provided that the effective channel is full rank, these integer combinations can then be digitally solved for the original codewords. This paper focuses on the special case where there is no coding across transmit antennas and no channel state information at the transmitter(s), which corresponds either to a multiuser uplink scenario or to single-user V-BLAST encoding. In this setting, the proposed integer-forcing linear receiver significantly outperforms conventional linear architectures such as the zero forcing and linear minimum mean-squared error receiver. In the high signal-to-noise ratio regime, the proposed receiver attains the optimal diversity-multiplexing tradeoff for the standard multiple-input multiple-output (MIMO) channel with no coding across transmit antennas. It is further shown that in an extended MIMO model with interference, the integer-forcing linear receiver achieves the optimal generalized degrees of freedom.

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

[2]  Shlomo Shamai,et al.  Distributed MIMO Receiver—Achievable Rates and Upper Bounds , 2007, IEEE Transactions on Information Theory.

[3]  Björn E. Ottersten,et al.  On the complexity of sphere decoding in digital communications , 2005, IEEE Transactions on Signal Processing.

[4]  Yi Jiang,et al.  Performance Analysis of ZF and MMSE Equalizers for MIMO Systems: An In-Depth Study of the High SNR Regime , 2011, IEEE Transactions on Information Theory.

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

[6]  Hua Wang,et al.  Gaussian Interference Channel Capacity to Within One Bit , 2007, IEEE Transactions on Information Theory.

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

[8]  Michael Gastpar,et al.  Practical code design for compute-and-forward , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[9]  W. Kratz Sukzessive Minima mit und ohne Nebenbedingungen , 1981 .

[10]  Joakim Jaldén,et al.  DMT Optimality of LR-Aided Linear Decoders for a General Class of Channels, Lattice Designs, and System Models , 2009, IEEE Transactions on Information Theory.

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

[12]  Aria Nosratinia,et al.  Outage and Diversity of Linear Receivers in Flat-Fading MIMO Channels , 2007, IEEE Transactions on Signal Processing.

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

[14]  Joakim Jaldén,et al.  Achieving a Vanishing SNR Gap to Exact Lattice Decoding at a Subexponential Complexity , 2011, IEEE Transactions on Information Theory.

[15]  Michael Gastpar,et al.  Compute-and-Forward: Harnessing Interference Through Structured Codes , 2009, IEEE Transactions on Information Theory.

[16]  Joakim Jaldén,et al.  Sphere Decoding Complexity Exponent for Decoding Full-Rate Codes Over the Quasi-Static MIMO Channel , 2011, IEEE Transactions on Information Theory.

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

[18]  T. Guess,et al.  Optimum decision feedback multiuser equalization with successive decoding achieves the total capacity of the Gaussian multiple-access channel , 1997, Conference Record of the Thirty-First Asilomar Conference on Signals, Systems and Computers (Cat. No.97CB36136).

[19]  László Lovász,et al.  Factoring polynomials with rational coefficients , 1982 .

[20]  Alfred O. Hero,et al.  Environmental issues for MIMO capacity , 2002, IEEE Trans. Signal Process..

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

[22]  Xiaodong Wang,et al.  LDPC-based space-time coded OFDM systems over correlated fading channels: performance analysis and receiver design , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[23]  Giuseppe Caire,et al.  On maximum-likelihood detection and the search for the closest lattice point , 2003, IEEE Trans. Inf. Theory.

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

[25]  Emanuele Viterbo,et al.  The golden code: a 2 x 2 full-rate space-time code with non-vanishing determinants , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

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

[27]  Cong Ling,et al.  The flatness factor in lattice network coding: design criterion and decoding algorithm , 2012 .

[28]  Krishna R. Narayanan,et al.  Multilevel Coding Schemes for Compute-and-Forward With Flexible Decoding , 2013, IEEE Transactions on Information Theory.

[29]  Alexander Vardy,et al.  Closest point search in lattices , 2002, IEEE Trans. Inf. Theory.

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

[31]  Giuseppe Caire,et al.  Quantized compute and forward: A low-complexity architecture for distributed antenna systems , 2011, 2011 IEEE Information Theory Workshop.

[32]  Gerard J. Foschini,et al.  Layered space-time architecture for wireless communication in a fading environment when using multi-element antennas , 1996, Bell Labs Technical Journal.

[33]  S. R. Searle,et al.  On Deriving the Inverse of a Sum of Matrices , 1981 .

[34]  Giuseppe Caire,et al.  Reverse compute and forward: A low-complexity architecture for downlink distributed antenna systems , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[35]  Jeffrey C. Lagarias,et al.  Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice , 1990, Comb..

[36]  Shlomo Shamai,et al.  Uplink Macro Diversity of Limited Backhaul Cellular Network , 2008, IEEE Transactions on Information Theory.

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

[38]  Uri Erez,et al.  Cyclic coded integer-forcing equalization , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[39]  Frank R. Kschischang,et al.  An Algebraic Approach to Physical-Layer Network Coding , 2010, IEEE Transactions on Information Theory.

[40]  Andrea J. Goldsmith,et al.  Capacity limits of MIMO channels , 2003, IEEE J. Sel. Areas Commun..

[41]  Amir K. Khandani,et al.  Communication Over MIMO Broadcast Channels Using Lattice-Basis Reduction , 2006, IEEE Transactions on Information Theory.

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

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

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

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

[46]  Shlomo Shamai,et al.  LDPC coded MIMO multiple access with iterative joint decoding , 2005, IEEE Transactions on Information Theory.

[47]  Tao Yang,et al.  Distance Spectrum and Performance of Channel-Coded Physical-Layer Network Coding for Binary-Input Gaussian Two-Way Relay Channels , 2012 .

[48]  Iskander Aliev,et al.  Successive Minima and Best Simultaneous Diophantine Approximations , 2005 .

[49]  Pramod Viswanath,et al.  Approximately universal codes over slow-fading channels , 2005, IEEE Transactions on Information Theory.

[50]  Richard D. Gitlin,et al.  The impact of antenna diversity on the capacity of wireless communication systems , 1994, IEEE Trans. Commun..

[51]  Giuseppe Caire,et al.  Integer-forcing interference alignment , 2013, 2013 IEEE International Symposium on Information Theory.

[52]  Stephan ten Brink,et al.  A close-to-capacity dirty paper coding scheme , 2004, IEEE Transactions on Information Theory.

[53]  Daniel J. Costello,et al.  Channel coding: The road to channel capacity , 2006, Proceedings of the IEEE.

[54]  Giuseppe Caire,et al.  Asymptotic Performance of Linear Receivers in MIMO Fading Channels , 2008, IEEE Transactions on Information Theory.

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

[56]  Wei Yu,et al.  Multi-Cell MIMO Cooperative Networks: A New Look at Interference , 2010, IEEE Journal on Selected Areas in Communications.

[57]  Hamid Jafarkhani,et al.  Space-Time Coding - Theory and Practice , 2010 .

[58]  Henry D. Pfister,et al.  Spatially-coupled low density lattices based on construction a with applications to compute-and-forward , 2013, 2013 IEEE Information Theory Workshop (ITW).

[59]  Sergio Verdú,et al.  Linear multiuser detectors for synchronous code-division multiple-access channels , 1989, IEEE Trans. Inf. Theory.

[60]  Michael Gastpar,et al.  Integer-Forcing architectures for MIMO: Distributed implementation and SIC , 2010, 2010 Conference Record of the Forty Fourth Asilomar Conference on Signals, Systems and Computers.

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

[62]  Yu-Chih Huang,et al.  Lattices Over Eisenstein Integers for Compute-and-Forward , 2015, IEEE Trans. Inf. Theory.

[63]  Reinaldo A. Valenzuela,et al.  V-BLAST: an architecture for realizing very high data rates over the rich-scattering wireless channel , 1998, 1998 URSI International Symposium on Signals, Systems, and Electronics. Conference Proceedings (Cat. No.98EX167).

[64]  Mohamed Oussama Damen,et al.  Universal space-time coding , 2003, IEEE Trans. Inf. Theory.

[65]  U. Erez,et al.  Combining space-time block modulation with integer forcing receivers , 2012, 2012 IEEE 27th Convention of Electrical and Electronics Engineers in Israel.

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

[67]  Emre Telatar,et al.  Capacity of Multi-antenna Gaussian Channels , 1999, Eur. Trans. Telecommun..

[68]  Guosen Yue,et al.  Performance analysis and design optimization of LDPC-coded MIMO OFDM systems , 2004, IEEE Trans. Signal Process..

[69]  Upamanyu Madhow,et al.  MMSE interference suppression for direct-sequence spread-spectrum CDMA , 1994, IEEE Trans. Commun..

[70]  Oded Regev,et al.  On lattices, learning with errors, random linear codes, and cryptography , 2009, JACM.

[71]  Stephan ten Brink,et al.  Design of low-density parity-check codes for modulation and detection , 2004, IEEE Transactions on Communications.

[72]  M. J. Gans,et al.  On Limits of Wireless Communications in a Fading Environment when Using Multiple Antennas , 1998, Wirel. Pers. Commun..

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

[74]  Rüdiger L. Urbanke,et al.  Design of capacity-approaching irregular low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.

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

[76]  Uri Erez,et al.  Achieving 1/2 log (1+SNR) on the AWGN channel with lattice encoding and decoding , 2004, IEEE Transactions on Information Theory.

[77]  A. Burg,et al.  VLSI implementation of MIMO detection using the sphere decoding algorithm , 2005, IEEE Journal of Solid-State Circuits.