IP Library Granted Patent US 12,387,029
Granted Patent B2
US 12,387,029 · App. 17/889,370 · Granted Aug 12, 2025

Computing parasitic values for semiconductor designs

Inventors: Akira Fujimura (Saratoga, CA); Nagesh Shirali (San Jose, CA); Donald Oriordan (Sunnyvale, CA)
Assignee: D2S, INC.
G06F30/3953G06F30/27G06F30/392G06F30/398G06N3/045G06T7/0004G06T7/0006G06F2119/06G06F2119/10G06T2207/20084G06T2207/30121G06T2207/30148H10D86/441H10D86/60H10D89/60
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,387,029
App. No.
17/889,370
Granted
Aug 12, 2025
Kind
B2
Abstract

Some embodiments provide a method for calculating parasitic parameters for a pattern to be manufactured on an integrated circuit (IC) substrate. The method receives a definition of a wire structure as input. The method rasterizes the wire structure (e.g., produces pixel-based definition of the wire structure) to produce several images. Before rasterizing the wire structure, the method in some embodiments decomposes the wire structure into several components (e.g., several wires, wire segments or wire structure portions), which it then individually rasterizes. The method then uses the images as inputs to a neural network, which then calculates parasitic parameters associated with the wire structure. In some embodiments, the parasitic parameters include unwanted parasitic capacitance effects exerted on the wire structure. Conjunctively, or alternatively, these parameters include unwanted parasitic resistance and/or inductance effects on the wire structure.

Claims (50)

1. A method for calculating parasitic parameters for wire structures that are to be manufactured on a semiconductor substrate and that are to be defined in one or more semiconductor designs, the method comprising:

receiving a first wire structure that includes a plurality of rectilinear shapes associated with one or more semiconductor designs;

generating, from the first wire structure, a second wire structure comprising a plurality of curvilinear shapes; and

using the second wire structure to generate parasitic parameters for specifying parasitic effects experienced by one or more wire structures of the one or more semiconductor designs.

2. The method of claim 1 , wherein the second wire structure with the curvilinear shapes is a structure that is predicted to be produced once the first wire structure is manufactured, and is thereby a predicted manufactured structure of the first wire structure.

3. The method of claim 2 , wherein generating the second wire structure comprises supplying the first wire structure to a machine-trained network to produce the second wire structure.

4. The method of claim 3 , wherein the machine-trained network is a neural network with a plurality of machine-trained neurons.

5. The method of claim 2 , wherein generating the second wire structure comprises using a software simulator to generate the second wire structure as the predicted manufactured structure.

6. The method of claim 1 , wherein the first and second wire structures are defined to include two-dimensional (2D) shapes, the method further comprising:

receiving a set of manufacturing process technology information associated with the semiconductor design;

using the set of manufacturing process technology information to produce a three-dimensional (3-D) shape from the second wire structure; and

providing the 3-D shape to a field solver to produce a set of parasitic parameters.

7. The method of claim 6 , wherein the set of manufacturing process technology information comprises wire heights and dielectric thickness.

8. The method of claim 6 , wherein the set of parasitic parameters are used to train a machine-trained network to produce parasitic coefficients for different wire structures of different semiconductor designs, the method further comprising:

extracting a particular wire structure from a particular semiconductor design;

rasterizing the particular wire structure to produce a pixel-based definition of the particular wire structure;

supplying the pixel-based definition to the machine-trained network to produce a plurality of parasitic coefficients for the particular wire structure; and

using the produced plurality of parasitic coefficients to compute a parasitic value that represents a parasitic effect on the particular wire structure.

9. The method of claim 6 , wherein the set of parasitic parameters are used to train a machine-trained network to produce parasitic values for different wire structures of different semiconductor designs, the method further comprising

extracting a particular wire structure from a particular semiconductor design;

dividing the particular wire structure with a tile structure that comprises a plurality of tiles, the divided particular wire structure comprising a plurality of wire structures each of which falls within a different tile;

rasterizing each of the plurality of wire structures to produce a pixel-based definition of each wire structure;

supplying each pixel-based definition to the machine-trained network to produce a tile-specific parasitic value; and

computing an overall parasitic value from the produced tile-specific parasitic values, the overall parasitic value representing a parasitic effect on the particular wire structure.

10. The method of claim 1 , wherein rectilinear shapes comprise shapes that are produced by using straight line segments, while curvilinear shapes are shapes that are produced by using at least one curved line segment.

11. A non-transitory machine-readable medium storing a program which when executed by at least one processing unit calculates parasitic parameters for wire structures that are to be manufactured on a semiconductor substrate and that are to be defined in one or more semiconductor designs, the program comprising sets of instructions for:

receiving a first wire structure that includes a plurality of rectilinear shapes associated with one or more semiconductor designs;

generating, from the first wire structure, a second wire structure comprising a plurality of curvilinear shapes; and

using the second wire structure to generate parasitic parameters for specifying parasitic effects experienced by one or more wire structures of the one or more semiconductor designs.

12. The non-transitory machine-readable medium of claim 11 , wherein the second wire structure with the curvilinear shapes is a structure that is predicted to be produced once the first wire structure is manufactured, and is thereby a predicted manufactured structure of the first wire structure.

13. The non-transitory machine-readable medium of claim 12 , wherein the set of instructions for generating the second wire structure comprises a set of instructions for supplying the first wire structure to a machine-trained network to produce the second wire structure.

14. The non-transitory machine-readable medium of claim 13 , wherein the machine-trained network is a neural network with a plurality of machine-trained neurons.

15. The non-transitory machine-readable medium of claim 12 , wherein the set of instructions for generating the second wire structure comprises a set of instructions for using a software simulator to generate the second wire structure as the predicted manufactured structure.

16. The non-transitory machine-readable medium of claim 11 , wherein the first and second wire structures are defined to include two-dimensional (2D) shapes, the program further comprising sets of instructions for:

receiving a set of manufacturing process technology information associated with the semiconductor design;

using the set of manufacturing process technology information to produce a three-dimensional (3-D) shape from the second wire structure; and

providing the 3-D shape to a field solver to produce a set of parasitic parameters.

17. The non-transitory machine-readable medium of claim 16 , wherein the set of manufacturing process technology information comprises wire heights and dielectric thickness.

18. The non-transitory machine-readable medium of claim 16 , wherein the set of parasitic parameters are used to train a machine-trained network to produce parasitic coefficients for different wire structures of different semiconductor designs, the program further comprising sets of instructions for:

extracting a particular wire structure from a particular semiconductor design;

rasterizing the particular wire structure to produce a pixel-based definition of the particular wire structure;

supplying the pixel-based definition to the machine-trained network to produce a plurality of parasitic coefficients for the particular wire structure; and

using the produced plurality of parasitic coefficients to compute a parasitic value that represents a parasitic effect on the particular wire structure.

19. The non-transitory machine-readable medium of claim 16 , wherein the set of parasitic parameters are used to train a machine-trained network to produce parasitic coefficients for different wire structures of different semiconductor designs, the program further comprising sets of instructions for:

extracting a particular wire structure from a particular semiconductor design;

dividing the particular wire structure with a tile structure that comprises a plurality of tiles, the divided particular wire structure comprising a plurality of wire structures each of which falls within a different tile;

rasterizing each of the plurality of wire structures to produce a pixel-based definition of each wire structure;

supplying each pixel-based definition to the machine-trained network to produce a tile-specific parasitic value; and

computing an overall parasitic value from the produced parasitic values, the overall parasitic value representing a parasitic effect on the particular wire structure.

20. The non-transitory machine-readable medium of claim 11 , wherein rectilinear shapes comprise shapes that are produced by using straight line segments, while curvilinear shapes are shapes that are produced by using at least one curved line segment.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 16, 2023
From: FUJIMURA, AKIRA; SHIRALI, NAGESH; ORIORDAN, DONALD
To: D2S, INC.
Reel/Frame 063973/0830 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 19, 2023
From: FUJIMURA, AKIRA; SHIRALI, NAGESH; ORIORDAN, DONALD
To: D2S, INC.
Reel/Frame 063708/0876 →
Continuity (3)
Continuation 17871893 · Jul 22, 2022
Provisional Application 63203455 · Jul 23, 2021
Related Publication 20230186009A1 · Jun 15, 2023
References Cited (165)
US 7269817B2 · Heng et al. · 2007 [cited by applicant]
US 7526748B2 · Kotani et al. · 2009 [cited by applicant]
US 7754401B2 · Fujimura et al. · 2010 [cited by applicant]
US 8473875B2 · Fujimura et al. · 2013 [cited by applicant]
US 8584066B1 · Mau et al. · 2013 [cited by applicant]
US 8818072B2 · Ong et al. · 2014 [cited by applicant]
US 10012900B2 · Kim et al. · 2018 [cited by applicant]
US 10444629B2 · Zable · 2019 [cited by applicant]
US 10520830B2 · Kicken et al. · 2019 [cited by applicant]
US 10670973B2 · Zou et al. · 2020 [cited by applicant]
US 10678142B2 · Jheng et al. · 2020 [cited by applicant]
US 10923318B2 · Gledhill et al. · 2021 [cited by applicant]
US 10949595B2 · Tsutsui et al. · 2021 [cited by applicant]
US 11043359B2 · Nakamura et al. · 2021 [cited by applicant]
US 20040210863A1 · Culp et al. · 2004 [cited by applicant]
US 20050132306A1 · Smith et al. · 2005 [cited by applicant]
US 20050251771A1 · Robles · 2005 [cited by applicant]
US 20060190911A1 · Stivers · 2006 [cited by applicant]
US 20080109766A1 · Song et al. · 2008 [cited by applicant]
US 20110089345A1 · Komagata et al. · 2011 [cited by applicant]
US 20120151422A1 · White et al. · 2012 [cited by applicant]
US 20130022929A1 · Komagata et al. · 2013 [cited by applicant]
US 20130159943A1 · Agarwal et al. · 2013 [cited by applicant]
US 20130283216A1 · Pearman et al. · 2013 [cited by applicant]
US 20130283218A1 · Fujimura et al. · 2013 [cited by applicant]
US 20140007033A1 · Kitamura et al. · 2014 [cited by applicant]
US 20160125120A1 · Yu et al. · 2016 [cited by applicant]
US 20170194126A1 · Bhaskar et al. · 2017 [cited by applicant]
US 20170357911A1 · Liu et al. · 2017 [cited by applicant]
US 20180067900A1 · Mos et al. · 2018 [cited by applicant]
US 20190146355A1 · Jheng et al. · 2019 [cited by applicant]
US 20190197213A1 · Ungar · 2019 [cited by applicant]
US 20190206041A1 · Fang et al. · 2019 [cited by applicant]
US 20190377849A1 · Sha et al. · 2019 [cited by applicant]
US 20190385300A1 · Baidya et al. · 2019 [cited by applicant]
US 20200006328A1 · Yamazaki et al. · 2020 [cited by applicant]
US 20200051781A1 · Fujimura et al. · 2020 [cited by applicant]
US 20200065453A1 · Kim et al. · 2020 [cited by applicant]
US 20200134131A1 · Tien et al. · 2020 [cited by applicant]
US 20200184137A1 · Tsutsui et al. · 2020 [cited by applicant]
US 20200233931A1 · Kourkoulos · 2020 [cited by examiner]
US 20200364394A1 · Yu et al. · 2020 [cited by applicant]
US 20200380089A1 · Gheith et al. · 2020 [cited by applicant]
US 20200380362A1 · Cao et al. · 2020 [cited by applicant]
US 20200387660A1 · Cecil · 2020 [cited by applicant]
US 20210048741A1 · Lugg et al. · 2021 [cited by applicant]
US 20210181620A1 · Poonawala et al. · 2021 [cited by applicant]
US 20210216697A1 · Brink et al. · 2021 [cited by applicant]
US 20210248299A1 · Kourkoulos · 2021 [cited by examiner]
US 20210279878A1 · Adler et al. · 2021 [cited by applicant]
US 20210397172A1 · Slachter et al. · 2021 [cited by applicant]
US 20220035237A1 · Lee et al. · 2022 [cited by applicant]
US 20220050381A1 · Biswas et al. · 2022 [cited by applicant]
US 20220128899A1 · Fujimura et al. · 2022 [cited by applicant]
US 20220147682A1 · Koumura · 2022 [cited by applicant]
US 20220187713A1 · Middlebrooks et al. · 2022 [cited by applicant]
US 20220299881A1 · Zheng et al. · 2022 [cited by applicant]
US 20230024684A1 · Fujimura et al. · 2023 [cited by applicant]
US 20230027655A1 · Fujimura et al. · 2023 [cited by applicant]
US 20230032510A1 · Fujimura et al. · 2023 [cited by applicant]
US 20230092665A1 · Fujimura et al. · 2023 [cited by applicant]
US 20230107556A1 · Tao et al. · 2023 [cited by applicant]
US 20230168660A1 · Oriordan et al. · 2023 [cited by applicant]
US 20230169245A1 · Oriordan et al. · 2023 [cited by applicant]
US 20230169246A1 · Oriordan et al. · 2023 [cited by applicant]
US 20230169247A1 · Oriordan et al. · 2023 [cited by applicant]
US 20230205972A1 · Oriordan et al. · 2023 [cited by applicant]
US 20230229836A1 · Oriordan et al. · 2023 [cited by applicant]
US 20230229840A1 · Oriordan et al. · 2023 [cited by applicant]
US 20230229844A1 · Oriordan et al. · 2023 [cited by applicant]
US 20230267265A1 · Oriordan · 2023 [cited by applicant]
US 20230274065A1 · Fujimura · 2023 [cited by applicant]
US 20230274066A1 · Fujimura · 2023 [cited by applicant]
US 20230274067A1 · Fujimura · 2023 [cited by applicant]
US 20230274068A1 · Fujimura · 2023 [cited by applicant]
US 20230274069A1 · Fujimura · 2023 [cited by applicant]
US 20230274070A1 · Fujimura · 2023 [cited by applicant]
US 20230274071A1 · Fujimura · 2023 [cited by applicant]
US 20230281374A1 · Fujimura · 2023 [cited by applicant]
US 20230282635A1 · Fujimura · 2023 [cited by applicant]
US 20230306177A1 · Fujimura · 2023 [cited by applicant]
US 20230351087A1 · Oriordan et al. · 2023 [cited by applicant]
US 20230351088A1 · Oriordan et al. · 2023 [cited by applicant]
US 20230351089A1 · Oriordan et al. · 2023 [cited by applicant]
US 20230359804A1 · Oriordan · 2023 [cited by applicant]
US 20240288764A1 · Hamouda · 2024 [cited by applicant]
CN 104133955A · 2014 [cited by applicant]
CN 107438842A · 2017 [cited by applicant]
CN 111758072A · 2020 [cited by applicant]
CN 113168085A · 2021 [cited by applicant]
CN 113168115A · 2021 [cited by applicant]
CN 110998585A · 2024 [cited by applicant]
EP 3951496A1 · 2022 [cited by applicant]
JP 2006053248A · 2006 [cited by applicant]
JP 2007536581A · 2007 [cited by applicant]
JP 2012181298A · 2012 [cited by applicant]
JP 2019114295A · 2019 [cited by applicant]
JP 2021509208A · 2021 [cited by applicant]
KR 102170578B1 · 2020 [cited by applicant]
KR 20210010897A · 2021 [cited by applicant]
KR 102377411B1 · 2022 [cited by applicant]
TW I483133B · 2015 [cited by applicant]
TW 201834149A · 2018 [cited by applicant]
TW I710763B · 2020 [cited by applicant]
TW 202113501A · 2021 [cited by applicant]
TW 202121050A · 2021 [cited by applicant]
WO 2018125220A1 · 2018 [cited by applicant]
WO 2020188397A1 · 2020 [cited by applicant]
WO 2020193095A1 · 2020 [cited by applicant]
WO 2021041963A1 · 2021 [cited by applicant]
WO 2021043936A1 · 2021 [cited by applicant]
WO 2022086825A1 · 2022 [cited by applicant]
WO 2023003918A2 · 2023 [cited by applicant]
Ajayi, Tutu, et al., “OpenRoad: Toward a Self-Driving, Open-Source Digital Layout Implementation Tool Chain,” Proceedings of Government Microcircuit Applications and Critical Technology Conference, Jan. 1, 2019, 6 pages… [cited by applicant]
Ao, Jianchang, et al., “Delay-Driven Layer Assignment in Global Routing under Multi-tier Interconnect Structure,” ISPD '13: Proceedings of the 2013 ACM International Symposium on Physical Design, Mar. 2013, 7 pages, ACM… [cited by applicant]
Arora, Narain D., et al., “Modeling and Extraction of Interconnect Capacitances for Multilayer VLSI Circuits,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Jan. 1996, 10 pages, vol. 15,… [cited by applicant]
Author Unknown, “D2S Enables “Stitchless” Full-Chip Inverse Lithography Technology in a Single Day for the Multi-Beam Era,” Press Release, Sep. 16, 2019, 3 pages, D2S, Inc., San Jose, California, USA. [cited by applicant]
Author Unknown, “D2S Unveils Industry's First Mask-Wafer Double Simulation Platform,” Press Release, Sep. 20, 2011, 3 pages, D2S, Inc., San Jose, California, USA. [cited by applicant]
Author Unknown, “Deep reinforcement learning,” Wikipedia, Sep. 21, 2020, 2 pages, Wikipedia.com. [cited by applicant]
Author Unknown, “Design rule checking,” Wikipedia, May 27, 2020, 4 pages, Wikipedia.com. [cited by applicant]
Author Unknown, “Marching squares,” Wikipedia, Dec. 30, 2019, 9 pages, Wikipedia.com. [cited by applicant]
Author Unknown, “Multiple patterning,” Wikipedia, Oct. 10, 2020, 22 pages, Wikipedia.com. [cited by applicant]
Author Unknown, “Optical proximity correction,” Wikipedia, Apr. 28, 2019, 5 pages, Wikipedia.com. [cited by applicant]
Author Unknown, “Quantus Extraction Solution,” Cadence Datasheet, Aug. 2019, 4 pages, Cadence Design Systems, Inc., retrieved from https://www.cadence.com/content/dam/cadence-www/global/en_US/documents/tools/digital-des… [cited by applicant]
Author Unknown, “Rasterisation,” Wikipedia, Aug. 21, 2020, 4 pages, Wikipedia.com. [cited by applicant]
Author Unknown, “StarRC,” Synopsys Datasheet, Nov. 2015, 7 pages, Synopsys, Inc., retrieved from https://www.synopsys.com/content/dam/synopsys/implementation&signoff/datasheets/starrc-ds.pdf. [cited by applicant]
Author Unknown, “TrueMask® DS,” Exact Date Unknown but Before May 2020, 3 pages, D2S, Inc., retrieved from https://design2silicon.com/products/truemask-ds/. [cited by applicant]
Author Unknown, “TrueMask® ILT Backgrounder Stitchless Full-Chip ILT in a Day,” Backgrounder, Sep. 2019, 6 pages, D2S, Inc., San Jose, California, USA. [cited by applicant]
Author Unknown, “TrueMask® ILT,” Exact Date Unknown but Before May 2020, 7 pages, D2S, Inc., retrieved from https://design2silicon.com/products/truemask-ilt/. [cited by applicant]
Cecil, Thomas, et al., “Establishing Fast, Practical, Full-Chip ILT Flows Using Machine Learning,” SPIE Proceedings 11327, Optical Microlithography XXXIII, Mar. 23, 2020, 19 pages, vol. 1132706, SPIE, San Jose, Californ… [cited by applicant]
Chen, Kun-Yuan, et al., “Full-Chip Application of Machine Learning SRAFs on DRAM Case Using Auto Pattern Selection,” SPIE Proceedings 10961, Optical Microlithography XXXII, Oct. 10, 2019, 13 pages, vol. 1096108, SPIE, S… [cited by applicant]
Chen, Tai-Chen, “Multilevel Full-Chip Gridless Routing With Applications to Optical-Proximity Correction,” Jun. 2007, 13 pages, IEEE, retrieved from http://cc.ee.ntu.edu.tw/˜ywchang/Papers/tcad07-mgr.pdf. [cited by applicant]
Chow, Karen, “Parasitic Extraction for Accurate Signal Integrity Analysis at Advanced Nodes,” Design With Calibre, Mar. 15, 2016, 7 pages, Siemens, retrieved from https://blogs.sw.siemens.com/calibre/2016/03/15/parasiti… [cited by applicant]
Cong, Jason, et al., “Analysis and Justification of a Simple, Practical 2 1/2-D Capacitance Extraction Methodology,” DAC '97: Proceedings of the 34th annual Design Automation Conference, Jun. 13, 1997, 6 pages, Associat… [cited by applicant]
Geuzaine, Christophe, et al., “Gmsh: a three-dimensional finite element mesh generator with built-in pre- and post-processing facilities,” International Journal for Numerical Methods in Engineering, Sep. 10, 2009, 24 pa… [cited by applicant]
Ibtehaz, Nabil, et al., “MultiResUNet: Rethinking the U-Net Architecture for Multimodal Biomedical Image Segmentation,” Feb. 11, 2019, 25 pages, retrieved from https://arxiv.org/pdf/1902.04049.pdf. [cited by applicant]
Jia, Ningning, et al., “Machine Learning for Inverse Lithography: using stochastic gradient descent for robust photomask synthesis,” Journal of Optics, Apr. 1, 2010, 9 pages, vol. 12, IOP Publishing, retrieved from http… [cited by applicant]
Kao, William H., et al., “Parasitic Extraction: Current State of the Art and Future Trends,” Proceedings of the IEEE, May 5, 2001, 11 pages, vol. 89, No. 5, IEEE, retrieved from https://citeseerx.ist.psu.edu/viewdoc/dow… [cited by applicant]
Kwan, Joe, et al., “Applying Machine Learning Techniques to Accelerate Advanced Process Yield Ramp,” Jan. 5, 2021, 29 pages, Siemens Digital Industries Software, Munich, Germany. [cited by applicant]
Lin, Yibo, et al., “Machine Learning for Yield Learning and Optimization,” 2018 IEEE International Test Conference (ITC), Oct. 29-Nov. 1, 2018, 10 pages, IEEE, Phoenix, AZ, USA. [cited by applicant]
Liu, Peng, “Mask Synthesis Using Machine Learning Software and Hardware Platforms,” SPIE Proceedings 11327, Optical Microlithography XXXIII, Mar. 23, 2020, 17 pages, vol. 1132707, SPIE, San Jose, California, USA. [cited by applicant]
Nabors, K., et al., “FastCap User's Guide,” Research Laboratory of Electronics, Sep. 18, 1992, 57 pages, Massachusetts Institute of Technology, retrieved from https://www.fastfieldsolvers.com/Download/FastCap_User_Guide… [cited by applicant]
Pang, Linyong (Leo), et al., “Study of Mask and Wafer Co-design That Utilizes a New Extreme SIMD Approach to Computing in Memory Manufacturing: Full-Chip Curvilinear ILT in a Day,” SPIE Proceedings 11148, Photomask Tech… [cited by applicant]
Pang, Linyong, “Inverse Lithography Technology: 30 years from concept to practical, full-chip reality,” Journal of Micro/Nanopatterning, Materials, and Metrology, Aug. 31, 2021, 49 pages, vol. 20(3), SPIE, retrieved fro… [cited by applicant]
Pang, Linyong, et al., “How GPU-Accelerated Simulation Enables Applied Deep Learning for Masks and Wafers,” Photomask Japan 2019: XXVI Symposium on Photomask and Next-Generation Lithography Mask Technology, Apr. 16-18, … [cited by applicant]
Pang, Linyong, et al., “Making Digital Twins using the Deep Learning Kit (DLK),” Photomask Technology 2019, Sep. 15-19, 2019, 13 pages, SPIE, Monterey, California, USA. [cited by applicant]
PCT International Search Report and Written Opinion of Commonly Owned International Patent Application PCT/US2022/037648, mailing date Jan. 12, 2023, 12 pages, International Searching Authority (US). [cited by applicant]
Pradipta, Geraldo, et al., “A Machine Learning Based Parasitic Extraction Tool,” Oct. 31, 2019, 3 pages, University of Minnesota, Minneapolis, Minnesota, USA. [cited by applicant]
Ren, Haoxing (Mark), “Machine Learning and Deep Learning Applications in Design Automation and Practical Issues,” DAC '19: 56th Annual Design Automation Conference 2019, Jun. 2-6, 2019, 55 pages, Association for Computi… [cited by applicant]
Ronneberger, Olaf, et al., “U-Net: Convolutional Networks for Biomedical Image Segmentation,” May 18, 2015, 8 pages, retrieved from https://arxiv.org/pdf/1505.04597.pdf. [cited by applicant]
Shi, Xuelong, et al., “Physics based feature Vector Design: a Critical Step Towards Machine Learning based Inverse Lithography,” SPIE Proceedings 11327, Optical Microlithography XXXIII, Mar. 23, 2020, 8 pages, vol. 1132… [cited by applicant]
Smith, Michael J. S., “Circuit Extraction and DRC,” Application-Specific Integrated Circuits, Jun. 1997, 7 pages, Addison-Wesley Professional, Boston, Massachusetts, USA. [cited by applicant]
Sole, Marc Pons, “Layout Regularity for Design and Manufacturability,” Doctoral Thesis, Jul. 8, 2012, 185 pages, Technical University of Catalonia, Barcelona, Spain. [cited by applicant]
Sperling, Ed, “Design Rule Complexity Rising,” Semiconductor Engineering—Deep Insights for the Tech Industry, Apr. 19, 2018, 16 pages, SMG, retrieved from https://semiengineering.com/design-rule-complexity-rising/. [cited by applicant]
Teig, Steven L., “The X architecture: not your father's diagonal wiring,” SLIP '02: Proceedings of the 2002 international workshop on System-level interconnect prediction, Apr. 6, 2002, 5 pages, ACM, retrieved from http… [cited by applicant]
Wang, Shibing, et al., “Efficient Full-Chip SRAF Placement Using Machine Learning for Best Accuracy and Improved Consistency,” SPIE Proceedings 10587, Optical Microlithography XXXI, Mar. 20, 2018, 10 pages, vol. 105870N… [cited by applicant]
Wang, Shibing, et al., “Machine Learning Assisted SRAF Placement for Full Chip,” SPIE Proceedings 10451, Photomask Technology 2017, Oct. 16, 2017, 8 pages, vol. 104510D, SPIE, Monterey, California, USA. [cited by applicant]
Yang, Dingcheng, et al., “CNN-Cap: Effective Convolutional Neural Network Based Capacitance Models for Full-Chip Parasitic Extraction,” Jul. 14, 2021, 9 pages, retrieved from https://arxiv.org/pdf/2107.06511.pdf. [cited by applicant]
Abouelyazid, Mohamed Saleh, et al., “Fast and Accurate Machine Learning Compact Models for Interconnect Parasitic Capacitances Considering Systematic Process Variations,” IEEE Access, vol. 10, pp. 7533-7553, Jan. 12, 20… [cited by applicant]
Author Unknown, “EM Solvers Theory Basics,” May 30, 2017, 47 pages, FastFieldSolvers S.R.L., retrieved from https://www.fastfieldsolvers.com/Papers/EM_solvers_basics_170606.pptx. [cited by applicant]
Di Lorenzo, E., “The Maxwell Capacitance Matrix,” Jun. 2020, 3 pages, FastFieldSolvers S.R.L., retrieved from https://www.fastfieldsolvers.com/Papers/The_Maxwell_Capacitance_Matrix_WP110301_R02.pdf. [cited by applicant]
Di Lorenzo, E., “The Treatment of Dielectrics in FasterCap,” May 2013, 8 pages, FastFieldSolvers S.R.L., retrieved from https://www.fastfieldsolvers.com/Papers/The_Treatment_of_Dielectrics_in_FasterCap_WP130527_R01.pdf. [cited by applicant]
Abouelyazid, Mohamed Saleh, et al., “Accuracy-Based Hybrid Parasitic Capacitance Extraction Using Rule- Based, Neural-Networks, and Field-Solver Methods,” IEEE Transactions on Computer-Aided Design of Integrated Circuit… [cited by applicant]
Peng, Shaoyi, et al., “Data-Driven Fast Electrostatics and TDDB Aging Analysis”, 2020 IEEE/ACM 2nd Workshop on Machine Learning for CAD (MLCAD), Nov. 16-20, 2020, pp. 71-76, IEEE, Reykjavik, Iceland. [cited by applicant]
Sen, Padmanava, et al., “Neural-Network-Based Parasitic Modeling and Extraction Verification for RF/Millimeter-Wave Integrated Circuit Design,” IEEE Transactions on Microwave Theory and Techniques, vol. 54, No. 6, Jun. … [cited by applicant]