会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 12. 发明授权
    • Method of laying out integrated circuit design based on known polysilicon perimeter densities of individual cells
    • 基于单个电池的已知多晶硅周边密度布置集成电路设计的方法
    • US07890906B2
    • 2011-02-15
    • US12117761
    • 2008-05-09
    • Laura S. ChadwickJames A. CulpDavid J. HathawayAnthony D. Polson
    • Laura S. ChadwickJames A. CulpDavid J. HathawayAnthony D. Polson
    • G06F17/50
    • G06F17/5068
    • Disclosed is a method of laying out individual cells of an integrated circuit design, based at least in part on the known polysilicon perimeter densities of those cells. That is, the method embodiments use the knowledge of polysilicon perimeter density for known cells to drive placement of those cells on a chip (i.e., to drive floor-planning). The method embodiments can be used to achieve approximately uniform across-chip polysilicon perimeter density and, thereby to limit performance parameter variations between functional devices that are attributable to variations in polysilicon perimeter density. Alternatively, the method embodiments can be used to selectively control variations in the average polysilicon perimeter density of different regions of a chip and, thereby to selectively control certain performance parameter variations between functional devices located in those different regions.
    • 公开了至少部分地基于这些单元的已知多晶硅周边密度来布置集成电路设计的单个单元的方法。 也就是说,方法实施例使用已知单元的多晶硅周密度的知识来驱动这些单元在芯片上的放置(即,驱动楼层规划)。 方法实施例可以用于实现大致均匀的跨芯片多晶硅周边密度,并且由此限制可归因于多晶硅周边密度变化的功能器件之间的性能参数变化。 或者,方法实施例可以用于选择性地控制芯片的不同区域的平均多晶硅周长密度的变化,从而选择性地控制位于那些不同区域中的功能设备之间的某些性能参数变化。
    • 13. 发明申请
    • Method For Efficiently Checkpointing And Restarting Static Timing Analysis Of An Integrated Circuit Chip
    • 有效地检查和重新启动集成电路芯片的静态时序分析的方法
    • US20100180244A1
    • 2010-07-15
    • US12354360
    • 2009-01-15
    • Kerim KalafalaHemlata GuptaDavid J. HathawayJeffrey G. Hemmett
    • Kerim KalafalaHemlata GuptaDavid J. HathawayJeffrey G. Hemmett
    • G06F17/50
    • G06F17/5031
    • A method for loading checkpoint timing in an environment where the boundary arrival times, slews, required arrival times, or loads differ from the checkpoint run. A timing checkpoint file generated for one or more hierarchical modules, during which each input is assigned a unique phase tag. The association of unique phase tags allows subsequent restart analyses to efficiently adjust the checkpoint timing in relation to the restart timing environment. In the restart run, one or more such checkpoint files is read, during which an initial propagation of arrival, required arrivals and slew times are performed, followed by a local re-update based on adjusted arrival times and the required arrival times. Finally, if multiple hierarchical modules are updated, a global recalculation of timing values is performed based on a slack change threshold in order to determine whether any new timing failures have been introduced.
    • 在边界到达时间,转数,所需到达时间或负载与检查点运行不同的环境中加载检查点定时的方法。 为一个或多个分层模块生成的定时检查点文件,在此期间为每个输入分配唯一的相位标签。 独特相位标签的关联允许随后的重新启动分析以有效地调整与重启定时环境相关的检查点定时。 在重新启动运行中,读取一个或多个这样的检查点文件,在此期间,执行到达的初始传播,所需到达和转换时间,然后基于调整的到达时间和所需的到达时间进行本地重新更新。 最后,如果更新了多个分级模块,则基于松弛变化阈值执行定时值的全局重新计算,以便确定是否引入了任何新的定时故障。
    • 17. 发明授权
    • Use of redundant routes to increase the yield and reliability of a VLSI layout
    • 使用冗余路由来提高VLSI布局的收益和可靠性
    • US07308669B2
    • 2007-12-11
    • US10908593
    • 2005-05-18
    • Markus T. BuehlerJohn M. CohnDavid J. HathawayJason D. HibbelerJuergen Koehl
    • Markus T. BuehlerJohn M. CohnDavid J. HathawayJason D. HibbelerJuergen Koehl
    • G06F17/50
    • G06F17/5077G06F17/5068
    • Disclosed is a method and system for inserting redundant paths into an integrated circuit. Particularly, the invention provides a method for identifying a single via in a first path connecting two elements, determining if an alternate route is available for connecting the two elements (other than a redundant via), and for inserting a second path into the available alternate route. The combination of the first and second paths provides greater redundancy than inserting a redundant via alone. More importantly, such redundant paths provide for redundancy when congestion prevents a redundant via from being inserted adjacent to the single via. An embodiment of the method further comprises removing the single via and any redundant wire segments, if all of the additional vias used to form the second path can be made redundant.
    • 公开了一种将冗余路径插入到集成电路中的方法和系统。 特别地,本发明提供了一种用于在连接两个元件的第一路径中识别单个通孔的方法,确定替代路线是否可用于连接两个元件(不同于冗余通路),以及用于将第二路径插入到可用替代 路线。 第一和第二路径的组合提供了比单独插入冗余通道更大的冗余。 更重要的是,当拥塞阻止冗余通道被插入邻近单个通道时,这种冗余路径提供了冗余。 如果用于形成第二路径的所有附加通孔都可以是冗余的,则该方法的实施例还包括去除单个通孔和任何冗余线段。
    • 18. 发明授权
    • Method of optimizing and analyzing selected portions of a digital integrated circuit
    • 优化和分析数字集成电路的选定部分的方法
    • US07010763B2
    • 2006-03-07
    • US10436213
    • 2003-05-12
    • David J. HathawayLawrence Kenneth LangeChandramouli VisweswariahPatrick M. Williams
    • David J. HathawayLawrence Kenneth LangeChandramouli VisweswariahPatrick M. Williams
    • G06F17/50
    • G06F17/505
    • Disclosed is a method for achieving timing closure in the design of a digital integrated circuit or system by selecting portions of the circuit or system to be optimized and portions of the circuit or system in which the effects of such optimization are to be analyzed during the optimization process. Optimized portions will include gates whose design parameters are to be changed, a first analyzed portion includes gates whose delays and edge slews are to be recomputed, and a second analyzed portion includes gates whose ATs and RATs are to be recomputed during optimization. Constraints are imposed at selected boundaries between these portions to prevent unwanted propagation of timing information and to ensure the validity of timing values used during optimization. Through this selection, the size of the problem posed to the underlying optimization method will be reduced, allowing larger circuits or systems to be optimized and allowing optimization to be performed more quickly.
    • 公开了一种在数字集成电路或系统的设计中实现定时闭合的方法,通过选择要优化的电路或系统的部分以及在优化期间分析这种优化的影响的电路或系统的部分 处理。 优化部分将包括其设计参数将被改变的门,第一分析部分包括要重新计算其延迟和边缘电压的门,并且第二分析部分包括在优化期间重新计算其AT和RAT的门。 在这些部分之间的选定边界施加约束,以防止定时信息的不期望的传播,并确保优化期间使用的定时值的有效性。 通过这种选择,将降低对基础优化方法造成的问题的大小,从而允许更大的电路或系统被优化,并允许更快地执行优化。
    • 19. 发明授权
    • Method for distributing a set of objects in computer application
    • 在计算机应用程序中分发一组对象的方法
    • US06778999B2
    • 2004-08-17
    • US09976698
    • 2001-10-12
    • David J. Hathaway
    • David J. Hathaway
    • G06F1730
    • G06F17/5072G06F17/5045Y10S707/959Y10S707/99944Y10S707/99945
    • A method of determining redistribution of objects among three or more containers in a network comprises determining an initial set of objects in each of the containers, identifying neighboring pairs of containers, determining a cost of moving objects between each of the neighboring pairs of containers, determining a desired change in occupancy of each container, and subsequently determining a desired total size of a set of objects to be moved between each identified neighboring pair of containers by solving a set of simultaneous linear equations. The objects are redistributed among the neighboring pairs of containers in accordance with the solution. The objects may be clock sinks and the containers clock nets on a chip, or the objects may be circuits to be placed in an integrated circuit and the containers regions of the chip, or the objects may be data files and the containers individual network server computers.
    • 确定网络中的三个或更多个容器之间的对象再分配的方法包括确定每个容器中的对象的初始集合,识别相邻的容器对,确定在每个相邻容器对之间移动对象的成本,确定 每个容器的占有率的期望变化,并且随后通过求解一组联立线性方程来确定要在每个识别的相邻容器对之间移动的一组物体的期望总体尺寸。 根据解决方案,对象在相邻的容器对之间重新分配。 对象可以是时钟汇集器和芯片上的容器时钟网络,或者对象可以是被放置在集成电路中的电路,并且芯片的容器区域或对象可以是数据文件和容器单个网络服务器计算机 。