A comprehensive expectation identification framework for multirate time-delayed systems

The expectation maximization (EM) algorithm has been extensively used to solve system identification problems with hidden variables. It needs to calculate a derivative equation and perform a matrix inversion in the EM-M step. The equations related to the EM algorithm may be unsolvable for some complex nonlinear systems, and the matrix inversion has heavy computational costs for large-scale systems. This article provides two expectation-based algorithms with the aim of constructing a comprehensive expectation framework concerning different kinds of time-delayed systems: 1) for a small-scale linear system, the classical EM algorithm can quickly obtain the parameter and time-delay estimates; 2) for a complex nonlinear system with low order, the proposed expectation gradient descent algorithm can avoid derivative function calculation; 3) for a large-scale system, the proposed expectation multidirection algorithm does not require eigenvalue calculation and has less computational costs. These two algorithms are developed based on the gradient descent and multidirection methods. Under such an expectation framework, different kinds of models are identified on a case-by-case basis. The convergence analysis and simulation examples show the effectiveness of the algorithms

Adaptive Detection of Instabilities: An Experimental Feasibility Study

We present an example of the practical implementation of a protocol for experimental bifurcation detection based on on-line identification and feedback control ideas. The idea is to couple the experiment with an on-line computer-assisted identification/feedback protocol so that the closed-loop system will converge to the open-loop bifurcation points. We demonstrate the applicability of this instability detection method by real-time, computer-assisted detection of period doubling bifurcations of an electronic circuit; the circuit implements an analog realization of the Roessler system. The method succeeds in locating the bifurcation points even in the presence of modest experimental uncertainties, noise and limited resolution. The results presented here include bifurcation detection experiments that rely on measurements of a single state variable and delay-based phase space reconstruction, as well as an example of tracing entire segments of a codimension-1 bifurcation boundary in two parameter space.Comment: 29 pages, Latex 2.09, 10 figures in encapsulated postscript format (eps), need psfig macro to include them. Submitted to Physica

Adaptive Bayesian decision feedback equalizer for dispersive mobile radio channels

The paper investigates adaptive equalization of time dispersive mobile ratio fading channels and develops a robust high performance Bayesian decision feedback equalizer (DFE). The characteristics and implementation aspects of this Bayesian DFE are analyzed, and its performance is compared with those of the conventional symbol or fractional spaced DFE and the maximum likelihood sequence estimator (MLSE). In terms of computational complexity, the adaptive Bayesian DFE is slightly more complex than the conventional DFE but is much simpler than the adaptive MLSE. In terms of error rate in symbol detection, the adaptive Bayesian DFE outperforms the conventional DFE dramatically. Moreover, for severely fading multipath channels, the adaptive MLSE exhibits significant degradation from the theoretical optimal performance and becomes inferior to the adaptive Bayesian DFE

Fast recursive filters for simulating nonlinear dynamic systems

A fast and accurate computational scheme for simulating nonlinear dynamic systems is presented. The scheme assumes that the system can be represented by a combination of components of only two different types: first-order low-pass filters and static nonlinearities. The parameters of these filters and nonlinearities may depend on system variables, and the topology of the system may be complex, including feedback. Several examples taken from neuroscience are given: phototransduction, photopigment bleaching, and spike generation according to the Hodgkin-Huxley equations. The scheme uses two slightly different forms of autoregressive filters, with an implicit delay of zero for feedforward control and an implicit delay of half a sample distance for feedback control. On a fairly complex model of the macaque retinal horizontal cell it computes, for a given level of accuracy, 1-2 orders of magnitude faster than 4th-order Runge-Kutta. The computational scheme has minimal memory requirements, and is also suited for computation on a stream processor, such as a GPU (Graphical Processing Unit).Comment: 20 pages, 8 figures, 1 table. A comparison with 4th-order Runge-Kutta integration shows that the new algorithm is 1-2 orders of magnitude faster. The paper is in press now at Neural Computatio

Low computational complexity model reduction of power systems with preservation of physical characteristics

A data-driven algorithm recently proposed to solve the problem of model reduction by moment matching is extended to multi-input, multi-output systems. The algorithm is exploited for the model reduction of large-scale interconnected power systems and it offers, simultaneously, a low computational complexity approximation of the moments and the possibility to easily enforce constraints on the reduced order model. This advantage is used to preserve selected slow and poorly damped modes. The preservation of these modes has been shown to be important from a physical point of view and in obtaining an overall good approximation. The problem of the choice of the socalled tangential directions is also analyzed. The algorithm and the resulting reduced order model are validated with the study of the dynamic response of the NETS-NYPS benchmark system (68-Bus, 16-Machine, 5-Area) to multiple fault scenarios

A distributed networked approach for fault detection of large-scale systems

Networked systems present some key new challenges in the development of fault diagnosis architectures. This paper proposes a novel distributed networked fault detection methodology for large-scale interconnected systems. The proposed formulation incorporates a synchronization methodology with a filtering approach in order to reduce the effect of measurement noise and time delays on the fault detection performance. The proposed approach allows the monitoring of multi-rate systems, where asynchronous and delayed measurements are available. This is achieved through the development of a virtual sensor scheme with a model-based re-synchronization algorithm and a delay compensation strategy for distributed fault diagnostic units. The monitoring architecture exploits an adaptive approximator with learning capabilities for handling uncertainties in the interconnection dynamics. A consensus-based estimator with timevarying weights is introduced, for improving fault detectability in the case of variables shared among more than one subsystem. Furthermore, time-varying threshold functions are designed to prevent false-positive alarms. Analytical fault detectability sufficient conditions are derived and extensive simulation results are presented to illustrate the effectiveness of the distributed fault detection technique