Neural Enhancement of Factor Graph-based Symbol Detection

03/07/2022
by   Luca Schmid, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/30/2022

Low-complexity Near-optimum Symbol Detection Based on Neural Enhancement of Factor Graphs

We consider the application of the factor graph framework for symbol det...
research
11/21/2022

Structural Optimization of Factor Graphs for Symbol Detection via Continuous Clustering and Machine Learning

We propose a novel method to optimize the structure of factor graphs for...
research
06/02/2023

Local Message Passing on Frustrated Systems

Message passing on factor graphs is a powerful framework for probabilist...
research
05/23/2021

Graph-based Detection of Multiuser Impulse Radio Systems

Impulse-Radio (IR) is a wideband modulation technique that can support m...
research
06/05/2020

Inference from Stationary Time Sequences via Learned Factor Graphs

The design of methods for inference from time sequences has traditionall...
research
03/22/2022

The b-symbol weight distribution of irreducible cyclic codes and related consequences

The b-symbol read channel is motivated by the limitations of the reading...
research
10/07/2019

Cyclic Prefix Adaptation with Constant Overall Symbol Time for DFT-spread-OFDM and OFDM

For DFT-spread-OFDM or OFDM, if the delay spread varies in a wide range ...

Please sign up or login with your details

Forgot password? Click here to reset