会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Using layout enumeration to facilitate integrated circuit development
    • 使用布局枚举来促进集成电路开发
    • US08443322B2
    • 2013-05-14
    • US12406996
    • 2009-03-19
    • Philip N. StrenskiMark A. Lavin
    • Philip N. StrenskiMark A. Lavin
    • G06F17/50G06F9/455G06F11/22
    • G06F17/5068
    • A method for using layout enumeration to facilitate integrated circuit development includes defining an initial set of design ground rules represented in a notation compatible with a coarse placement grid, for a given layer(s) of an integrated circuit device; defining an initial region of interest for the integrated circuit device; enumerating, according to the initial set of design ground rules, each legal design layout for a given layer of the integrated circuit device in the initial region of interest; running a manufacturing simulation of the enumerated legal design layout data and, responsive to determining one or more failing layouts resulting therefrom, further determining whether the failing layouts may be eliminated by changes in technology parameters and/or updated ground rules. Upon eliminating the one or more failing layouts for the initial region of interest, expanding the initial region of interest and repeating the enumerating, manufacturing simulation, and triage assessment.
    • 一种用于使用布局枚举以促进集成电路开发的方法包括:为集成电路器件的给定层定义以与粗放置网格兼容的符号表示的设计基准规则的初始集合; 定义集成电路器件的初始感兴趣区域; 列举根据初始设计基准规则,每个法定设计布局为集成电路设备在给定层的初始区域感兴趣; 运行枚举的法律设计布局数据的制造模拟,并且响应于确定由此产生的一个或多个故障布局,进一步确定是否可以通过技术参数和/或更新的基本规则的改变来消除故障布局。 在消除初始感兴趣区域的一个或多个失败的布局后,扩展初始的兴趣区域,并重复枚举,制造模拟和分类评估。
    • 2. 发明申请
    • Method For Performing A Parallel Static Timing Analysis Using Thread-Specific Sub-Graphs
    • 使用线程特定子图执行并行静态时序分析的方法
    • US20120311515A1
    • 2012-12-06
    • US13151295
    • 2011-06-02
    • Vladimir ZolotovDavid J. HathawayKerim KalafalaMark A. LavinPeihua Qi
    • Vladimir ZolotovDavid J. HathawayKerim KalafalaMark A. LavinPeihua Qi
    • G06F9/455
    • G06F17/5031G06F8/20G06F2217/84
    • A method for efficient multithreaded analysis of a timing graph is described. The method is applicable to multithreaded common path pessimism removal, critical path traversing for timing report generation, and other types of analysis requiring traversal of sub-graphs of timing graph. In order to achieve high efficiency and scalability for parallel multithreaded execution, the number of access locks is minimized. One parent computation thread and multiple child threads are employed. The parent computational thread identifies the tasks for analysis and distributes them among child threads. Each child thread identifies a sub-graph to be analyzed, creates a thread-specific replica of the identified sub-graph, and performs the analysis required. After completing the analysis, the child thread transfers the results back to the main timing graph and waits for next task. As all data structures of each child thread are accessed only by the child thread owing them, no access locks are required for construction and processing of thread specific graph replica of the timing sub-graph. The construction of each thread specific graph replica is performed by the child thread without locking the main timing graph data structures. Access locks are used only for transferring results of the analysis back to the main timing graph where the results computed by all child threads are combined together.
    • 描述了一种用于定时图的有效多线程分析的方法。 该方法适用于多线程公共路径悲观消除,定时报告生成的关键路径遍历以及需要遍历时序图子图的其他类型分析。 为了实现并行多线程执行的高效率和可扩展性,访问锁的数量最小化。 使用一个父计算线程和多个子线程。 父计算线程识别用于分析的任务,并在子线程之间分配它们。 每个子线程标识要分析的子图,创建所识别的子图的线程特定副本,并执行所需的分析。 完成分析后,子线程将结果传回主时序图,等待下一个任务。 由于每个子线程的所有数据结构仅由它们的子线程访问,所以不需要访问锁来构建和处理定时子图的线程特定图形副本。 每个线程特定图形副本的构造由子线程执行,而不锁定主时序图数据结构。 访问锁仅用于将分析结果传回主时序图,其中所有子线程计算的结果组合在一起。
    • 5. 发明申请
    • RENDERING A MASK USING COARSE MASK REPRESENTATION
    • 使用粗糙表示渲染一个掩码
    • US20090180711A1
    • 2009-07-16
    • US12015084
    • 2008-01-16
    • Mark A. LavinMaharaj MukherjeeAlan E. Rosenbluth
    • Mark A. LavinMaharaj MukherjeeAlan E. Rosenbluth
    • G06K9/36
    • G03F7/705G03F1/36
    • A method, system and computer program product for rendering a mask are disclosed. A method of rendering a mask may comprise: providing an initial mask design for a photolithographic process, the initial mask design including polygons; initially rendering the initial mask design as a coarse mask representation in a pixel based image calculation; identifying an overhang portion; and rendering the overhang portion using a set of subpixels whose artifacts from spatial-localization lie outside a practical resolution of a pseudo lens having a numerical aperture larger than that of a projection lens used in the photolithographic process; and updating the initial rendering based on the overhang portion rendering.
    • 公开了一种用于渲染掩模的方法,系统和计算机程序产品。 渲染掩模的方法可以包括:提供用于光刻工艺的初始掩模设计,初始掩模设计包括多边形; 最初在基于像素的图像计算中将初始掩模设计呈现为粗糙掩模表示; 识别突出部分; 并且使用一组子空间渲染悬伸部分,其中来自空间定位的伪像位于具有大于在光刻工艺中使用的投影透镜的数值孔径的假透镜的实际分辨率之外; 并基于突出部分呈现来更新初始呈现。