会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 53. 发明授权
    • Method for verifying performance of an array by simulating operation of edge cells in a full array model
    • 通过模拟全阵列模型中边缘单元的操作来验证阵列的性能的方法
    • US07424691B2
    • 2008-09-09
    • US11279312
    • 2006-04-11
    • Vikas AgarwalMichael Ju Hyeok LeePhilip G. Shephard, III
    • Vikas AgarwalMichael Ju Hyeok LeePhilip G. Shephard, III
    • G06F17/50G11C29/00
    • G06F17/5022
    • A method for verifying performance of an array by simulating operation of edge cells in a full array model reduces the computation time required for complete design verification. The edge cells of the array (or each subarray if the array is partitioned) are subjected to a timing simulation while the center cells of the array are logically disabled, but remain in the circuit model, providing proper loading. Additional cells are specified for simulation if calculations indicate a worst-case condition due to a non-edge cell. Wordline arrivals are observed to determine worst-case rows for selection. For write operations, the difference between the wordline edges and the data edges is used to locate any non-edge “outlier” cells. For read operations, the wordline delays are summed with the bitline delays determined from edge column data to locate any outliers.
    • 通过模拟全阵列模型中边缘单元的操作来验证阵列的性能的方法减少了完整设计验证所需的计算时间。 阵列的边缘单元(或阵列分割的每个子阵列)经受定时仿真,而阵列的中心单元在逻辑上被禁用,但保留在电路模型中,从而提供适当的加载。 如果计算指示由于非边缘单元造成的最坏情况,则指定额外的单元用于模拟。 观察到字线到达以确定最坏情况行进行选择。 对于写入操作,字边和数据边之间的差异用于定位任何非边缘“异常值”单元。 对于读取操作,字线延迟与从边沿列数据确定的位线延迟相加以定位任何异常值。
    • 54. 发明申请
    • Method and System for Dependency Tracking and Flush Recovery for an Out-Of-Order Microprocessor
    • 用于无序微处理器的依赖跟踪和冲洗恢复的方法和系统
    • US20080189535A1
    • 2008-08-07
    • US11669999
    • 2007-02-01
    • Vikas AgarwalWilliam E. BurkyKrishnan KailasBalaram Sinharoy
    • Vikas AgarwalWilliam E. BurkyKrishnan KailasBalaram Sinharoy
    • G06F9/30
    • G06F9/3842G06F9/3863
    • A method for dependency tracking and flush recovery for an out-of-order processor includes recording, in a last definition (DEF) data structure, an identifier of a first instruction as the most recent instruction in an instruction sequence that defines contents of the particular logical register and recording, in a next DEF data structure, the identifier of the first instruction in association with an identifier of a previous second instruction also indicating an update to the particular logical register. In addition, a recovery array is updated to indicate which of the instructions in the instruction sequence updates each of the plurality of logical registers. In response to misspeculation during execution of the instruction sequence, the processor performs a recovery operation to place the identifier of the second instruction in the last DEF data structure by reference to the next DEF data structure and the recovery array.
    • 用于无序处理器的依赖性跟踪和刷新恢复的方法包括在最后定义(DEF)数据结构中记录第一指令的标识符作为指定序列中的最新指令,其定义特定的内容 在下一个DEF数据结构中,逻辑寄存器和记录与第一指令的标识符相关联,该标识符还指示特定逻辑寄存器的更新。 此外,更新恢复阵列以指示指令序列中的哪些指令更新多个逻辑寄存器中的每一个。 响应于执行指令序列期间的错误,处理器执行恢复操作,以通过参考下一个DEF数据结构和恢复阵列将第二指令的标识符放置在最后的DEF数据结构中。
    • 59. 发明授权
    • Statistical method for hierarchically routing layout utilizing flat route information
    • 使用平面路由信息分层布线布局的统计方法
    • US08356267B2
    • 2013-01-15
    • US12912819
    • 2010-10-27
    • Vikas AgarwalYonatan MittlefehldtJafar Nahidi
    • Vikas AgarwalYonatan MittlefehldtJafar Nahidi
    • G06F17/50
    • G06F17/5077
    • An integrated circuit design is routed by first creating temporary routes in a flattened layout, generating blockage information for sub-blocks in the layout based on the temporary routes, and establishing a routing order for cells using a depth-first search. Cells in the original layout are then routed according to the routing order using the blockage information. The temporary routes are sorted into internal routes, terminal routes, and spanning routes. Blockage information for each sub-block includes a first cellview equal to the internal routes, a second cellview equal to the terminal routes plus the spanning routes, and a third cellview equal to the total tracks in the sub-block minus the first and second cellviews. The invention is particularly suited for routing a hierarchical integrated circuit design. By examining the complete hierarchy, the invention ensures that enough metal will be remaining at upper level sub-blocks to complete the routing automatically.
    • 通过首先在平坦化布局中创建临时路由来路由集成电路设计,基于临时路由生成布局中的子块的阻塞信息,以及使用深度优先搜索来建立小区的路由顺序。 然后使用阻塞信息,根据路由顺序路由原始布局中的单元。 临时路由分为内部路由,终端路由和跨越路由。 每个子块的阻塞信息包括等于内部路由的第一小区视图,等于终端路由加上跨越路由的第二小区视图,以及等于子块中的总轨迹的第三小区视图减去第一和第二小区视图 。 本发明特别适用于布线分级集成电路设计。 通过检查完整的层次结构,本发明确保在上级子块中剩余足够的金属以自动完成路由。
    • 60. 发明申请
    • STATISTICAL METHOD FOR HIERARCHICALLY ROUTING LAYOUT UTILIZING FLAT ROUTE INFORMATION
    • 使用平坦路径信息进行层次分层布局的统计方法
    • US20120110536A1
    • 2012-05-03
    • US12912819
    • 2010-10-27
    • Vikas AgarwalYonatan MittlefehldtJafar Nahidi
    • Vikas AgarwalYonatan MittlefehldtJafar Nahidi
    • G06F17/50
    • G06F17/5077
    • An integrated circuit design is routed by first creating temporary routes in a flattened layout, generating blockage information for sub-blocks in the layout based on the temporary routes, and establishing a routing order for cells using a depth-first search. Cells in the original layout are then routed according to the routing order using the blockage information. The temporary routes are sorted into internal routes, terminal routes, and spanning routes. Blockage information for each sub-block includes a first cellview equal to the internal routes, a second cellview equal to the terminal routes plus the spanning routes, and a third cellview equal to the total tracks in the sub-block minus the first and second cellviews. The invention is particularly suited for routing a hierarchical integrated circuit design. By examining the complete hierarchy, the invention ensures that enough metal will be remaining at upper level sub-blocks to complete the routing automatically.
    • 通过首先在平坦化布局中创建临时路由来路由集成电路设计,基于临时路由生成布局中的子块的阻塞信息,以及使用深度优先搜索来建立小区的路由顺序。 然后使用阻塞信息,根据路由顺序路由原始布局中的单元。 临时路由分为内部路由,终端路由和跨越路由。 每个子块的阻塞信息包括等于内部路由的第一小区视图,等于终端路由加上跨越路由的第二小区视图,以及等于子块中的总轨迹的第三小区视图减去第一和第二小区视图 。 本发明特别适用于布线分级集成电路设计。 通过检查完整的层次结构,本发明确保在上级子块中剩余足够的金属以自动完成路由。