Pith. sign in

REVIEW

Linear One-Bit Precoding in Massive MIMO: Asymptotic SEP Analysis and Optimization

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 2306.15260 v1 pith:K2LNHCWN submitted 2023-06-27 cs.IT eess.SPmath.IT

Linear One-Bit Precoding in Massive MIMO: Asymptotic SEP Analysis and Optimization

classification cs.IT eess.SPmath.IT
keywords precodinglinearone-bitanalysisasymptoticclassconsideredschemes
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

This paper focuses on the analysis and optimization of a class of linear one-bit precoding schemes for a downlink massive MIMO system under Rayleigh fading channels. The considered class of linear one-bit precoding is fairly general, including the well-known matched filter (MF) and zero-forcing (ZF) precoding schemes as special cases. Our analysis is based on an asymptotic framework where the numbers of transmit antennas and users in the system grow to infinity with a fixed ratio. We show that, under the asymptotic assumption, the symbol error probability (SEP) of the considered linear one-bit precoding schemes converges to that of a scalar ``signal plus independent Gaussian noise'' model. This result enables us to provide accurate predictions for the SEP of linear one-bit precoding. Additionally, we also derive the optimal linear one-bit precoding scheme within the considered class based on our analytical results. Simulation results demonstrate the excellent accuracy of the SEP prediction and the optimality of the derived precoder.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.