System and method for integrated circuit planar netlist interpretation
Systems and methods for integrated circuit planar netlist interpretation are disclosed. In one embodiment, higher abstraction level descriptions of an integrated circuit are generated from a planar netlist and layout data of the integrated circuit. Various embodiments may derive the higher abstraction levels through, for example, netlist compression and netlist partitioning. Other embodiments may derive the higher abstraction levels using, for example, device and module hypothesis search functions based on device properties and design constraints derived from netlist and layout data.
1. A method for planar netlist interpretation of an integrated circuit, the method comprising:
reading the planar netlist of the integrated circuit from a first computer-readable medium, wherein the planar netlist comprises atomic elements of the integrated circuit and nodes between the atomic elements;
converting, using a computer system, the planar netlist into a graphical description, wherein graph vertices represent the atomic elements, the nodes, or both, and wherein graph edges represent the nodes, the atomic elements, or connections between the atomic elements and the nodes, respectively;
identifying, using the computer system, combinations of the vertices and edges that match library device elements;
substituting, using the computer system, the device elements for the respective combinations of the vertices and edges;
generating, using the computer system, a compressed netlist comprising the device elements and nodes between the device elements; and
storing the compressed netlist in a second computer-readable medium.
2. The method of claim 1 , wherein:
the identifying further comprises
determining vertex labels for the atomic elements, wherein the vertex labels comprise element type and distance to nearby atomic elements, and
identifying identical vertex labels in the graphical description; and
the substituting further comprises combining the identical vertex labels into combined vertices and assigning new labels to the combined vertices.
3. The method of claim 2 , wherein the steps of determining vertex labels, identifying identical vertex labels, and combining the identical vertex labels are repeated for the combined vertices with the new labels.
4. The method of claim 1 , further comprising, before the reading the planar netlist:
generating the planar netlist from layout information extracted from images of successive layers of the integrated circuit; and
storing the planar netlist on the first computer-readable medium.
5. The method of claim 1 , wherein the device elements comprise gate-level elements.
6. The method of claim 1 , wherein the compressed netlist is stored in a token-based object oriented language format.
7. The method of claim 6 , further comprising, after the storing the compressed netlist:
comparing a patent claim stored in the token-based object oriented language format to elements in the compressed netlist; and
generating an indication if there is a match between the patent claim and any of the elements in the compressed netlist.
8. The method of claim 1 , wherein the second computer-readable medium is the first computer-readable medium.
9. The method of claim 1 , further comprising using one or more of netlist partitioning and hypothesis search functions to generate a hierarchical netlist from the compressed netlist.
10. A computer program product for performing integrated circuit planar netlist interpretation, the computer program product having a non-transitory computer-readable medium with a computer program embodied thereon, the computer program comprising:
computer program code for reading the planar netlist of the integrated circuit from a first computer-readable medium, wherein the planar netlist comprises atomic elements of the integrated circuit and nodes between the atomic elements;
computer program code for converting the planar netlist into a graphical description, wherein graph vertices represent the atomic elements, the nodes, or both, and wherein graph edges represent the nodes, the atomic elements, or connections between the atomic elements and the nodes, respectively;
computer program code for identifying combinations of the vertices and edges that match library device elements;
computer program code for substituting the device elements for the respective combinations of the vertices and edges;
computer program code for generating a compressed netlist comprising the device elements and nodes between the device elements; and
computer program code for storing the compressed netlist in a second computer-readable medium.
11. The computer program product of claim 10 , wherein:
the computer program code for identifying further comprises
computer program code for determining vertex labels for the atomic elements, wherein the vertex labels comprise element type and distance to nearby atomic elements, and
computer program code for identifying identical vertex labels in the graphical description; and
the computer program code for substituting further comprises computer program code for combining the identical vertex labels into combined vertices and assigning new labels to the combined vertices.
12. The computer program product of claim 11 , further comprising computer program code for repeating the computer program code for determining vertex labels, the computer program code for identifying identical vertex labels, and the computer program code for combining the identical vertex labels, for the combined vertices with the new labels.
13. The computer program product of claim 10 , further comprising:
computer program code for generating the planar netlist from layout information extracted from images of successive layers of the integrated circuit; and
computer program code for storing the planar netlist on the first computer-readable medium from which the computer program code for reading the planar netlist reads the planar netlist.
14. The computer program product of claim 10 , wherein the device elements comprise gate-level elements.
15. The computer program product of claim 10 , further comprising computer program code for storing the compressed netlist in a token-based object oriented language format.
16. The computer program product of claim 15 , further comprising:
computer program code for comparing a patent claim stored in the token-based object oriented language format to elements in the compressed netlist; and
computer program code for generating an indication if there is a match between the patent claim and any of the elements in the compressed netlist.
17. The computer program product of claim 10 , wherein the second computer-readable medium is the first computer-readable medium.
18. The computer program product of claim 10 , further comprising computer program code for using one or more of netlist partitioning and hypothesis search functions to generate a hierarchical netlist from the compressed netlist.
19. A computer system comprising:
memory for storing programs, the programs including sequences of instructions;
a data processing unit for executing the programs stored in the memory;
wherein one of the programs stored in the memory is an integrated circuit planar netlist interpretation program, the integrated circuit planar netlist interpretation program including
instructions for reading the planar netlist of the integrated circuit from a first computer-readable medium, wherein the planar netlist comprises atomic elements of the integrated circuit and nodes between the atomic elements;
instructions for converting the planar netlist into a graphical description, wherein graph vertices represent the atomic elements, the nodes, or both, and wherein graph edges represent the nodes, the atomic elements, or connections between the atomic elements and the nodes, respectively;
instructions for identifying combinations of the vertices and edges that match library device elements;
instructions for substituting the device elements for the respective combinations of the vertices and edges;
instructions for generating a compressed netlist comprising the device elements and nodes between the device elements; and
instructions for storing the compressed netlist in a second computer-readable medium.
20. The computer system of claim 19 , wherein:
the instructions for identifying further comprises
instructions for determining vertex labels for the atomic elements, wherein the vertex labels comprise element type and distance to nearby atomic elements, and
instructions for identifying identical vertex labels in the graphical description; and
the instructions for substituting further comprises instructions for combining the identical vertex labels into combined vertices and assigning new labels to the combined vertices.
21. The computer system of claim 20 , further comprising instructions for repeating the instructions for determining vertex labels, the instructions for identifying identical vertex labels, and the instructions for combining the identical vertex labels, for the combined vertices with the new labels.
22. The computer system of claim 19 , further comprising:
instructions for generating the planar netlist from layout information extracted from images of successive layers of the integrated circuit; and
instructions for storing the planar netlist on the first computer-readable medium from which the instructions for reading the planar netlist reads the planar netlist.
23. The computer system of claim 19 , wherein the device elements comprise gate-level elements.
24. The computer system of claim 19 , further comprising instructions for storing the compressed netlist in a token-based object oriented language format.
25. The computer system of claim 24 , further comprising:
instructions for comparing a patent claim stored in the token-based object oriented language format to elements in the compressed netlist; and
instructions for generating an indication if there is a match between the patent claim and any of the elements in the compressed netlist.
26. The computer system of claim 19 , wherein the second computer-readable medium is the first computer-readable medium.
27. The computer system of claim 19 , further comprising instructions for using one or more of netlist partitioning and hypothesis search functions to generate a hierarchical netlist from the compressed netlist.