会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 71. 发明申请
    • A METHOD FOR GENERATING OPTIMIZED CONSTRAINT SYSTEMS FOR RETIMABLE DIGITAL DESIGNS
    • 用于生成可反复数字设计的优化约束系统的方法
    • WO2005029262A2
    • 2005-03-31
    • PCT/US2004030409
    • 2004-09-17
    • CADENCE DESIGN SYSTEMS INC
    • GIDON ALEXANDERKNAPP DAVID
    • G06F20060101G06F7/38G06F17/50G06F
    • G06F17/505
    • A method for generating timing constraint systems, where the constrained object is a digital circuit., is provided, where the constraints are generated for the use of a digital logic optimization (synthesis) tool. The synthesis tool is used to optimize the circuit, under the applied constraints, so that the circuit exhibits certain desirable timing properties, while at the same time minimizing hardware cost and various other properties. The particular class of timing constraints generated by the disclosed invention is useful when the circuit is to be retimed after optimization. Typically, the joint use of the described invention and retiming results in improvements in the overall cost/performance tradeoff curve of the design. The invention comprises a method that comprises the following steps: (1) the flip-flops of the design are replaced with buffers having a negative delay whose magnitude is approximately the desired clock cycle time of the design; and (2) cycles in the design are broken using flip-flops having an infinite or quasi-infinite clock frequency. Following optimization by the synthesis tool, the temporary changes can be reverted, and retiming performed on the circuit.
    • 提供了一种用于产生定时约束系统的方法,其中约束对象是数字电路,其中为使用数字逻辑优化(综合)工具生成约束。 该合成工具用于在施加的约束条件下优化电路,使得电路具有某些期望的时序特性,同时最小化硬件成本和各种其它特性。 当所述电路在优化之后被重新定时时,由所公开的发明产生的特定类别的时序约束是有用的。 通常,联合使用所描述的发明和重新定时导致设计的整体成本/性能折衷曲线的改进。 本发明包括一种方法,其包括以下步骤:(1)设计的触发器被具有负延迟的缓冲器替换,其幅度近似为设计的期望时钟周期时间; 并且(2)设计中的周期使用具有无限或准无限时钟频率的触发器来断开。 通过综合工具进行优化后,可以恢复临时更改,并对电路进行重新定时。
    • 76. 发明申请
    • ASSERTION-BASED TRANSACTION RECORDING
    • 基于约定的交易记录
    • WO03100704A2
    • 2003-12-04
    • PCT/US0316996
    • 2003-05-28
    • CADENCE DESIGN SYSTEMS INC
    • MARSCHNER FRANZ ERICHLAWRENCE JAMES MWARD STEPHEN T
    • G06F17/50G06K
    • G06F17/5022
    • An assertion based transaction recording method is used to represent a signal-level transaction having a prefix and a suffix as an abstract transaction. The method models the signal-level transaction as an assertion requiring that the transaction suffix must occur following any occurrence of the transaction prefix. A finite-state-machine (FSM) implementation of the assertion records a tentative abstract transaction upon recognizing the first condition of the prefix. If the FSM recognizes that the prefix cannot complete, it cancels, or deletes, the tentative abstract transaction record. The implementation can track multiple tentative abstract transaction records that may co-exist prior to completion of the transaction prefix. Upon recognizing that the transaction prefix corresponding to the start point of the tentative abstract transaction has completed, the tentative abstract transaction record is committed. The FSM implementation of the assertion can then cancel all other outstanding tentative abstract transaction records.
    • 基于断言的事务记录方法用于表示具有前缀和后缀作为抽象事务的信号级事务。 该方法将信号级别事务建模为断言,要求事务后缀必须在事务前缀出现之后发生。 断言的有限状态机(FSM)实现在识别前缀的第一个条件时记录一个暂时的抽象事务。 如果FSM认识到前缀不能完成,则取消或删除暂定抽象事务记录。 该实现可以跟踪在交易前缀完成之前可能共存的多个临时抽象交易记录。 一旦认识到与暂定抽象事务的起始点相对应的事务前缀已经完成,则提交临时抽象事务记录。 断言的FSM实现可以取消所有其他未完成的暂定抽象交易记录。