会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Method and apparatus for placement of input-output design objects into a programmable gate array
    • 用于将输入输出设计对象放置到可编程门阵列中的方法和装置
    • US06625795B1
    • 2003-09-23
    • US09866052
    • 2001-05-25
    • Jason H. AndersonJames L. SaundersMadabhushi V. R. ChariSudip K. NagRajeev Jayaraman
    • Jason H. AndersonJames L. SaundersMadabhushi V. R. ChariSudip K. NagRajeev Jayaraman
    • G06F1750
    • G06F17/5072H03K19/17744
    • A method and apparatus for placement into a programmable gate array of I/O design objects having different I/O attributes. The I/O attributes of an I/O design object define the electrical characteristics of the design object. The programmable gate array has a plurality of sites (IOBs) arranged into banks supporting a variety of electrical interface characteristics. In an example embodiment, I/O design objects are placed into IOBs of the programmable gate array by first performing simulated annealing that considers conflicts between I/O attributes of I/O design objects as placed into the IOBs. Then, a bipartite matching is performed using placement results from simulated annealing. Finally, if the bipartite matching does not produce a feasible placement, sets of I/O attributes are assigned to the banks based on the previous placement results, and the bipartite matching process is repeated.
    • 一种用于放置到具有不同I / O属性的I / O设计对象的可编程门阵列中的方法和装置。 I / O设计对象的I / O属性定义了设计对象的电气特性。 可编程门阵列具有布置成支持各种电接口特性的单元的多个位置(IOB)。 在示例实施例中,I / O设计对象通过首先执行模拟退火而被放置到可编程门阵列的IOB中,该模拟退火考虑了放置在IOB中的I / O设计对象的I / O属性之间的冲突。 然后,使用模拟退火的放置结果进行二分相匹配。 最后,如果二分配匹配不能产生可行的布局,那么根据先前的放置结果,将一组I / O属性分配给存储体,并重复二分配匹配过程。
    • 4. 发明授权
    • Method and apparatus for testing routability
    • 用于测试可布线性的方法和装置
    • US06877040B1
    • 2005-04-05
    • US09624716
    • 2000-07-25
    • Gi-Joon NamSandor S. KalmanJason H. AndersonRajeev JayaramanSudip K. NagJennifer Zhuang
    • Gi-Joon NamSandor S. KalmanJason H. AndersonRajeev JayaramanSudip K. NagJennifer Zhuang
    • G06F15/173
    • G06F17/5077G06F17/5054
    • A method and apparatus for determining routing feasibility of a plurality of nets. Each net has an associated set of one or more routing solutions, wherein each solution specifies one or more routing resources consumed by the net. A liveness Boolean function is generated having variables that represent respective net/solution pairs. If there exists a set of values for the variables such that at least one of the variables for each net is logically true, then the liveness function is true. An exclusivity function is generated using the variables that represent the net/solution pairs. If there exists at least one set of values for the variables such that no resource is used is by more than a predetermined number of nets, then the exclusivity function is true. The nets are routable using the provided solutions if there is one set of values for the variables such that both the liveness and exclusivity functions are true.
    • 一种用于确定多个网络的路由可行性的方法和装置。 每个网络具有一组或多个路由解决方案,其中每个解决方案指定网络所消耗的一个或多个路由资源。 生成具有表示相应的净/解对对的变量的活力布尔函数。 如果存在一组变量的值,使得每个网络的至少一个变量在逻辑上为真,那么活动函数为真。 使用表示网络/解决方案对的变量生成排他性功能。 如果存在变量的至少一组值,使得没有资源被使用超过预定数量的网络,则排他性功能是真实的。 如果有一组变量的值,使用提供的解决方案,网络可以路由,以使活动和排他性功能都是真实的。