Pith. sign in

REVIEW

Efficient Non-linear Equalization for 1-bit Quantized Cyclic Prefix-Free Massive MIMO Systems

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 1804.10695 v2 pith:6BSP7BMG submitted 2018-04-27 cs.IT math.IT

Efficient Non-linear Equalization for 1-bit Quantized Cyclic Prefix-Free Massive MIMO Systems

classification cs.IT math.IT
keywords algorithmmassivemimoquantizedsystemsblockcyclicefficient
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

This paper addresses the problem of data detection for a massive Multiple-Input-Multiple-Output (MIMO) base station which utilizes 1-bit Analog-to-Digital Converters (ADCs) for quantizing the uplink signal. The existing literature on quantized massive MIMO systems deals with Cyclic Prefix (CP) transmission over frequency-selective channels. In this paper, we propose a computationally efficient block processing equalizer based on the Expectation Maximization (EM) algorithm in CP-free transmission for 1-bit quantized systems. We investigate the optimal block length and overlapping factor in relation to the Channel Impulse Response (CIR) length based on the Bit Error-Rate (BER) performance metric. As EM is a non-linear algorithm, the optimal estimate is found iteratively depending on the initial starting point of the algorithm. Through numerical simulations we show that initializing the EM-algorithm with a Wiener-Filter (WF) estimate, which takes the underlying quantization into account, achieves superior BER-performance compared to initialization with other starting points.

discussion (0)

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