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 129
- Downloads 0
Experimental Evaluation Platform for Voice Transmission Over Internet of Things (VoIoTs)
Internet of Things (IoTs) is an example of the last advances in Information and Communication Technologies. In particular, with the revolutionary development of Wireless Sensor Network (WSN) technologies, researchers lar...
Why Estimation Algorithm of First Passage Time Transition Probabilities Concerns Genetic Algorithms Without Bit Mutation?
Concerning genetic algorithm without bit mutation such as absorbing Markov Chain, our aim is proposition modern algorithm to secure experiential and impractical results concerning first passage time transition probabilit...
Micro Finance Development Though WSHGs: A study of Odisha Tegion
In measuring satisfaction, it was estimated that, even though the model fit looks positive, the significant predictor i.e. age factor, which is actually contribute a more towards satisfaction, because it shown a high sta...
The Energy Efficient FIR Filter for Biomedical Application using FPGA
This research work proposes a low power Finite Impulse Response (FIR) digital filter system using Field Programmable Gate Array (FPGA) to filter biomedical signals. A major issue regarding such implementations is associa...
Collaborative and Adaptive Framework for Telediagnosis and Prescriptions in Herbal Medicine
Herbal medicine has been an age long tradition for the treatment and cure of diseases globally. Previous researches on telediagnosis and prescriptions in orthodox medicine studied applications of modern technological dev...