Method for determining a most likely sequence of states
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
Mar 25, 1997
Grant Date -
N/A
app pub date -
May 5, 1995
filing date -
May 5, 1995
priority date (Note) -
In Force
status (Latency Note)
Importance
Abstract
The number of calculations to determine the most likely path is reduced by eliminating a number of paths that are impossible to provide an optimal result. How to eliminate these non-optimal paths, thus greatly reducing the number of calculations performed by a signal processor. The determination of the probability score of the best path to state s at time t may be found as follows. First, transition probabilities to state s are sorted in order of descending probability. Second, the k highest probability scores at time t-1 are identified. Third, the highest transition probability associated with the k highest probability scores at t-1 is identified and designated maxrank. Fourth, the k highest probability scores at t-1 are multiplied with their associated transition probabilities with the highest product being designated maxvalue. Fifth, all transition probabilities higher than maxrank are multiplied with their associated probability scores at t-1. If the product of one of these multiplications is greater than the current maxvalue, this product becomes the new maxvalue. The final maxvalue is multiplied by an observation probability to determine a most likely path sequence to state s at time-1. K is chosen to be .sqroot.N, where N is the total number of possible states.
First Claim
Family
International Classification(s)
Cited Art Landscape
Patent Citation Ranking
Recipient Email Address
Recipient Email Address
Comment
Recipient Email Address
Add to Portfolio(s)
To add this patent to one, or more, of your portfolios, simply click the add button.
This Patent is in these Portfolios:
Add to additional portfolios:
Last Refreshed On:
Changes done successfully