MSE-Optimal 1-Bit Precoding for Multiuser MIMO Via Branch and Bound
Paper in proceeding, 2018

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.

precoding

branch and bound

1-bit quantization

massive multiuser multiple-input multiple-output

Author

Sven Jacobsson

Ericsson

Chalmers, Electrical Engineering, Communication, Antennas and Optical Networks

Cornell University

Weiyu Xu

University of Iowa

Giuseppe Durisi

Chalmers, Electrical Engineering, Communication, Antennas and Optical Networks

Christoph Studer

Cornell University

ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

15206149 (ISSN)

3589-3593
978-1-5386-4658-8 (ISBN)

2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
Calgary, Canada,

Massive MIMO systems with low-resolution converters

Swedish Foundation for Strategic Research (SSF) (ID14-0022), 2015-03-01 -- 2020-02-28.

Subject Categories

Telecommunications

Control Engineering

Signal Processing

DOI

10.1109/ICASSP.2018.8462212

More information

Latest update

3/21/2023