Adaptive path based analysis process

US12423504B1 · US · B1

Patent metadata
FieldValue
Publication numberUS-12423504-B1
Application numberUS-202217894236-A
CountryUS
Kind codeB1
Filing dateAug 24, 2022
Priority dateAug 24, 2022
Publication dateSep 23, 2025
Grant dateSep 23, 2025

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

The present disclosure relates to a system and method for electronic design automation. Embodiments may include loading one or more libraries, netlists, or constraints associated with an electronic design and loading parasitic data associated with the electronic design. Embodiments may further include performing a self adaptive, infinite depth, path based analysis on at least a portion of the electronic design. Embodiments may also include analyzing the electronic design based upon, at least in part, the self adaptive, infinite depth, path based analysis.

First claim

Opening claim text (preview).

The invention claimed is: 1. A computer-implemented method comprising: loading one or more libraries, netlists, or constraints associated with an electronic design; loading parasitic data associated with the electronic design; performing a self adaptive, infinite depth, path based analysis on one or more timing analysis views associated with the electronic design; and analyzing the electronic design based upon, at least in part, the self adaptive, infinite depth, path based analysis, wherein the self adaptive, infinite depth, path based analysis includes an endpoint violation level analysis; and performing a full depth analysis for an endpoint having a high level violation, wherein performing a full depth analysis for an endpoint having a high level violation includes identifying all endpoint violations associated with the electronic design. 2. The computer-implemented method of claim 1 , wherein the self adaptive, infinite depth, path based analysis includes a clock period based identification process. 3. The computer-implemented method of claim 1 , wherein the self adaptive, infinite depth, path based analysis includes an explicit include or explicit exclude user-selectable option or a default. 4. The computer-implemented method of claim 1 , further comprising: determining a plurality of paths for at least one high level violation endpoint. 5. The computer-implemented method of claim 1 , further comprising: generating, using an adaptive learning engine, a self adaptive, infinite depth, path based analysis graph for one or more selective zones, one or more violating zones, one or more zones specific to a specified clock group, a user specified region, or an entire graph. 6. A computer-readable storage medium having stored thereon instructions that when executed by a machine result in the following operations: loading one or more libraries, netlists, or constraints associated with an electronic design; loading parasitic data associated with the electronic design; performing a self adaptive, infinite depth, path based analysis on one or more timing analysis views associated with the electronic design; and analyzing the electronic design based upon, at least in part, the self adaptive, infinite depth, path based analysis, wherein the self adaptive, infinite depth, path based analysis includes an endpoint violation level analysis; and performing a full depth analysis for an endpoint having a high level violation, wherein performing a full depth analysis for an endpoint having a high level violation includes identifying all endpoint violations associated with the electronic design. 7. The computer-readable storage medium of claim 6 , wherein the self adaptive, infinite depth, path based analysis includes a clock period based identification process. 8. The computer-readable storage medium of claim 6 , wherein the self adaptive, infinite depth, path based analysis includes an explicit include or explicit exclude user-selectable option or a default. 9. The computer-readable storage medium of claim 6 , further comprising: determining a plurality of paths for at least one high level violation endpoint. 10. The computer-readable storage medium of claim 6 , further comprising: generating, using an adaptive learning engine, a self adaptive, infinite depth, path based analysis graph for one or more selective zones, one or more violating zones, one or more zones specific to a specified clock group, a user specified region, or an entire graph. 11. A system comprising: a computing device having at least one processor configured to load one or more libraries, netlists, or constraints associated with an electronic design, the at least one processor further configured to load parasitic data associated with the electronic design, the at least one processor further configured to perform a self adaptive, infinite depth, path based analysis on one or more timing analysis views associated with the electronic design and to analyze the electronic design based upon, at least in part, the self adaptive, infinite depth, path based analysis, wherein the self adaptive, infinite depth, path based analysis includes an endpoint violation level analysis, the at least one processor further configured to perform a full depth analysis for an endpoint having a high level violation, wherein performing a full depth analysis for an endpoint having a high level violation includes identifying all endpoint violations associated with the electronic design. 12. The system of claim 11 , wherein the self adaptive, infinite depth, path based analysis includes a clock period based identification process. 13. The system of claim 11 , wherein the self adaptive, infinite depth, path based analysis includes an explicit include or explicit exclude user-selectable option or a default.

Assignees

Inventors

Classifications

  • Timing analysis · CPC title

  • using machine learning, e.g. artificial intelligence, neural networks, support vector machines [SVM] or training a model · CPC title

  • Timing analysis or timing optimisation · CPC title

  • G06F30/398Primary

    Design verification or optimisation, e.g. using design rule check [DRC], layout versus schematics [LVS] or finite element methods [FEM] (optical proximity correction [OPC] design processes G03F1/36) · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US12423504B1 cover?
The present disclosure relates to a system and method for electronic design automation. Embodiments may include loading one or more libraries, netlists, or constraints associated with an electronic design and loading parasitic data associated with the electronic design. Embodiments may further include performing a self adaptive, infinite depth, path based analysis on at least a portion of the e…
Who is the assignee on this patent?
Cadence Design Systems Inc
What technology area does this patent fall under?
Primary CPC classification G06F30/398. Mapped technology areas include Physics.
When was this patent published?
Publication date Tue Sep 23 2025 00:00:00 GMT+0000 (Coordinated Universal Time) (B1). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 3 related publications on this page (citations in our corpus or others sharing the same primary CPC).