会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 5. 发明授权
    • Method for reducing wiring congestion in a VLSI chip design
    • 降低VLSI芯片设计中布线拥塞的方法
    • US06958545B2
    • 2005-10-25
    • US10755590
    • 2004-01-12
    • Pooja M. KotechaRama Gopal GandhamRuchir PuriLouise H. TrevillyanAdam P. Matheny
    • Pooja M. KotechaRama Gopal GandhamRuchir PuriLouise H. TrevillyanAdam P. Matheny
    • G06F17/50H01L23/52H01L29/40
    • G06F17/5077
    • A system and method for correcting wiring congestion in a placed and partially or fully globally-routed VLSI chip design while avoiding adding new timing or electrical violations or other design constraints. Globally-congested areas are identified along with determining terminated and non-terminated wires in the congested areas. The process includes optimizing the identified congestion areas, incrementally rerouting affected nets, testing the resultant design legality and congestion metrics, and committing or reversing the optimizations and reroutings. The optimizations further includes the movement of logic cells and decomposition, recomposition or any other modification of logic cell structures (possibly combined with cell movement) to move terminated wires to less congested grid edges, rearrangement of commutative connections within or between cells, or addition of buffers to cause reroutes of feedthrough wires.
    • 一种用于校正放置和部分或全部全局路由VLSI芯片设计中的布线拥塞的系统和方法,同时避免添加新的定时或电气违规或其他设计约束。 识别全局拥挤区域以及在拥堵区域中确定终止的和未终止的电线。 该过程包括优化识别的拥塞区域,逐步重新路由受影响的网络,测试所得到的设计合法性和拥塞度量,以及提交或反转优化和重新排序。 优化还包括逻辑单元的移动以及逻辑单元结构(可能与单元移动相结合)的分解,重组或任何其它修改,以将终止的引线移动到较不拥塞的网格边缘,在单元之内或之间重新排列交换连接,或者添加 缓冲器引起馈通线的重新路由。
    • 6. 发明申请
    • SYSTEM AND METHOD FOR SIGN-OFF TIMING CLOSURE OF A VLSI CHIP
    • VLSI芯片的关闭时序关闭的系统和方法
    • US20080209376A1
    • 2008-08-28
    • US11680110
    • 2007-02-28
    • Michael A. KazdaPooja M. KotechaAdam P. MathenyLakshmi ReddyLouise H. TrevillyanPaul G. Villarrubia
    • Michael A. KazdaPooja M. KotechaAdam P. MathenyLakshmi ReddyLouise H. TrevillyanPaul G. Villarrubia
    • G06F17/50
    • G06F17/5068G06F2217/84
    • A method for performing timing optimization of a detail routed netlist, incorporating statistical variability information, common path pessimism reduction, and capacitative coupling information, in a tightly coupled, incremental manner with minimal perturbations to the placement, routing, and asserted parasitic information. The method corrects violations in a placed and routed design of a VLSI circuit chip, where the design is represented by a netlist describing logical and physical characteristics of the design and by a corresponding timing graph, the method including the steps of: identifying violations in the design; iteratively eliminating the violations by incrementally transforming the logical and the physical characteristics of the design, incorporating in the design only legal placements and routes; and applying incremental timing to evaluate the transformations, and updating the existing timing graphs to reflect changes consisting of the legal placements and routes.
    • 一种用于以紧密耦合的递增方式对细节路由网表执行定时优化的方法,其以最小的扰动对放置,路由和断言的寄生信息进行并入,并入统计变异信息,公共路径悲观度降低和电容耦合信息。 该方法校正了VLSI电路芯片的放置和路由设计中的违规,其中设计由描述设计的逻辑和物理特性的网表以及对应的时序图表示,该方法包括以下步骤:识别 设计; 通过逐步改变设计的逻辑和物理特征,迭代地消除违规行为,仅在设计中纳入合法的布局和路线; 并应用增量时间来评估变革,并更新现有的时间图,以反映由法定刊登位置和路线组成的变更。
    • 7. 发明授权
    • System and method for sign-off timing closure of a VLSI chip
    • 用于签发VLSI芯片的定时关闭的系统和方法
    • US07581201B2
    • 2009-08-25
    • US11680110
    • 2007-02-28
    • Michael A. KazdaPooja M. KotechaAdam P. MathenyLakshmi ReddyLouise H. TrevillyanPaul G. Villarrubia
    • Michael A. KazdaPooja M. KotechaAdam P. MathenyLakshmi ReddyLouise H. TrevillyanPaul G. Villarrubia
    • G06F17/50
    • G06F17/5068G06F2217/84
    • A method for performing timing optimization of a detail routed netlist, incorporating statistical variability information, common path pessimism reduction, and capacitative coupling information, in a tightly coupled, incremental manner with minimal perturbations to the placement, routing, and asserted parasitic information. The method corrects violations in a placed and routed design of a VLSI circuit chip, where the design is represented by a netlist describing logical and physical characteristics of the design and by a corresponding timing graph, the method including the steps of: identifying violations in the design; iteratively eliminating the violations by incrementally transforming the logical and the physical characteristics of the design, incorporating in the design only legal placements and routes; and applying incremental timing to evaluate the transformations, and updating the existing timing graphs to reflect changes consisting of the legal placements and routes.
    • 一种用于以紧密耦合的递增方式对细节路由网表执行定时优化的方法,其以最小的扰动对放置,路由和断言的寄生信息进行并入,并入统计变异信息,公共路径悲观度降低和电容耦合信息。 该方法校正了VLSI电路芯片的放置和路由设计中的违规,其中设计由描述设计的逻辑和物理特性的网表以及对应的时序图表示,该方法包括以下步骤:识别 设计; 通过逐步改变设计的逻辑和物理特征,迭代地消除违规行为,仅在设计中纳入合法的布局和路线; 并应用增量时间来评估变革,并更新现有的时间图,以反映由法定刊登位置和路线组成的变更。