Automatic compilation method and framework for generating a layout of integrated memory-compute circuit
US-2024403527-A1 · Dec 5, 2024 · US
US9977851B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9977851-B2 |
| Application number | US-201715814447-A |
| Country | US |
| Kind code | B2 |
| Filing date | Nov 16, 2017 |
| Priority date | Aug 11, 2016 |
| Publication date | May 22, 2018 |
| Grant date | May 22, 2018 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
Examples of techniques for automated attribute propagation and hierarchical consistency checking are disclosed. In one example implementation according to aspects of the present disclosure, a computer-implemented method may include: detecting, by a processor, a non-standard extension during convergence of an integrated circuit logic design; propagating, by the processor, the non-standard extension to each level of a plurality of hierarchies of the integrated circuit design for which a net utilizes a special constraint; and verifying, by the processor, a hierarchy consistency across each level of the plurality of hierarchies.
Opening claim text (preview).
What is claimed is: 1. A system for automated attribute propagation and hierarchical consistency checking, the system comprising: a memory having computer readable instructions; and a processing device for executing the computer readable instructions, the computer readable instructions comprising: detecting a non-standard extension during convergence of an integrated circuit logic design; propagating the non-standard extension to each level of a plurality of hierarchies of the integrated circuit design for which a net utilizes a special constraint; and verifying a hierarchy consistency by checking the attribute propagation at each level of the plurality of hierarchies, performing an open access checking, and performing a post-layout netlist checking, and wherein an integrated circuit is manufactured using the integrated circuit design. 2. The system of claim 1 , wherein detecting a non-standard extension comprises a logic designer adding a NOBUFFER attribute to a voltage sense line in the integrated circuit design. 3. The system of claim 1 , wherein propagating the non-standard extension further comprises saving the non-standard extension into a file. 4. The system of claim 1 , wherein performing the post-layout netlist checking ensures that a buffering tool did not add any additional buffers to the physical design for the integrated circuit. 5. The system of claim 4 , wherein the buffering tool comprises at least one of a buffering tool, a timing tool, and a delay tool. 6. The system of claim 1 , wherein the special constraint comprises a noise requirement. 7. The system of claim 1 , wherein the special constraint comprises a timing requirement. 8. The system of claim 1 , wherein the special constraint comprises a static voltage requirement. 9. The system of claim 1 , wherein the special constraint comprises a transient voltage requirement. 10. A computer program product for automated attribute propagation and hierarchical consistency checking, the computer program product comprising: a non-transitory computer readable storage medium having program instructions embodied therewith, the program instructions executable by a processing device to cause the processing device to: detect a non-standard extension during convergence of an integrated circuit logic design; propagate the non-standard extension to each level of a plurality of hierarchies of the integrated circuit design for which a net utilizes a special constraint; and verify a hierarchy consistency by checking the attribute propagation at each level of the plurality of hierarchies, performing an open access checking, and performing a post-layout netlist checking, and wherein an integrated circuit is manufactured using the integrated circuit design. 11. The computer program product of claim 10 , wherein detecting a non-standard extension comprises a logic designer adding a NOBUFFER attribute to a voltage sense line in the integrated circuit design. 12. The computer program product of claim 10 , wherein propagating the non-standard extension further comprises saving the non-standard extension into a file. 13. The computer program product of claim 10 , wherein the special constraint comprises a noise requirement. 14. The computer program product of claim 10 , wherein the special constraint comprises a timing requirement. 15. The computer program product of claim 10 , wherein the special constraint comprises a static voltage requirement. 16. The computer program product of claim 10 , wherein the special constraint comprises a transient voltage requirement. 17. The computer program product of claim 10 , wherein the special constraint comprises a noise requirement, a static voltage requirement, a transient voltage requirement, and a timing requirement.
Circuit design · CPC title
Design verification, e.g. using simulation, simulation program with integrated circuit emphasis [SPICE], direct methods or relaxation methods · CPC title
using formal methods, e.g. equivalence checking or property checking · CPC title
Physics · mapped topic
Related publications grouped by family.
Answers are generated from the same data shown on this page.