Methods and systems for a circuit similarity metric for semiconductor testsite coverage. One or more unique values for each of a set of measures for each circuit layout of a plurality of circuit layouts are identified and a pairwise comparison across the set of measures is conducted for a selected pair of the plurality of circuit layouts to derive a similarity score for the selected pair of circuit layouts. The similarity score is incremented for the selected pair in response to the selected pair of circuit layouts sharing a same unique value and the similarity score is decremented for the selected pair in response to one circuit layout of the selected pair of circuit layouts having a unique value that the other circuit layout of the selected pair does not contain.
Legal claims defining the scope of protection, as filed with the USPTO.
1. A method, implemented at least in part on a computer, comprising: identifying one or more unique values for each of a set of measures for each circuit layout of a plurality of circuit layouts; conducting a pairwise comparison across the set of measures for a selected pair of the plurality of circuit layouts to derive a similarity score for the selected pair of circuit layouts; performing at least one action in response to the conducting the pairwise comparison, the action being one of incrementing the similarity score for the selected pair, decrementing the similarity score for the selected pair, and maintaining the similarity score for the selected pair; repeating the identifying, conducting, and performing operations for each unique pair of circuit layouts of the plurality of circuit layouts; and substituting an alternative circuit layout for a given circuit layout in a testsite based on the similarity score.
2. The method of claim 1 , further comprising creating a similarity matrix of similarity scores across all circuit layouts of the plurality of circuit layouts.
3. The method of claim 2 , further comprising obtaining a list of exclusion circuit layouts and determining a list of alternative circuit layouts based on the similarity matrix.
4. The method of claim 3 , further comprising pruning the list of alternative circuit layouts using at least one of: a greedy or heuristic algorithm; and dynamic programming to generate a representative set of circuit layouts.
5. The method of claim 1 , further comprising computing a coverage metric using a selected set of circuit layouts.
6. The method of claim 5 , further comprising adding a circuit layout to the selected set of circuit layouts until a coverage goal is satisfied or an iteration limit is reached.
7. The method of claim 5 , further comprising adding a circuit layout to the selected set of circuit layouts, wherein the added circuit layout covers at least one unique value not covered by any circuit layout in the selected set of circuit layouts.
8. The method of claim 1 , further comprising improving computing performance of a computer performing electronic design automation by reducing computational complexity in determining test site coverage, by identifying a circuit layout of the plurality of circuit layouts that is similar to a given circuit layout by conducting the pairwise comparison across the set of measures and deriving the similarity score using one or more of the unique values.
9. The method of claim 1 , further comprising: instantiating at least one of the plurality of circuit layouts as a design structure; and fabricating a physical integrated circuit in accordance with the design structure.
10. The method of claim 1 , wherein the incrementing the similarity score for the selected pair is performed in response to the selected pair of circuit layouts sharing a same unique value and the decrementing the similarity score for the selected pair is performed in response to one circuit layout of the selected pair of circuit layouts having a unique value that the other circuit layout of the selected pair does not contain.
11. A computer comprising: a memory; and at least one processor, coupled to said memory, and operative to perform operations comprising: identifying one or more unique values for each of a set of measures for each circuit layout of a plurality of circuit layouts; conducting a pairwise comparison across the set of measures for a selected pair of the plurality of circuit layouts to derive a similarity score for the selected pair of circuit layouts; performing at least one action in response to the conducting the pairwise comparison, the action being one of incrementing the similarity score for the selected pair, decrementing the similarity score for the selected pair, and maintaining the similarity score for the selected pair; repeating the identifying, conducting, and performing operations for each unique pair of circuit layouts of the plurality of circuit layouts; and substituting an alternative circuit layout for a given circuit layout based on the similarity score.
12. The computer of claim 11 , wherein the at least one processor is further operative to create a similarity matrix of similarity scores across all circuit layouts of the plurality of circuit layouts.
13. The computer of claim 12 , wherein the at least one processor is further operative to obtain a list of exclusion circuit layouts and determining a list of alternative circuit layouts based on the similarity matrix.
14. The computer of claim 13 , wherein the at least one processor is further operative to prune the list of alternative circuit layouts using at least one of: a greedy or heuristic algorithm; and dynamic programming to generate a representative set of circuit layouts.
15. The computer of claim 11 , wherein the at least one processor is further operative to compute a coverage metric using a selected set of circuit layouts.
16. The computer of claim 15 , wherein the at least one processor is further operative to add a circuit layout to the selected set of circuit layouts until a coverage goal is satisfied or an iteration limit is reached.
17. The method of claim 15 , the operations further comprising adding a circuit layout to the selected set of circuit layouts, wherein the added circuit layout covers at least one unique value not covered by any circuit layout in the selected set of circuit layouts.
18. The method of claim 11 , the operations further comprising improving a computing performance, a computer performing electronic design automation by reducing computational complexity in determining test site coverage, by identifying a circuit layout of the plurality of circuit layouts that is similar to a given circuit layout by conducting the pairwise comparison across the set of measures and deriving the similarity score using one or more of the unique values.
19. The method of claim 11 , the operations further comprising: instantiating at least one of the plurality of circuit layouts as a design structure; and fabricating a physical integrated circuit in accordance with the design structure.
20. A non-transitory computer readable medium comprising computer executable instructions which when executed by a computer performing electronic design analysis cause the computer to perform a method which improves the performance of the computer, the method comprising operations of: identifying one or more unique values for each of a set of measures for each circuit layout of a plurality of circuit layouts; conducting a pairwise comparison across the set of measures for a selected pair of the plurality of circuit layouts to derive a similarity score for the selected pair of circuit layouts; performing at least one action in response to the conducting the pairwise comparison, the action being one of incrementing the similarity score for the selected pair, decrementing the similarity score for the selected pair, and maintaining the similarity score for the selected pair; repeating the identifying, conducting, and performing operations for each unique pair of circuit layouts of the plurality of circuit layouts; and substituting an alternative circuit layout for a given circuit layout based on the similarity score.
Cooperative Patent Classification codes for this invention. Click any code to explore related patents in that topic.
May 14, 2019
November 17, 2020
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.