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.

massive multiuser multiple-input multiple-output

precoding

1-bit quantization

branch and bound

Författare

Sven Jacobsson

Cornell University

Ericsson, Göteborg

Chalmers, Elektroteknik, Kommunikationssystem, informationsteori och antenner, Kommunikationssystem

Weiyu Xu

University of Iowa

Giuseppe Durisi

Chalmers, Elektroteknik, Kommunikationssystem, informationsteori och antenner, Kommunikationssystem

Christoph Studer

Cornell University

2018 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP)

3589-3593

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-02-13