English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In this paper, we solve the sum mean-squared error (MSE)-optimal 1-bitquantized precoding problem exactly for small-to-moderate sized multiusermultiple-input multiple-output (MU-MIMO) systems via branch and bound. To thisend, we reformulate the original NP-hard precoding problem as a tree search anddeploy a number of strategies that improve the pruning efficiency withoutsacrificing optimality. We evaluate the error-rate performance and thecomplexity of the resulting 1-bit branch-and-bound (BB-1) precoder, and compareits efficacy to that of existing, suboptimal algorithms for 1-bit precoding inMU-MIMO systems.

MSE-optimal 1-bit Precoding for Multiuser MIMO via Branch and Bound