Pith. sign in

REVIEW

Optimization of Iterative Blind Detection based on Expectation Maximization and Belief Propagation

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 2408.02312 v1 pith:IGCGXMJK submitted 2024-08-05 cs.IT cs.LGeess.SPmath.IT

classification cs.ITcs.LGeess.SPmath.IT
keywords detectionalgorithmbeliefblindexpectationiterativemaximizationparameter
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We study iterative blind symbol detection for block-fading linear inter-symbol interference channels. Based on the factor graph framework, we design a joint channel estimation and detection scheme that combines the expectation maximization (EM) algorithm and the ubiquitous belief propagation (BP) algorithm. Interweaving the iterations of both schemes significantly reduces the EM algorithm's computational burden while retaining its excellent performance. To this end, we apply simple yet effective model-based learning methods to find a suitable parameter update schedule by introducing momentum in both the EM parameter updates as well as in the BP message passing. Numerical simulations verify that the proposed method can learn efficient schedules that generalize well and even outperform coherent BP detection in high signal-to-noise scenarios.

Discussion (0). Sign in to comment.

Pith tools