| 摘要 |
In one aspect the invention is a method for sequence estimating. The method includes generating a dynamic programming table, which represents a trellis. The trellis includes a set of time steps, which have a set of states. The trellis also includes a number of branches that connect the states. The method also includes expanding a search along the branches having a least accumulated error, inserting a pointer into a priority queue, where the pointer indicates an end of a partially completed path within the trellis, searching other branches when the accumulated error is no longer the least accumulated error, and continuing the search until the time step equals a current time.
|
