Fixed-Lag Smoothing Algorithm under Non-independent Uncertainty

Seiichi NAKAMORI
Aurora HERMOSO-CARAZO
Josefa LINARES-PEREZ

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E88-A    No.4    pp.988-995
Publication Date: 2005/04/01
Online ISSN: 
DOI: 10.1093/ietfec/e88-a.4.988
Print ISSN: 0916-8508
Type of Manuscript: PAPER
Category: Digital Signal Processing
Keyword: 
filtering,  fixed-lag smoothing,  covariance information,  uncertain observations,  

Full Text: PDF(478.6KB)>>
Buy this Article


Summary: 
This paper discusses the least-squares linear filtering and fixed-lag smoothing problems of discrete-time signals from uncertain observations when the random interruptions in the observation process are modelled by a sequence of not necessarily independent Bernoulli variables. It is assumed that the observations are perturbed by white noise and the autocovariance function of the signal is factorizable. Using an innovation approach we obtain the filtering and fixed-lag smoothing recursive algorithms, which do not require the knowledge of the state-space model generating the signal. Besides the observed values, they use only the matrix functions defining the factorizable autocovariance function of the signal, the noise autocovariance function, the marginal probabilities and the (2,2)-element of the conditional probability matrices of the Bernoulli variables. The algorithms are applied to estimate a scalar signal which may be transmitted through one of two channels.