Recently a new blind equalization method was proposed for the 16QAM constellation input inspired by the maximum entropy density approximation technique with improved equalization performance compared to the maximum entropy approach, Godard's algorithm, and others. In addition, an approximated expression for the minimum mean square error (MSE) was obtained. The idea was to find those Lagrange mu...

The nonlinear properties of spontaneous fluctuations in blood oxygen level-dependent (BOLD) signals remain unexplored. We test the hypothesis that complexity of BOLD activity is reduced with aging and is correlated with cognitive performance in the elderly. A total of 99 normal older and 56 younger male subjects were included. Cognitive function was assessed using Cognitive Abilities Screening ...

AIMS The influences of nonstationarity and nonlinearity on heart rate time series can be mathematically qualified or quantified by multiscale entropy (MSE). The aim of this study is to investigate the prognostic value of parameters derived from MSE in the patients with systolic heart failure. METHODS AND RESULTS Patients with systolic heart failure were enrolled in this study. One month after...

We consider the problem of estimating a random vector x, with covariance uncertainties, that is observed through a known linear transformation H and corrupted by additive noise. We first develop the linear estimator that minimizes the worst-case meansquared error (MSE) across all possible covariance matrices. Although the minimax approach has enjoyed widespread use in the design of robust metho...

We consider the problem of signal estimation (denoising) from a statistical-mechanical perspective, in continuation to a recent work on the analysis of mean-square error (MSE) estimation using a direct relationship between optimum estimation and certain partition functions. The paper consists of essentially two parts. In the first part, using the aforementioned relationship, we derive single-le...

We study the NP-complete Minimum Shared Edges (MSE) problem. Given an undirected graph, a source and a sink vertex, and two integers p and k, the question is whether there are p paths in the graph connecting the source with the sink and sharing at most k edges. Herein, an edge is shared if it appears in at least two paths. We show that MSE is W[1]-hard when parameterized by the treewidth of the...