Sequence estimating
AssigneeVanu, Inc.
InventorsJon Feldman, Ibrahim Abou-Faycal
Life of this patent
Estimating the term…
Abstract
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.
Claims30
A computerized method for sequence estimating, comprising:
- generating a dynamic programming table, the dynamic programming table representing a trellis, the trellis including a set of time steps, each time step having a set of states, the trellis also including a plurality of branches connecting the states;
- expanding a search along the branches having a least accumulated error;
- inserting a pointer into a priority queue, the pointer indicating 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.
Apparatus for sequence estimating, comprising:
- a memory that stores executable instruction signals;
- and
- a processor that executes the instruction signals to:
- generate a dynamic programming table, the dynamic programming table representing a trellis, the trellis including a set of time steps, each time step having a set of states, the trellis also including a plurality of branches connecting the states;
- expand a search along the branches having a least accumulated error;
- insert a pointer into a priority queue, the pointer indicating an end of a partially completed path within the trellis;
- search other branches when the accumulated error is no longer the least accumulated error;
- and
- expand the search until the time step equals a current time.
An article comprising a machine-readable medium that stores executable instruction signals for sequence estimating, the instruction signals causing a machine to:
- generate a dynamic programming table, the dynamic programming table representing a trellis, the trellis including a set of time steps, each time step having a set of states, the trellis also including a plurality of branches connecting the states;
- expand a search along the branches having a least accumulated error;
- insert a pointer into a priority queue, the pointer indicating an end of a partially completed path within the trellis;
- search other branches when the accumulated error is no longer the least accumulated error;
- and
- expand the search until the time step equals a current time.
Dependencies are inferred from the claim text.