EFFICIENT REPRESENTATION OF STATE TRANSITION TABLES
摘要
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.
申请公布号
WO2004107111(A2)
申请公布日期
2004.12.09
申请号
WO2004US15943
申请日期
2004.05.21
申请人
SENSORY NETWORKS, INC.;GOULD, STEPHEN;BARRIE, ROBERT, MATTHEW;FLANAGAN, MICHAEL;WILLIAMS, DARREN
发明人
GOULD, STEPHEN;BARRIE, ROBERT, MATTHEW;FLANAGAN, MICHAEL;WILLIAMS, DARREN