Consider a discrete-time remote estimation system formed by an encoder, a transmission policy, a channel, and a remote estimator. The encoder assesses a random process that the remote estimator seeks to estimate based on information sent to it by the encoder via the channel. The channel is affected by Bernoulli drops. The instantaneous probability of a drop is governed by a finite state machine...

This paper theoretically analyzes the Mean Square Error (MSE) on the steady-state frequency estimation realized by the all-pass-based adaptive notch filtering algorithms with the normalized lattice structure. The adaptive algorithms to be considered are the Simplified Lattice Algorithm (SLA) proposed by Regalia and the Affine Combination Lattice Algorithm (ACLA) proposed by the authors. For the...

This paper deals with a new multiple input multiple output active control algorithm applied to reduce synchronous machine vibrations. Usually, this kind of algorithm has good performance on linear time-invariant, or slowly timevarying systems. The present system has been developped taking into account the presence of a linear periodically time-varying transfer function. Signals are first shown ...

We address p-shift finite impulse response optimal (OFIR) and unbiased (UFIR) algorithms for predictive filtering (p > 0), filtering (p = 0), and smoothing filtering (p < 0) at a discrete point n over N neighboring points. The algorithms were designed for linear time-invariant state-space signal models with white Gaussian noise. The OFIR filter self-determines the initial mean square state func...

In this paper, we study the problem of control of discrete-time linear time varying systems over uncertain channels. The uncertainty in the channels is modeled as a stochastic random variable. We use exponential mean square stability of the closed-loop system as a stability criterion. We show that fundamental limitations arise for the mean square exponential stabilization for the closed-loop sy...

a common method to determine the order of minimal realization of a continuous linear time invariant descriptor system is to decompose it into slow and fast subsystems using the weierstrass canonical form. the weierstrass decomposition should be avoided because it is generally an ill-conditioned problem that requires many complex calculations especially for high-dimensional systems. the present ...

A surface in homogenous space Sol is said to be an invariant surface if it is invariant under some of the two 1-parameter groups of isometries of the ambient space whose fix point sets are totally geodesic surfaces. In this work we study invariant surfaces that satisfy a certain condition on their curvatures. We classify invariant surfaces with constant mean curvature and constant Gaussian curv...

In this work, a recently derived recursive least-square (RLS) algorithm to train multi layer perceptron (MLP) is used in an MLP-based decision feedback equalizer (DFE) instead of the back propagation (BP) algorithm. Its performance is investigated and compared to those of MLP-DFE based on the BP algorithm and the simple DFE based on the least-mean square (LMS) algorithm. The results show improv...

The purpose of this paper is to give a stream-lined proof of the existence and uniqueness of a right-invariant mean on a CHART group. A CHART group is a slight generalisation of a compact topological group. The existence of an invariant mean on a CHART group can be used to prove Furstenberg’s fixed point theorem.

Applying Šmulian Theorem, we show that if a Banach space X is not reflexive then the space of bounded functions from Z with values in X does not admit an invariant mean. Invariant means on amenable groups are an important tool in many parts of mathematics, especially in harmonic analysis (see [5, 6]). For basic properties of invariant means, we refer the reader to [5]. We would only like to men...