Low-Complexity Soft-Output MIMO Detectors Based on Optimal Channel Puncturing

Channel puncturing transforms a multiple-input multiple-output (MIMO) channel into a sparse lower-triangular form using the so-called WL decomposition scheme in order to reduce tree-based detection complexity. We propose computationally efficient soft-output detectors based on two forms of channel puncturing: augmented and two-sided. The augmented WL detector (AWLD) employs a punctured channel derived by triangularizing the true channel in augmented form, followed by leftsided Gaussian elimination. The two-sided WL detector (dubbed WLZ) employs right-sided reduction and left-sided elimination to puncture the channel. We prove that augmented channel puncturing is optimal in maximizing the lower-bound on the achievable information rate (AIR) based on a new mismatched detection model. We show that the AWLD decomposes into an MMSE prefilter and channel gain compensation stages, followed by a regular WL detector (WLD) that computes least-squares softdecision estimates. Similarly, WLZ decomposes into a pre-processing reduction step followed by WLD. AWLD attains the same performance as the existing AIR-based partial marginalization (PM) detector, but with less computational complexity. We empirically show that WLZ attains the best complexityperformance tradeoff among tree-based detectors.

[1]  T. Moon Error Correction Coding: Mathematical Methods and Algorithms , 2005 .

[2]  Mohammad M. Mansour Optimal Augmented-Channel Puncturing for Low-Complexity Soft-Output MIMO Detectors , 2020, ICC 2020 - 2020 IEEE International Conference on Communications (ICC).

[3]  Mohammad M. Mansour A Near-ML MIMO Subspace Detection Algorithm , 2015, IEEE Signal Processing Letters.

[4]  Mohammad M. Mansour A low-complexity MIMO subspace detection algorithm , 2015, EURASIP J. Wirel. Commun. Netw..

[5]  Hongwen Yang,et al.  Optimal Linear Detection for MIMO Systems With Finite Constellation Inputs , 2019, IEEE Signal Processing Letters.

[6]  Ali Chehab,et al.  Large MIMO Detection Schemes Based on Channel Puncturing: Performance and Complexity Analysis , 2018, IEEE Transactions on Communications.

[7]  E.G. Larsson,et al.  MIMO Detection Methods: How They Work [Lecture Notes] , 2009, IEEE Signal Processing Magazine.

[8]  Andreas Peter Burg,et al.  K-best MIMO detection VLSI architectures achieving up to 424 Mbps , 2006, 2006 IEEE International Symposium on Circuits and Systems.

[9]  Fredrik Rusek,et al.  A Soft-Output MIMO Detector With Achievable Information Rate based Partial Marginalization , 2017, IEEE Transactions on Signal Processing.

[10]  Guanghui He,et al.  Algorithm and Architecture of an Efficient MIMO Detector With Cross-Level Parallel Tree-Search , 2020, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[11]  John S. Thompson,et al.  Fixing the Complexity of the Sphere Decoder for MIMO Detection , 2008, IEEE Transactions on Wireless Communications.

[12]  Louay M. A. Jalloul,et al.  Reduced Complexity Soft-Output MIMO Sphere Detectors—Part I: Algorithmic Optimizations , 2014, IEEE Transactions on Signal Processing.

[13]  Wei Zeng,et al.  Simulation-Based Computation of Information Rates for Channels With Memory , 2006, IEEE Transactions on Information Theory.

[14]  Michael P. Fitz,et al.  A Novel Soft-Output Layered Orthogonal Lattice Detector for Multiple Antenna Communications , 2006, 2006 IEEE International Conference on Communications.

[15]  Li Wang,et al.  Two Decades of MIMO Design Tradeoffs and Reduced-Complexity MIMO Detection in Near-Capacity Systems , 2017, IEEE Access.

[16]  Hiroshi Suzuki,et al.  Low-Complexity MIMO Signal Detection Employing Multistream Constrained Search , 2017, IEEE Transactions on Vehicular Technology.

[17]  K. Kammeyer,et al.  Efficient algorithm for decoding layered space-time codes , 2001 .

[18]  Erik G. Larsson,et al.  Partial Marginalization Soft MIMO Detection With Higher Order Constellations , 2011, IEEE Transactions on Signal Processing.

[19]  Erik G. Larsson,et al.  Fixed-Complexity Soft MIMO Detection via Partial Marginalization , 2008, IEEE Transactions on Signal Processing.

[20]  Helmut Bölcskei,et al.  Soft–Input Soft–Output Single Tree-Search Sphere Decoding , 2009, IEEE Transactions on Information Theory.

[21]  Louay M. A. Jalloul,et al.  Reduced Complexity Soft-Output MIMO Sphere Detectors—Part II: Architectural Optimizations , 2014, IEEE Transactions on Signal Processing.

[22]  Fuzhen Zhang Matrix Theory: Basic Results and Techniques , 1999 .

[23]  R Jessup,et al.  A Parallel Algorithm for Computing the Singular Value Decomposition of a Matrix:A Revision of Argonne National Laboratory Tech. Report ANL/MCS-TM-102 ; CU-CS-623-92 , 1994 .

[24]  Fredrik Rusek,et al.  Optimal Channel Shortening for MIMO and ISI Channels , 2012, IEEE Transactions on Wireless Communications.

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

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

[27]  Jian Weng,et al.  On Low-Complexity Lattice Reduction Algorithms for Large-Scale MIMO Detection: The Blessing of Sequential Reduction , 2019, IEEE Transactions on Signal Processing.

[28]  Frans Lemeire,et al.  Bounds for condition numbers of triangular and trapezoid matrices , 1975 .

[29]  Louay M. A. Jalloul,et al.  Optimized Configurable Architectures for Scalable Soft-Input Soft-Output MIMO Detectors With 256-QAM , 2015, IEEE Transactions on Signal Processing.

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

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

[32]  Babak Hassibi,et al.  An efficient square-root algorithm for BLAST , 2000, 2000 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.00CH37100).

[33]  E. Larsson,et al.  MIMO Detection Methods: How They Work , 2010 .