会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 61. 发明授权
    • Verification of logic circuit designs using dynamic clock gating
    • 使用动态时钟门控验证逻辑电路设计
    • US08302043B2
    • 2012-10-30
    • US12876319
    • 2010-09-07
    • Christian HabermannChristian JacobiMatthias PflanzHans-Werner TastRalf Winkelmann
    • Christian HabermannChristian JacobiMatthias PflanzHans-Werner TastRalf Winkelmann
    • G06F17/50
    • G06F17/5022G06F2217/78
    • A method and system for verifying a logic circuit design using dynamic clock gating is disclosed. The method comprises choosing at least one master seed to determine initial values as initialization for said logic circuit and/or stimuli data for at least one interface of said logic circuit, choosing at least two different dynamic clock gating configurations for every chosen master seed, executing a functional simulation with said logic circuit for every chosen dynamic clock gating configuration by using said determined initialization and/or stimuli data based on a corresponding master seed, comparing simulation results of functional simulations against each other executed with said logic circuit for at least two different chosen dynamic clock gating configurations, and reporting an error if said at least two simulation results are not identical.
    • 公开了一种使用动态时钟门控验证逻辑电路设计的方法和系统。 所述方法包括:选择至少一个主粒子以将初始值确定为所述逻辑电路的初始化和/或所述逻辑电路的至少一个接口的刺激数据,为每个所选择的主子选择至少两个不同的动态时钟选通配置,执行 通过使用基于对应的主子种的所述确定的初始化和/或刺激数据,针对每个所选择的动态时钟门控配置,利用所述逻辑电路进行功能仿真,将与所述逻辑电路执行的功能模拟的仿真结果相互比较,用于至少两个不同的 所选择的动态时钟门控配置,并且如果至少两个模拟结果不相同,则报告错误。
    • 62. 发明授权
    • Method and system for handling cache coherency for self-modifying code
    • 用于处理缓存一致性的自修改代码的方法和系统
    • US08015362B2
    • 2011-09-06
    • US12031923
    • 2008-02-15
    • Gregory W. AlexanderChristian JacobiBarry W. KrummChung-Lung Kevin ShumAaron Tsai
    • Gregory W. AlexanderChristian JacobiBarry W. KrummChung-Lung Kevin ShumAaron Tsai
    • G06F12/00
    • G06F12/0848G06F9/3812
    • A method for handling cache coherency includes allocating a tag when a cache line is not exclusive in a data cache for a store operation, and sending the tag and an exclusive fetch for the line to coherency logic. An invalidation request is sent within a minimum amount of time to an I-cache, preferably only if it has fetched to the line and has not been invalidated since, which request includes an address to be invalidated, the tag, and an indicator specifying the line is for a PSC operation. The method further includes comparing the request address against stored addresses of prefetched instructions, and in response to a match, sending a match indicator and the tag to an LSU, within a maximum amount of time. The match indicator is timed, relative to exclusive data return, such that the LSU can discard prefetched instructions following execution of the store operation that stores to a line subject to an exclusive data return, and for which the match is indicated.
    • 一种用于处理高速缓存一致性的方法包括当高速缓存行在存储操作的数据高速缓存中不排斥时分配标签,以及将该标签和该行的独占提取发送到一致性逻辑。 无效请求在最小时间内被发送到I缓存,优选地只有当它已经被取出到该行并且没有被无效时,因为哪个请求包括要被无效的地址,该标签和一个指示 线路用于PSC操作。 该方法还包括将请求地址与预取指令的存储地址进行比较,并且响应于匹配,在最大时间量内向LSU发送匹配指示符和标签。 匹配指示符相对于独占数据返回是定时的,使得LSU可以执行存储操作之后丢弃预取指令,存储到受独占数据返回的行,并且指示匹配。
    • 66. 发明授权
    • Method and system for case-splitting on nodes in a symbolic simulation framework
    • 符号仿真框架中节点分割的方法和系统
    • US07506290B2
    • 2009-03-17
    • US11963264
    • 2007-12-21
    • Christian JacobiGeert JanssenViresh ParuthiKai Oliver Weber
    • Christian JacobiGeert JanssenViresh ParuthiKai Oliver Weber
    • G06F9/45G06F17/50
    • G06F17/504
    • A method for performing verification includes receiving a design and building for the design an intermediate binary decision diagram set containing one or more nodes representing one or more variables. A first case-splitting is performed upon a first fattest variable from among the one or more variables represented by the one or more nodes by setting the first fattest variable to a primary value, and a first cofactoring is performed upon the intermediate binary decision diagram set with respect to the one or more nodes using an inverse of the primary value to generate a first cofactored binary decision diagram set. A second cofactoring is performed upon the intermediate binary decision diagram set with respect to the one or more nodes using the primary value to generate a second cofactored binary decision diagram set, and verification of the design is performed by evaluating a property of the second cofactored binary decision diagram set.
    • 用于执行验证的方法包括:为设计接收设计和构建包含表示一个或多个变量的一个或多个节点的中间二进制判定图集。 通过将第一个胖子变量设置为一个初始值,对由一个或多个节点表示的一个或多个变量中的第一个胖子变量执行第一个分解,并且对该中间二进制判定图集执行第一个共同构想 相对于使用主值的逆的一个或多个节点来生成第一辅因子二进制决策图集。 对相对于一个或多个节点设置的中间二进制判定图,使用主值来生成第二共有二元决策图集,执行第二共同构想,并且通过评估第二构成二进制的属性来执行设计的验证 决策图集。