IP Library Granted Patent US 12,217,151
Granted Patent B2
US 12,217,151 · App. 18/295,145 · Granted Feb 4, 2025

Layout parasitics and device parameter prediction using graph neural networks

Inventors: Haoxing Ren (Austin, TX); George Ferenc Kokai (Roseville, CA); Ting Ku (San Jose, CA); Walker Joseph Turner (Jacksonville, FL)
Assignee: NVIDIA Corp.
G06N3/045G06F16/9024G06F17/16
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,217,151
App. No.
18/295,145
Granted
Feb 4, 2025
Kind
B2
Abstract

A graph neural network to predict net parasitics and device parameters by transforming circuit schematics into heterogeneous graphs and performing predictions on the graphs. The system may achieve an improved prediction rate and reduce simulation errors.

Claims (34)

1. A system comprising:

at least one graph neural network;

graph generation logic configured to transform a circuit netlist into a graph; and embedding logic configured to generate a node embedding for the graph in the at least one graph neural network, the node embedding formed by concatenating previously generated node embeddings with aggregated neighbor embeddings, the node embedding configured with different edge types of the graph grouped independently for processing by different attention layers of the at least one graph neural network, wherein the at least one graph neural network is configured to transform edges of the graph into parasitic resistance predictions for the circuit netlist.

2. The system of claim 1 , further comprising:

a plurality of graph neural networks each configured to transform the node embeddings into a different range of parasitic prediction values for the circuit netlist.

3. The system of claim 2 , wherein each of the plurality of graph neural networks are configured to form a node embedding for a next network layer by applying weights of the next network layer to a unified vector generated by combining outputs of the attention layers.

4. The system of claim 2 , wherein the parasitic prediction values are capacitive parasitic predictions.

5. The system of claim 3 , wherein the ranges have a common base level.

6. The system of claim 1 , wherein the at least one graph neural network is configured to transform the graph into parasitic predictions and device parameter predictions for the circuit netlist.

7. The system of claim 6 , further comprising:

a circuit simulator configured to receive the parasitic predictions and the device parameter predictions from the at least one graph neural network.

8. The system of claim 1 , wherein the graph comprises:

device nodes and net nodes; and

a plurality of heterogeneous edge types between the device nodes and the net nodes.

9. The system of claim 8 , wherein the heterogeneous edge types comprise net to transistor drain edges, net to transistor gate edges, transistor drain to net edges, and transistor gate to net edges.

10. The system of claim 8 , wherein:

the graph excludes edges between the device nodes and power rails and between the device nodes and ground rails.

11. The system of claim 1 , wherein:

the embedding logic is configured to sum vectors for groups of multiple edges of the graph into individually weighted vectors;

the at least one graph neural network is configured to:

apply a self-attention layer separately to the individually weighted vectors for each group; and

combine outputs of the self-attention layers for groups representing a same edge type into an output vector.

12. A circuit simulator comprising:

a graphics processing unit;

at least one graph neural network;

a non-transitory machine-readable media comprising instructions that, when applied to the graphics processing unit: generate a node embedding in a graph neural network for a graph representing a circuit, the node embedding formed by concatenating previously generated node embeddings with aggregated neighbor embeddings, the node embeddings configured with different edge types of the graph grouped independently for processing by different attention layers of the graph neural network; and operate the at least one graph neural network to transform edges of the graph into parasitic predictions for the circuit, wherein the instructions, when applied to the graphics processing unit, operate the at least one graph neural network to transform edges of the graph into parasitic resistance predictions for the circuit.

13. The circuit simulator of claim 12 , wherein the instructions, when applied to the graphics processing unit, operate a plurality of graph neural networks to transform the node embeddings into a plurality of different ranges of parasitic prediction values for the circuit.

14. The circuit simulator of claim 13 , wherein the parasitic prediction values are capacitive parasitic predictions.

15. The circuit simulator of claim 13 , wherein the ranges have a common base level.

16. The circuit simulator of claim 12 , wherein the instructions, when applied to the graphics processing unit, operate the at last one graph neural network to transform the graph into parasitic predictions and device parameter predictions for the circuit.

17. The circuit simulator of claim 12 , wherein the graph comprises:

transistor device nodes and net nodes; and

a plurality of heterogeneous edge types between the transistor device nodes and the net nodes.

18. The circuit simulator of claim 17 , wherein the heterogeneous edge types comprise net to transistor drain edges, net to transistor gate edges, transistor drain to net edges, and transistor gate to net edges.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 12, 2023
From: REN, HAOXING; KOKAI, GEORGE FERENC; KU, TING; TURNER, WALKER JOSEPH
To: NVIDIA CORP.
Reel/Frame 064232/0917 →
Continuity (3)
Continuation 16859585 · Apr 27, 2020
Provisional Application 62941391 · Nov 27, 2019
Related Publication 20230237313A1 · Jul 27, 2023
References Cited (51)
US 5045804A · Sugawara et al. · 1991 [cited by applicant]
US 5600187A · El-Hamamsy et al. · 1997 [cited by applicant]
US 6269763B1 · Woodland · 2001 [cited by applicant]
US 6275395B1 · Inn et al. · 2001 [cited by applicant]
US 6281731B1 · Fifield et al. · 2001 [cited by applicant]
US 6414519B1 · Abernathy · 2002 [cited by applicant]
US 6498751B2 · Ordonez et al. · 2002 [cited by applicant]
US 8816748B2 · Kumar et al. · 2014 [cited by applicant]
US 9024678B2 · Cavalotto et al. · 2015 [cited by applicant]
US 9135453B2 · Shen-Orr et al. · 2015 [cited by applicant]
US 9158316B2 · Theiler · 2015 [cited by applicant]
US 9509707B2 · Patne · 2016 [cited by examiner]
US 9721093B2 · Poornachandran et al. · 2017 [cited by applicant]
US 9755822B2 · Han et al. · 2017 [cited by applicant]
US 9774614B2 · Patne · 2017 [cited by examiner]
US 9787171B2 · Fort · 2017 [cited by applicant]
US 9812954B1 · Kose · 2017 [cited by examiner]
US 9891639B2 · Fort et al. · 2018 [cited by applicant]
US 9970986B2 · Hampel et al. · 2018 [cited by applicant]
US 10042380B1 · Hung et al. · 2018 [cited by applicant]
US 10389519B2 · Cheng et al. · 2019 [cited by applicant]
US 10423207B2 · Reed · 2019 [cited by examiner]
US 10958414B2 · Stark · 2021 [cited by applicant]
US 11227190B1 · Li · 2022 [cited by examiner]
US 11283349B2 · Kudva et al. · 2022 [cited by applicant]
US 11348000B1 · Ding · 2022 [cited by examiner]
US 20050275464A1 · Filoramo et al. · 2005 [cited by applicant]
US 20070094623A1 · Chen · 2007 [cited by examiner]
US 20160190988A1 · Lin et al. · 2016 [cited by applicant]
US 20180006638A1 · Chen et al. · 2018 [cited by applicant]
US 20190007223A1 · Vaidya et al. · 2019 [cited by applicant]
US 20190121928A1 · Wu · 2019 [cited by examiner]
US 20200137083A1 · Chen · 2020 [cited by examiner]
US 20200151288A1 · Ma · 2020 [cited by examiner]
US 20200210805A1 · Drozdowski · 2020 [cited by examiner]
US 20200302250A1 · Chu · 2020 [cited by examiner]
US 20200327417A1 · Xie · 2020 [cited by examiner]
US 20200337648A1 · Saripalli · 2020 [cited by examiner]
US 20200410337A1 · Huang · 2020 [cited by examiner]
US 20210326389A1 · Sankar · 2021 [cited by examiner]
US 20210334411A1 · Nedovic et al. · 2021 [cited by applicant]
US 20220004875A1 · Koike-Akino · 2022 [cited by examiner]
US 20220027546A1 · Ren · 2022 [cited by examiner]
US 20220058466A1 · Yang · 2022 [cited by examiner]
US 20220245425A1 · Sheikh · 2022 [cited by examiner]
Padmanava Sen; Neural-Network-Based Parasitic Modeling and Extraction Verification for RF/Millimeter-Wave Integrated Circuit design; IEEE; Year: 20006; pp. 2604-2614. [cited by examiner]
Carlos Tokunaga et al. “Secure AES Engine with Local switched-capacitor current equalizer” , IEEE Solid State Circuits Conference (ISSCC), 2009, pp. 64-65. [cited by applicant]
Debayan Das et al, EM and Power SCA-Resilient AES-256 in 65nm CMOS Through >350x Current-Domain Signature Attenuation, IEEE ISSCC 2020, Feb. 19, 2020. [cited by applicant]
Girish B. Ratanpal et al. “An On-Chip Signal Suppression Countermeasure to Power Analysis Attacks”, IEEE Transactions on dependable and secure computing, Jul.-Sep. 2004, pp. 179-189. [cited by applicant]
Oleg Garitselov1; Fast-Accurate Non-Polynomial Metamodeling for nano-CMOS PLL Design Optimization; IEEE:2012; pp. 317-321. [cited by applicant]
Radu Muresan et al. “Protection Circuit against Differential Power Analysis Attacks for Smart Cards”, IEEE Transactions on Computers, vol. 57, No. 11, p. 1540-1549, Nov. 2008. [cited by applicant]