By Topic

Optimal simultaneous detection and estimation of filtered discrete semi-Markov chains

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
$33 $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)
J. Goutsias ; Dept. of Electr. & Comput. Eng., Johns Hopkins Univ., Baltimore, MD, USA ; J. M. Mendel

An optimal algorithm for the detection of noisy filtered discrete semi-Markov chains is presented. Estimation of the underlying model parameters is also considered. For a given path of the discrete semi-Markov chain the optimum estimates of the model parameters obtained by the maximum likelihood method are expressed as functions of the path. These functions are then used to derive a single maximum a posteriori criterion for the optimal detection of the unknown single path. The final optimization is carried out numerically by a combination of gradient, divide-and-conquer, and search techniques. This set of techniques is referred to as the integer most likely search detector. Experimental results, using synthetic data, demonstrate the potential of the algorithm

Published in:

IEEE Transactions on Information Theory  (Volume:34 ,  Issue: 3 )