Universal Filtering via Hidden Markov Modeling

Details Universal Filtering via Hidden Markov Modeling Universal Filtering via Hidden Markov Modeling

2006-05-17

arxiv.org/abs/cs/0605077v1

Computer Science

Information Theory

29 pages

Scientific paper

The problem of discrete universal filtering, in which the components of a discrete signal emitted by an unknown source and corrupted by a known DMC are to be causally estimated, is considered. A family of filters are derived, and are shown to be universally asymptotically optimal in the sense of achieving the optimum filtering performance when the clean signal is stationary, ergodic, and satisfies an additional mild positivity condition. Our schemes are comprised of approximating the noisy signal using a hidden Markov process (HMP) via maximum-likelihood (ML) estimation, followed by the use of the forward recursions for HMP state estimation. It is shown that as the data length increases, and as the number of states in the HMP approximation increases, our family of filters attain the performance of the optimal distribution-dependent filter.

Affiliated with

Also associated with

No associations

Rating

Universal Filtering via Hidden Markov Modeling does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Universal Filtering via Hidden Markov Modeling, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Universal Filtering via Hidden Markov Modeling will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-489544