IP Library Granted Patent US 12,373,622
Granted Patent B2
US 12,373,622 · App. 17/540,167 · Granted Jul 29, 2025

Reducing crosstalk pessimism using GPU-accelerated gate simulation and machine learning

Inventors: Vidya Chhabria (Minneapolis, MN); Benjamin Andrew Keller (Oakland, CA); Yanqing Zhang (San Jose, CA); Brucek Kurdo Khailany (Austin, TX); Haoxing Ren (Austin, TX)
Assignee: NVIDIA CORPORATION
G06F30/3312G06F30/27G06N20/00G06F2119/12
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,373,622
App. No.
17/540,167
Granted
Jul 29, 2025
Kind
B2
Abstract

To facilitate crosstalk analysis for an IC design, a plurality of input vectors are input into a gate-level simulation. In response, the gate-level simulation determines timing windows for all nets within the IC design, may perform aggressor pruning, and may then determine and output aggressor/victim pairs and associated features for the IC design. This gate-level simulation may be accelerated utilizing one or more graphics processor units (GPUs). Additionally, the aggressor/victim pairs and associated features for the IC design are then input into a trained machine learning environment, which outputs predicted delta delays for each of the aggressor/victim pairs. In this way, crosstalk analysis may be performed more accurately and efficiently.

Claims (44)

1. A method comprising, at a device:

performing a gate-level simulation of an integrated circuit (IC) design to obtain a plurality of aggressor/victim pairs for the IC design, wherein the gate-level simulation performs at least one of:

logical correlation-based pruning where aggressor nets and victim nets having signal transitions that do not overlap are excluded from the aggressor/victim pairs obtained for the IC design, or

distance-based pruning where aggressor nets and victim nets that switch more than a predetermined time threshold apart from each other are excluded from the aggressor/victim pairs obtained for the IC design; and

processing the plurality of aggressor/victim pairs, by a machine learning model, to predict a delta delay for each of the plurality of aggressor/victim pairs.

2. The method of claim 1 , wherein the IC design includes a partition of an overall IC design.

3. The method of claim 1 , wherein the gate-level simulation is accelerated utilizing one or more graphics processor units (GPUs).

4. The method of claim 1 , wherein a plurality of input vectors are input into the gate-level simulation.

5. The method of claim 1 , wherein given a plurality of input vectors, the gate-level simulation determines timing windows for one or more nets within the IC design.

6. The method of claim 1 , wherein the gate-level simulation determines and outputs aggressor/victim pairs for the IC design, where for each of the output aggressor/victim pairs:

an aggressor net is capacitively coupled with a victim net, and

signal transitions of the aggressor net and the victim net overlap.

7. The method of claim 1 , wherein the gate-level simulation performs the logical correlation-based pruning.

8. The method of claim 1 , wherein the gate-level simulation performs the distance-based pruning.

9. The method of claim 1 , wherein the gate-level simulation determines and outputs associated features for each of the plurality of aggressor/victim pairs, wherein the features for at least one of the aggressor/victim pairs includes one or more of:

a victim slew value,

an aggressor slew value,

a bump value indicating a percentage of a voltage of a victim net that is perturbed due to an aggressor net,

victim load indicating a load capacitance on the victim net, or

a relative distance between switching times of the aggressor net and the victim net.

10. The method of claim 1 , wherein the machine learning model takes each of the plurality of aggressor/victim pairs, as well as associated features for each pair, as input, wherein the features for at least one of the aggressor/victim pairs includes one or more of:

a victim slew value,

an aggressor slew value,

a bump value indicating a percentage of a voltage of a victim net that is perturbed due to an aggressor net,

victim load indicating a load capacitance on the victim net, or a relative distance between switching times of the aggressor net and the victim net.

11. The method of claim 1 , further comprising at the device:

training the machine learning model.

12. A system comprising:

a hardware processor of a device that is configured to:

perform a gate-level simulation of an integrated circuit (IC) design to obtain a plurality of aggressor/victim pairs for the IC design, wherein the gate-level simulation performs at least one of:

logical correlation-based pruning where aggressor nets and victim nets having signal transitions that do not overlap are excluded from the aggressor/victim pairs obtained for the IC design, or

distance-based pruning where aggressor nets and victim nets that switch more than a predetermined time threshold apart from each other are excluded from the aggressor/victim pairs obtained for the IC design; and

process the plurality of aggressor/victim pairs, by a machine learning model, to predict a delta delay for each of the plurality of aggressor/victim pairs.

13. The system of claim 12 , wherein the IC design includes a partition of an overall IC design.

14. The system of claim 12 , wherein the gate-level simulation is accelerated utilizing one or more graphics processor units (GPUs).

15. The system of claim 12 , wherein a plurality of input vectors are input into the gate-level simulation.

16. The system of claim 12 , wherein given a plurality of input vectors, the gate-level simulation determines timing windows for one or more nets within the IC design.

17. The system of claim 12 , wherein the gate-level simulation determines and outputs aggressor/victim pairs for the IC design, based on timing windows for one or more nets within the IC design.

18. A non-transitory computer-readable storage medium storing instructions that, when executed by a processor of a device, causes the processor to cause the device to:

perform a gate-level simulation of an integrated circuit (IC) design to obtain a plurality of aggressor/victim pairs for the IC design, wherein the gate-level simulation performs at least one of:

logical correlation-based pruning where aggressor nets and victim nets having signal transitions that do not overlap are excluded from the aggressor/victim pairs obtained for the IC design, or

distance-based pruning where aggressor nets and victim nets that switch more than a predetermined time threshold apart from each other are excluded from the aggressor/victim pairs obtained for the IC design; and

process the plurality of aggressor/victim pairs, by a machine learning model, to predict a delta delay for each of the plurality of aggressor/victim pairs.

19. The computer-readable storage medium of claim 18 , wherein the gate-level simulation is accelerated utilizing one or more graphics processor units (GPUs).

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 7, 2021
From: CHHABRIA, VIDYA; KELLER, BENJAMIN ANDREW; ZHANG, YANQING; KHAILANY, BRUCEK KURDO; REN, HAOXING
To: NVIDIA CORPORATION
Reel/Frame 058328/0536 →
Continuity (2)
Provisional Application 63246682 · Sep 21, 2021
Related Publication 20230089606A1 · Mar 23, 2023
References Cited (39)
US 6510540B1 · Krauter · 2003 [cited by examiner]
US 6615395B1 · Hathaway · 2003 [cited by examiner]
US 7359843B1 · Keller · 2008 [cited by examiner]
US 7363605B1 · Kondratyev · 2008 [cited by examiner]
US 7549134B1 · Li · 2009 [cited by examiner]
US 7562323B1 · Bai · 2009 [cited by examiner]
US 10223493B1 · Spyrou · 2019 [cited by examiner]
US 10565336B2 · Morsey · 2020 [cited by examiner]
US 10643019B1 · Han · 2020 [cited by examiner]
US 10776547B1 · Gupta · 2020 [cited by examiner]
US 10915685B1 · Gupta · 2021 [cited by examiner]
US 11042806B1 · Jiang · 2021 [cited by examiner]
US 11222155B1 · Tehrani · 2022 [cited by examiner]
US 11461523B1 · Chen · 2022 [cited by examiner]
US 20020133325A1 · Hoare, II · 2002 [cited by examiner]
US 20020166101A1 · Casavant · 2002 [cited by examiner]
US 20030229873A1 · Casavant · 2003 [cited by examiner]
US 20060112359A1 · Becer · 2006 [cited by examiner]
US 20090224356A1 · Chandra · 2009 [cited by examiner]
US 20100218152A1 · Tehrani · 2010 [cited by examiner]
US 20160292344A1 · Griyage · 2016 [cited by examiner]
US 20170076116A1 · Chen · 2017 [cited by examiner]
US 20170308638A1 · Gothi · 2017 [cited by examiner]
US 20180121585A1 · Cherupalli · 2018 [cited by examiner]
US 20180121595A1 · Hathaway · 2018 [cited by examiner]
US 20190362045A1 · Morsey · 2019 [cited by examiner]
US 20200074276A1 · Cooke · 2020 [cited by examiner]
US 20200183964A1 · Wu · 2020 [cited by examiner]
US 20200242206A1 · Kim · 2020 [cited by examiner]
US 20210056468A1 · Cao · 2021 [cited by examiner]
US 20220398369A1 · Tehrani · 2022 [cited by examiner]
US 20230237229A1 · Yuan · 2023 [cited by examiner]
WO WO2018188081A1 · 2018 [cited by examiner]
D. Das, K. Killpack, C. Kashyap, A. Jas and H. Zhou, “Pessimism Reduction in Coupling-Aware Static Timing Analysis Using Timing and Logic Filtering,” in IEEE Transactions on Computer-Aided Design of Integrated Circuits … [cited by examiner]
T. El Motassadeq, V. Sarathi, S. Thameem and M. Nijam, “SPICE versus STA tools: Challenges and tips for better correlation,” 2009 IEEE International SOC Conference (SOCC), Belfast, UK, 2009, pp. 325-328. (Year: 2009). [cited by examiner]
Tanaka et al., “Crosstalk Pessimism Reduction with Path Base Analysis, ”10th International Symposium on Quality Electronic Design, 2009, 6 pages. [cited by applicant]
Fatemi et al., “Crosstalk Timing Windows Overlap in Statistical Static Timing Analysis,” 14th International Symposium on Quality Electronic Design (ISQED), Mar. 2013, 7 pages. [cited by applicant]
Chen et al., “Crosstalk-Aware Signal Probability-Based Dynamic Statistical Timing Analysis,” 16th International Symposium on Quality Electronic Design, Mar. 2015, 6 pages. [cited by applicant]
Becer et al., “Pessimism Reduction in Crosstalk Noise Aware Sta,” ICCAD-2005, IEEE/ACM International Conference on Computer-Aided Design, 2005, pp. 953-961. [cited by applicant]