A new SSI algorithm for LPTV systems: Application to a hinged-bladed helicopter

Many systems such as turbo-generators, wind turbines and helicopters show intrinsic time-periodic behaviors. Usually, these structures are considered to be faithfully modeled as linear time-invariant (LTI). In some cases where the rotor is anisotropic, this modeling does not hold and the equations of motion lead necessarily to a linear periodically time- varying (referred to as LPTV in the control and digital signal field or LTP in the mechanical and nonlinear dynamics world) model. Classical modal analysis methodologies based on the classical time-invariant eigenstructure (frequencies and damping ratios) of the system no more apply. This is the case in particular for subspace methods. For such time-periodic systems, the modal analysis can be described by characteristic exponents called Floquet multipliers. The aim of this paper is to suggest a new subspace-based algorithm that is able to extract these multipliers and the corresponding frequencies and damping ratios. The algorithm is then tested on a numerical model of a hinged-bladed helicopter on the ground

Extension of Subspace Identification to LPTV Systems: Application to Helicopters

International audienceIn this paper, we focus on extending the subspace identification to the class of linear periodically time-varying (LPTV) systems. The Lyapunov-Floquet transformation is first applied to the system’s state-space model in order to get the monodromy matrix (MM) and, thus, a necessary and sufficient condition for system stability. Then, given two successive covariance-driven Hankel matrices, the MM matrix is extracted by some calculus of a simultaneous singular value decomposition (SVD) and a least square optimization. The method is illustrated by a simulation application to the model of a hinged-blades helicopter

Instantaneous frequency identification of a time varying structure using wavelet-based state-space method

This paper presents a method to identify the instantaneous frequency of the time varying structures based on wavelet and state space methods by using free and forced vibration response data. Firstly, the second-order vibration differential equations are rewritten as the first-order state equations using state space theory. Secondly, both excitation and response signals are projected by the Daubechies wavelet scaling functions. Thus, the first-order state equations are transformed into linear algebraic equations using the orthogonality of the scaling functions. Lastly, the equivalent time varying state space system matrices of time varying structure are extracted directly by solving the linear equations. The instantaneous frequencies are determined via eigenvalue decomposition of the state space system matrices. The proposed identification algorithm is investigated with a four degrees-of-freedom spring-mass-damper model. Numerical simulations demonstrate that the proposed method is robust and effective for identification of the abruptly, smoothly and periodically changing instantaneous frequencies of time varying structures

Subspace Identification for Linear Periodically Time-varying Systems

In this paper, an extension of the output-only subspace identification, to the class of linear periodically time-varying (LPTV) systems, is proposed. The goal is to identify a useful information about the system’s stability using the Floquet theory which gives a necessary and sufficient condition for stability analysis. This information is retrieved from a matrix called the monodromy matrix, which is extracted by some simultaneous singular value decompositions (SVD) and from a resolution of a least squares criterion. The method is, finally, illustrated by a simulation of a model of a helicopter with a hinged-blades rotor

Cornerstones of Sampling of Operator Theory

This paper reviews some results on the identifiability of classes of operators whose Kohn-Nirenberg symbols are band-limited (called band-limited operators), which we refer to as sampling of operators. We trace the motivation and history of the subject back to the original work of the third-named author in the late 1950s and early 1960s, and to the innovations in spread-spectrum communications that preceded that work. We give a brief overview of the NOMAC (Noise Modulation and Correlation) and Rake receivers, which were early implementations of spread-spectrum multi-path wireless communication systems. We examine in detail the original proof of the third-named author characterizing identifiability of channels in terms of the maximum time and Doppler spread of the channel, and do the same for the subsequent generalization of that work by Bello. The mathematical limitations inherent in the proofs of Bello and the third author are removed by using mathematical tools unavailable at the time. We survey more recent advances in sampling of operators and discuss the implications of the use of periodically-weighted delta-trains as identifiers for operator classes that satisfy Bello's criterion for identifiability, leading to new insights into the theory of finite-dimensional Gabor systems. We present novel results on operator sampling in higher dimensions, and review implications and generalizations of the results to stochastic operators, MIMO systems, and operators with unknown spreading domains

Identification of linear periodically time-varying (LPTV) systems

A linear periodically time-varying (LPTV) system is a linear time-varying system with the coefficients changing periodically, which is widely used in control, communications, signal processing, and even circuit modeling. This thesis concentrates on identification of LPTV systems. To this end, the representations of LPTV systems are thoroughly reviewed. Identification methods are developed accordingly. The usefulness of the proposed identification methods is verified by the simulation results. A periodic input signal is applied to a finite impulse response (FIR)-LPTV system and measure the noise-contaminated output. Using such periodic inputs, we show that we can formulate the problem of identification of LPTV systems in the frequency domain. With the help of the discrete Fourier transform (DFT), the identification method reduces to finding the least-squares (LS) solution of a set of linear equations. A sufficient condition for the identifiability of LPTV systems is given, which can be used to find appropriate inputs for the purpose of identification. In the frequency domain, we show that the input and the output can be related by using the discrete Fourier transform (DFT) and a least-squares method can be used to identify the alias components. A lower bound on the mean square error (MSE) of the estimated alias components is given for FIR-LPTV systems. The optimal training signal achieving this lower MSE bound is designed subsequently. The algorithm is extended to the identification of infinite impulse response (IIR)-LPTV systems as well. Simulation results show the accuracy of the estimation and the efficiency of the optimal training signal design

Subspace Instability Monitoring for Linear Periodically Time-Varying Systems

Most subspace-based methods enabling instability monitoring are restricted to the linear time-invariant (LTI) systems. In this paper, a new subspace method of instability monitoring is proposed for the linear periodically time-varying (LPTV) case. For some LPTV systems, the system transition matrices may depend on some parameter and are also periodic in time. A certain range of values for the parameter leads to an unstable transition matrix. Early warning should be given when the system gets close to that region, taking into account the time variation of the system. Using the theory of Floquet, some symptom parameter of stability- or residual- is defined. Then, the parameter variation is tracked by performing a set of parallel cumulative sum (CUSUM) tests. Finally, the method is tested on a simulated model of a helicopter with hinged blades, for monitoring the ground resonance phenomenon

Unsupervised Discovery and Representation of Subspace Trends in Massive Biomedical Datasets

The goal of this dissertation is to develop unsupervised algorithms for discovering previously unknown subspace trends in massive multivariate biomedical data sets without the benefit of prior information. A subspace trend is a sustained pattern of gradual/progressive changes within an unknown subset of feature dimensions. A fundamental challenge to subspace trend discovery is the presence of irrelevant data dimensions, noise, outliers, and confusion from multiple subspace trends driven by independent factors that are mixed in with each other. These factors can obscure the trends in traditional dimension reduction and projection based data visualizations. To overcome these limitations, we propose a novel graph-theoretic neighborhood similarity measure for sensing concordant progressive changes across data dimensions. Using this measure, we present an unsupervised algorithm for trend-relevant feature selection and visualization. Additionally, we propose to use an efficient online density-based representation to make the algorithm scalable for massive datasets. The representation not only assists in trend discovery, but also in cluster detection including rare populations. Our method has been successfully applied to diverse synthetic and real-world biomedical datasets, such as gene expression microarray and arbor morphology of neurons and microglia in brain tissue. Derived representations revealed biologically meaningful hidden subspace trend(s) that were obscured by irrelevant features and noise. Although our applications are mostly from the biomedical domain, the proposed algorithm is broadly applicable to exploratory analysis of high-dimensional data including visualization, hypothesis generation, knowledge discovery, and prediction in diverse other applications.Electrical and Computer Engineering, Department o