Robust RLS Wiener Fixed-Lag Smoother for Discrete-Time Stochastic Systems with Uncertain Parameters
Journal Title: Computer Reviews Journal - Year 2019, Vol 4, Issue 0
Abstract
This paper, by combining the robust recursive least-squares (RLS) Wiener filter and the RLS Wiener fixed-lag smoothing algorithm, proposes the robust RLS Wiener fixed-lag smoothing algorithm. In the robust estimation problem, it is assumed that the system and observation matrices include some uncertain parameters. With the observations generated by the state-space model including the uncertain parameters, the robust RLS Wiener fixed-lag smoother estimates the signal recursively as the time advances. Both the signal and the degraded signal processes are fitted to the finite order auto-regressive (AR) models. The robust RLS Wiener fixed-lag smoother uses the following information. (1) The covariance function of the state for the degraded signal. (2) The cross-covariance function of the state for the signal with the state for the degraded signal. (3) The observation matrices for the signal and the degraded signal. (4) The system matrices for the signal and the degraded signal. (5) The variance of the white observation noise. A numerical simulation example shows that the robust RLS Wiener fixed-lag smoother, proposed in this paper, is superior in estimation accuracy to the H-infinity RLS Wiener fixed-point smoother and the RLS Wiener fixed-lag smoother. In the appendix, by using MAXIMA and MATLAB, the derivation method of the coefficients, used in the robust RLS Wiener fixed-lag smoothing algorithm, is shown.
Authors and Affiliations
Seiichi Nakamori
Keywords
Related Articles
- EP ID EP655235
- DOI -
- Views 141
- Downloads 0
Radial Basis Function Neural Networks : A Review
Radial Basis Function neural networks (RBFNNs) represent an attractive alternative to other neural network models. One reason is that they form a unifying link between function approximation, regularization, noisy interp...
Why Estimation Method of Recurrence Time Transition Probabilities with Regard to Genetic Algorithms Without Bit Mutation?
Respecting genetic algorithms without bit mutation, our study is to submit unprecedented algorithm to procure tentative and notional results respecting recurrence time transition probabilities estimation for transient st...
RLS Filter Using Covariance Information and RLS Wiener Type Filter based on Innovation Theory for Linear Discrete-Time Stochastic Descriptor Systems
It is known that the stochastic descriptor systems are transformed into the conventional state equation, the observation equation and the other equation, by using the singular value decomposition. Based on the preliminar...
Efficiency Analysis of Hybrid Fuzzy C-Means Clustering Algorithms and their Application to Compute the Severity of Disease in Plant Leaves
Data clustering has a wide range of application varying from medical image analysis, social network analysis, market segmentation, search engines, recommender systems and image processing. A clustering algorithm should b...
Search Engine Search Engine Search Engine Optimization with Google Search Console
This paper is based on how Google search engine optimization effectively works. And the visibility and quality content of the search engine index page. The keyword feature targeted in this paper is to follow Google quali...