Mse-Optimal 1-Bit Precoding for Multiuser Mimo Via Branch and Bound

In this paper, we solve the sum mean-squared error (MSE)-optimal 1-bit quantized precoding problem exactly for small-to-moderate sized multiuser multiple-input multiple-output (MU-MIMO) systems via branch and bound. To this end, we reformulate the original NP-hard precoding problem as a tree search and deploy a number of strategies that improve the pruning efficiency without sacrificing optimality. We evaluate the error-rate performance and the complexity of the resulting 1-bit branch-and-bound (BB-1) precoder, and compare its efficacy to that of existing, suboptimal algorithms for 1-bit precoding in MU-MIMO systems.

[1]  Robert W. Heath,et al.  An Overview of Signal Processing Techniques for Millimeter Wave MIMO Systems , 2015, IEEE Journal of Selected Topics in Signal Processing.

[2]  Tom Goldstein,et al.  Quantized Precoding for Massive MU-MIMO , 2016, IEEE Transactions on Communications.

[3]  Robert W. Heath,et al.  Five disruptive technology directions for 5G , 2013, IEEE Communications Magazine.

[4]  Babak Hassibi,et al.  Speeding up the Sphere Decoder With $H^{\infty }$ and SDP Inspired Lower Bounds , 2008, IEEE Transactions on Signal Processing.

[5]  Amine Mezghani,et al.  Minimum probability-of-error perturbation precoding for the one-bit massive MIMO downlink , 2017, 2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[6]  Cheng Tao,et al.  Downlink Achievable Rate Analysis in Massive MIMO Systems With One-Bit DACs , 2016, IEEE Communications Letters.

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

[8]  Olav Tirkkonen,et al.  Subset-codebook precoding for 1-bit massive multiuser MIMO , 2017, 2017 51st Annual Conference on Information Sciences and Systems (CISS).

[9]  Wai Ho Mow,et al.  A VLSI architecture of a K-best lattice decoding algorithm for MIMO channels , 2002, 2002 IEEE International Symposium on Circuits and Systems. Proceedings (Cat. No.02CH37353).

[10]  B. Hassibi,et al.  Speeding up the Sphere Decoder With H and SDP Inspired Lower Bounds , 2008 .

[11]  Martin Haardt,et al.  An introduction to the multi-user MIMO downlink , 2004, IEEE Communications Magazine.

[12]  Sven Jacobsson,et al.  Nonlinear Precoding for Phase-Quantized Constant-Envelope Massive MU-MIMO-OFDM , 2017, 2018 25th International Conference on Telecommunications (ICT).

[13]  Tom Goldstein,et al.  1-bit Massive MU-MIMO Precoding in VLSI , 2017, IEEE Journal on Emerging and Selected Topics in Circuits and Systems.

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

[15]  Rodrigo C. de Lamare,et al.  Branch-and-Bound Precoding for Multiuser MIMO Systems With 1-Bit Quantization , 2017, IEEE Wireless Communications Letters.

[16]  Josef A. Nossek,et al.  Minimum BER precoding in 1-Bit massive MIMO systems , 2016, 2016 IEEE Sensor Array and Multichannel Signal Processing Workshop (SAM).

[17]  Sven Jacobsson,et al.  Massive MU-MIMO-OFDM Downlink with One-Bit DACs and Linear Precoding , 2017, GLOBECOM 2017 - 2017 IEEE Global Communications Conference.

[18]  Josef A. Nossek,et al.  Transmit processing with low resolution D/A-converters , 2009, 2009 16th IEEE International Conference on Electronics, Circuits and Systems - (ICECS 2009).

[19]  Erik G. Larsson,et al.  Scaling Up MIMO: Opportunities and Challenges with Very Large Arrays , 2012, IEEE Signal Process. Mag..

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