Pith. sign in

REVIEW

Near-Optimal Interference Exploitation 1-Bit Massive MIMO Precoding via Partial Branch-and-Bound

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2002.05391 v1 pith:MKBHHELF submitted 2020-02-13 eess.SP cs.ITmath.IT

classification eess.SPcs.ITmath.IT
keywords constraintprecodingantennabranch-and-boundinterferencelarge-scalenear-optimalp-bb
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In this paper, we focus on 1-bit precoding for large-scale antenna systems in the downlink based on the concept of constructive interference (CI). By formulating the optimization problem that aims to maximize the CI effect subject to the 1-bit constraint on the transmit signals, we mathematically prove that, when relaxing the 1-bit constraint, the majority of the obtained transmit signals already satisfy the 1-bit constraint. Based on this important observation, we propose a 1-bit precoding method via a partial branch-and-bound (P-BB) approach, where the BB procedure is only performed for the entries that do not comply with the 1-bit constraint. The proposed P-BB enables the use of the BB framework in large-scale antenna scenarios, which was not applicable due to its prohibitive complexity. Numerical results demonstrate a near-optimal error rate performance for the proposed 1-bit precoding algorithm.

Discussion (0). Continue with ORCID to comment.

Pith tools