Cart (Loading....) | Create Account
Close category search window
 

Recursive filtering and smoothing for discrete index gaussian reciprocal processes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Vats, D. ; Dept. of Electr. & Comput. Eng., Carnegie Mellon Univ., Pittsburgh, PA ; Moura, J.M.F.

We study minimum mean square error (MMSE) estimation problems for discrete index Gaussian reciprocal processes (Grp's) (or boundary valued processes) with Dirichlet boundary conditions. Our contributions are: 1) deriving first order white noise driven representations from second order correlated noise driven representations; 2) deriving Kalman like recursive filtering equations for discrete index Grp's; and 3) deriving recursive smoothing equations for discrete index Grp's. Unlike previous work, our approach uses forward and backwards recursive representations for the Grp and leads to lower dimensional recursive filters and smoothers.

Published in:

Information Sciences and Systems, 2009. CISS 2009. 43rd Annual Conference on

Date of Conference:

18-20 March 2009

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.