Impulsive noise is the main limiting factor for transmission over channels affected by elec-tromagnetic interference. We study the estimation of (correlated) Gaussian signals in an impulsive noise scenario. In this work, we analyze some of the existing, as well as some novel estimation algorithms. Their performance is compared, for the first time, for different channel conditions, including the Markov–Middleton scenario, where the impulsive noise switches between different noise states. Following a modern approach in digital communications, the receiver design is based on a factor graph model and implements a message passing algorithm. The correlation among signal samples, as well as among noise states brings about a loopy factor graph, where an iterative message passing scheme should be employed. As is well known, approximate variational inference techniques are necessary in these cases. We propose and analyze different algorithms and provide a complete performance comparison among them, showing that the expectation propagation, transparent propa-gation, and parallel iterative schedule approaches reach a performance close to optimal, at different channel conditions.
Iterative receiver design for the estimation of Gaussian samples in impulsive noise
Pecori R.;Veltri L.
2021-01-01
Abstract
Impulsive noise is the main limiting factor for transmission over channels affected by elec-tromagnetic interference. We study the estimation of (correlated) Gaussian signals in an impulsive noise scenario. In this work, we analyze some of the existing, as well as some novel estimation algorithms. Their performance is compared, for the first time, for different channel conditions, including the Markov–Middleton scenario, where the impulsive noise switches between different noise states. Following a modern approach in digital communications, the receiver design is based on a factor graph model and implements a message passing algorithm. The correlation among signal samples, as well as among noise states brings about a loopy factor graph, where an iterative message passing scheme should be employed. As is well known, approximate variational inference techniques are necessary in these cases. We propose and analyze different algorithms and provide a complete performance comparison among them, showing that the expectation propagation, transparent propa-gation, and parallel iterative schedule approaches reach a performance close to optimal, at different channel conditions.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.