MSE-Optimal 1-Bit Precoding for Multiuser MIMO Via Branch and Bound
Paper i 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.

1-bit quantization

massive multiuser multiple-input multiple-output

precoding

branch and bound

Författare

Sven Jacobsson

Ericsson, Göteborg

Cornell University

Chalmers, Elektroteknik, Kommunikations- och antennsystem, Kommunikationssystem

Weiyu Xu

University of Iowa

Giuseppe Durisi

Chalmers, Elektroteknik, Kommunikations- och antennsystem, Kommunikationssystem

Christoph Studer

Cornell University

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

3589-3593

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

Ämneskategorier

Telekommunikation

Reglerteknik

Signalbehandling

DOI

10.1109/ICASSP.2018.8462212

Mer information

Senast uppdaterat

2019-06-03