PATENT CLAIM ANALYSIS

Application Number: 15896176
Application Type: Utility
Filing Date: 2018-02
Publication Date: 2018-12
Patent Classification: ["716", "114000"]

Abstract:
Optimizing timing in a VLSI circuit by generating a set of buffer solutions and determining a most critical delay and a sum of critical delays for each solution in the set of solutions. Quantifying a relationship between the most critical delay and the sum of critical delays for each solution. Comparing each solution's quantified relationship to the quantified relationship of each other solution in the set of solutions. Identifying, based on the comparing of each solution's relationship to the relationship of each other solution in the set of solutions, at least one solution in the set of solutions to have a worse relationship between the most critical delay and the sum of critical delays than the other solutions in the set of solutions. Pruning the at least one solution from the set of solutions.

Claim (Index 1):
A method for optimizing timing in a very large scale integrated (VLSI) circuit comprising:\n traversing a VLSI circuit, the circuit comprising a source, at least one sink, and one or more nodes, each node having a required time and an arrival time, wherein a difference between a node's required time and the node's arrival time is the node's slack, wherein a negative slack value is a delay; generating, according to the traversing, a set of buffer solutions for the VLSI circuit; determining a load cap, a buffer cost, a most critical delay, and a sum of delays for each solution in the set of solutions, the most critical delay for each solution found by calculating the delay at each node and identifying the node with the largest delay, the sum of delays for a solution found by taking a measurement, from the sink to the source, of each delay in the solution; quantifying, for each solution, a relationship between the most critical delay and the sum of delays by calculating a p-norm of the sum of delays; characterizing each solution according to the solution's load cap, buffer cost, and relationship; comparing each solution's characterization to the characterization of each other solution in the set of solutions; identifying, based on the comparing, at least one solution in the set of solutions to have a worse characterization than the other solutions in the set of solutions, wherein a solution has a worse characterization if the solution has:\n a load cap with a lower value than at least one other solution of the set of solutions; \n a buffer cost with a higher value that at least one other solution of the set of solutions; and \n a p-norm of the sum of delays that has a higher value than a p-norm of the sum of delays of at least one other solution of the set of solutions; \n pruning the at least one solution from the set of solutions; iteratively performing the steps of comparing solution's characterizations, identifying at least one solution with a worst characterization, and pruning the at least one solution until a target number of solutions remains; the target number of solutions determined according to a set of design parameters; submitting at least one remaining solution to an integrated circuit design process; displaying the at least one submitted solution on a user interface.

Metadata:
- Claim Count in Document: 1.0
- Percentile: 88.0
- Lexical Diversity: 3.17778
- Patent Class: 716.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: False
- Related Applications: ['15848053', '15630343', '10255469', '11938824', '12964126']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.3312075988175508
- 35 USC 102 Novelty (BERT): 0.5001788747728768
- Combined Prediction Score: 0.3481047264130835
- Mean Citation Score: 202.069936
- Max Citation Score: 320.41153
- Similarity Product: 251.0871090549612

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

Dataset: test