Efficient representation of state transition tables
US7411418B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | May 21, 2004 |
| Grant date | Aug 12, 2008 |
| Priority date | — |
| Expiry date | Jun 7, 2026 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F9/4498
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
The states associated with a programmable state machine are reordered to compress the storage of transitions which define the state machine. To reorder the states, a score is computed and assigned to each of the states. Next, the states are sorted according to their computed scores. In some embodiments, to compute the score for each current state based on the received input symbol, the number of times that the input symbol causes transition to similar states is added. The sum of the scores in each row of the table is representative of the score for the associated current state associated with that row. The states are sorted according to their score and a new state transition table is generated in accordance with the reordered states.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.