Conference proceeding
Mse-Optimal 1-Bit Precoding for Multiuser Mimo Via Branch and Bound
2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Vol.2018-, pp.3589-3593
04/2018
DOI: 10.1109/ICASSP.2018.8462212
Abstract
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.
Details
- Title: Subtitle
- Mse-Optimal 1-Bit Precoding for Multiuser Mimo Via Branch and Bound
- Creators
- Sven Jacobsson - Cornell UniversityWeiyu Xu - University of IowaGiuseppe Durisi - EricssonChristoph Studer - Cornell University
- Resource Type
- Conference proceeding
- Publication Details
- 2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Vol.2018-, pp.3589-3593
- Publisher
- IEEE
- DOI
- 10.1109/ICASSP.2018.8462212
- ISSN
- 1520-6149
- eISSN
- 2379-190X
- Language
- English
- Date published
- 04/2018
- Academic Unit
- Electrical and Computer Engineering
- Record Identifier
- 9984197064602771
Metrics
9 Record Views