Figure 2 - uploaded by Armando Vannucci
Content may be subject to copyright.
Source publication
Impulsive noise is the main limiting factor for transmission over channels affected by electromagnetic interference. We study the estimation of (correlated) Gaussian signals in an impulsive noise scenarios. In this work, we analyze some of the existing as well as some novel estimation algorithms. Their performance is compared, for the first time, f...
Contexts in source publication
Context 1
... which each row sums to one and x is the correlation parameter. Referring to the state diagram in Fig. 2, the channel can remain in the present state i k ∈ {0, 1, · · · , M − 1} with probability x or otherwise switch to one of the states (including i k ), with a (pruned, due to (11)) Poisson distribution. The average duration of an impulsive event with m interferers, i.e., the average permanence time within a state m, can be computed ...
Context 2
... which each row sums to one and x is the correlation parameter. Referring to the state diagram in Fig. 2, the channel can remain in the present state i k ∈ {0, 1, · · · , M − 1} with probability x or otherwise switch to one of the states (including i k ), with a (pruned, due to (11)) Poisson distribution. The average duration of an impulsive event with m interferers, i.e., the average permanence time within a state m, can be computed ...
Similar publications
MPI communication optimization is essential for high-performance applications. The communication performance models have made some achievements in improving the efficiency of collective algorithms and optimizing communication scheduling. Instead of using hardware-related parameters such as bandwidth and latency for communication modeling, recent st...
Despite recent advances in achieving fair representations and predictions through regularization, adversarial debiasing, and contrastive learning in graph neural networks (GNNs), the working mechanism (i.e., message passing) behind GNNs inducing unfairness issue remains unknown. In this work, we theoretically and experimentally demonstrate that rep...
Many cyber-physical systems are offloading computation-heavy programs to hardware accelerators (e.g., GPU and TPU) to reduce execution time. These applications will self-suspend between offloading data to the accelerators and obtaining the returned results. Previous efforts have shown that self-suspending tasks can cause scheduling anomalies, but n...
The growing demand for transparency and interpretability in critical domains has driven increased interests in comprehending the explainability of Message-Passing (MP) Graph Neural Networks (GNNs). Although substantial research efforts have been made to generate explanations for individual graph instances, identifying global explaining concepts for...
The atomic cluster expansion provides local, complete basis functions that enable efficient parametrization of many-atom interactions. We extend the atomic cluster expansion to incorporate graph basis functions. This naturally leads to representations that enable the efficient description of semilocal interactions in physically and chemically trans...
Citations
This paper addresses the problem of mitigating unknown partial path overlaps in communication systems. This study demonstrates that by utilizing the front-end insight of communication systems along with the sum–product algorithm applied to factor graphs, it is possible not only to track these overlapping components accurately, but also to detect all multipath channel impairments simultaneously. The proposed methodology involves discretizing channel parameters, such as channel paths and attenuation coefficients, to ensure the most accurate computation of means of Gaussian observations. These parameters are modeled as Bernoulli random variables with priors set to 0.5. A notable aspect of the algorithm is its integration of the received signal power into the calculation of noise variance, which is critical for its performance. To further reduce the receiver complexity, a novel implementation strategy, based on provided pre-defined look up tables (LOTs) to the reciver, is introduced. The simulation results, covering both distributed and concentrated pilot scenarios, reveal that the algorithm performs almost equally under both conditions and surpasses the established upper bound in performance.
