ITLGSPMar 7, 2022

Neural Enhancement of Factor Graph-based Symbol Detection

arXiv:2203.03333v24 citationsh-index: 31
AI Analysis

This work addresses a specific problem in communication systems for engineers, but it is incremental as it builds on existing factor graph methods.

The paper tackles the suboptimal performance of cyclic factor graph-based symbol detection on linear inter-symbol interference channels by using neural enhancement, resulting in improved detection performance and reduced complexity.

We study the application of the factor graph framework for symbol detection on linear inter-symbol interference channels. Cyclic factor graphs have the potential to yield low-complexity symbol detectors, but are suboptimal if the ubiquitous sum-product algorithm is applied. In this paper, we present and evaluate strategies to improve the performance of cyclic factor graph-based symbol detection algorithms by means of neural enhancement. In particular, we apply neural belief propagation as an effective way to counteract the effect of cycles within the factor graph. We further propose the application and optimization of a linear preprocessor of the channel output. By modifying the observation model, the preprocessing can effectively change the underlying factor graph, thereby significantly improving the detection performance as well as reducing the complexity.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes