PATENT CLAIM ANALYSIS

Application Number: 16033824
Application Type: Utility
Filing Date: 2018-07
Publication Date: 2018-11
Patent Classification: ["716", "132000"]

Abstract:
A method and system for optimizing state assignments for a finite state machine. The method generates a random initial state assignment for each of a plurality of states of the finite state machine, determines an initial cost associated with the random initial state assignments, identifies a code swap to explore as a function of a code swap probability. Further, the method calculates a cost for the code swap when one or more criteria is satisfied, updates the code swap probability as a function of the cost of the code swap and a best cost, performs the code swap when the cost of the swap is smaller than the best cost and/or a current cost to optimize the state assignments, and outputs optimized state assignments.

Claim (Index 1):
A method for optimizing state assignments for a finite state machine, the method comprising:\n generating, with a probabilistic pairwise swap search, a random initial state assignment for each of a plurality of states of the finite state machine; determining, using processing circuitry, an initial cost associated with the random initial state assignments; identifying, using the processing circuitry, a code swap to explore as a function of a code swap probability; calculating a cost for the code swap when one or more criteria is satisfied, the one or more criteria include one or more of an indication of whether the code swap has not been explored in a current round, a solution associated with the code swap was not previously generated, a round is not repeated wherein the round is an iteration where all pairs of code swaps are considered, and a maximum predetermined number of code swaps by round is not exceeded, the maximum predetermined number of code swaps by round being a function of a number of hill climbs taken in a period, the period starting when a current solution does not improve after finishing a round and ending when a best solution is found; updating, using the processing circuitry, the code swap probability as a function of the cost of the code swap and a best cost; performing the code swap, when the cost of the swap is smaller than the best cost and/or a current cost, to optimize the state assignments; outputting optimized state assignments; and implementing a physical circuit including one or more flip flops based on the optimized state assignments.

Metadata:
- Claim Count in Document: 1.0
- Percentile: 95.0
- Lexical Diversity: 2.41818
- Patent Class: 716.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: False
- Related Applications: ['15216302', '16033856', '09488171', '10979353', '13270218']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.3304294747783552
- 35 USC 102 Novelty (BERT): 0.5049954584215844
- Combined Prediction Score: 0.3478860731426781
- Mean Citation Score: 214.0778922
- Max Citation Score: 349.05002
- Similarity Product: 341.8832791957188

Labels:
- Claim Label 101: 1
- Claim Label 102: 1
- Claim Label 103: 1
- Claim Label 112: 1
- Combined Label: 1
- Label 101 Adjusted: 1

Dataset: test