会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明授权
    • Parallel signal routing
    • 并行信号路由
    • US08201130B1
    • 2012-06-12
    • US12939732
    • 2010-11-04
    • Sandor S. KalmanVinay VermaGitu JainTaneem AhmedSanjeev Kwatra
    • Sandor S. KalmanVinay VermaGitu JainTaneem AhmedSanjeev Kwatra
    • G06F17/50
    • G06F17/5077G06F17/5054
    • A method is provided for routing a circuit design netlist. Nets of the netlist are grouped into a plurality of sub-netlists. For each sub-netlist, nets of the sub-netlist are routed as a function of congestion between nets of the sub-netlist. Congestion between nets of other sub-netlists in the plurality of sub-netlists is not taken into account. If two or more nets of the netlist are routed through the same routing resource, a global congestion history data set is updated to describe congestion between all nets in the netlist, and the two or more nets of the netlist are unrouted. The two or more nets are each rerouted as a function of the global congestion history data set and congestion between nets of the same sub-netlist as the net.
    • 提供了一种用于布线电路设计网表的方法。 网表的网络被分组成多个子网表。 对于每个子网表,子网表的网络作为子网表的网络之间的拥塞的功能被路由。 不考虑多个子网表中其他子网表的网络之间的拥塞。 如果网表的两个或多个网络通过相同的路由资源路由,则更新全局拥塞历史数据集,以描述网表中所有网之间的拥塞,并且网表的两个或多个网是未路由的。 两个或更多个网络每个被重新路由为全局拥塞历史数据集的功能和与网络相同的子网表的网络之间的拥塞。
    • 5. 发明授权
    • State splitting for level reduction
    • 国家分裂降级
    • US5617573A
    • 1997-04-01
    • US247445
    • 1994-05-23
    • Alan Y. HuangSteven K. KnappSanjeev Kwatra
    • Alan Y. HuangSteven K. KnappSanjeev Kwatra
    • G06F17/50G11C13/00
    • G06F17/5054
    • A method of state splitting in a state machine includes determining a number N of logic levels, i.e. CLB levels, for each state in a state machine. Number N is equal to N.sub.i-1 +log.sub.k f.sub.i wherein "k" is the number of input lines to a CLB, "i" is a particular node in a particular hierarchial level in the Boolean logic, and "f" is the number of fanin transitions to the particular node. An average number N(AV) as well as a maximum number N(MAX) of CLBs to implement the states in the state machine are also determined. Then, predetermined exit criteria are checked. One exit criterion includes determining that the maximum number N(MAX) is not associated with a state register, but is instead associated with an output, for example. Another exit criterion includes providing a ratio by dividing the maximum number N(MAX) by the average number N(AV). If the ratio is less than or equal to a split-factor, then this exit criterion is met. In one embodiment, the split factor is between 1.5 and 2.0. Yet another exit criterion includes determining that the state being analyzed has one or two fanin transitions. If none of the exit criteria are met, then the state associated with the maximum number N(MAX) is split into at least two states. The method is further optimized by repeating all steps until at least one exit criterion is met. State splitting in accordance with the present invention typically reduces the levels of CLBs by approximately 20%, thereby significantly reducing delay in the state machine.
    • 在状态机中的状态分割的方法包括为状态机中的每个状态确定逻辑电平数目N,即CLB电平。 数字N等于Ni-1 + logk fi,其中“k”是到CLB的输入行数,“i”是布尔逻辑中特定层次级别中的特定节点,“f”是 fanin转换到特定节点。 还确定了在状态机中实现状态的平均数N(AV)以及最大数目N(MAX)的CLB。 然后,检查预定的退出标准。 一个退出标准包括确定最大数量N(MAX)不与状态寄存器相关联,而是例如与输出相关联。 另一个退出标准包括通过将最大数N(MAX)除以平均数N(AV)来提供比率。 如果比率小于或等于分割因子,则满足该退出条件。 在一个实施例中,分裂因子在1.5和2.0之间。 另一个退出标准包括确定被分析的状态具有一个或两个扇区转换。 如果没有符合退出条件,则与最大数N(MAX)相关联的状态被分成至少两个状态。 该方法通过重复所有步骤进一步优化,直到满足至少一个退出标准。 根据本发明的状态分割通常将CLB的水平降低大约20%,从而显着地减少状态机的延迟。
    • 6. 发明授权
    • Congestion elimination using adaptive cost schedule to route signals within an integrated circuit
    • 拥塞消除使用自适应成本计划来路由集成电路内的信号
    • US08122420B1
    • 2012-02-21
    • US12489302
    • 2009-06-22
    • Parivallal KannanSanjeev Kwatra
    • Parivallal KannanSanjeev Kwatra
    • G06F17/50
    • G06F17/5077
    • A computer-implemented method of routing a circuit design for a target integrated circuit (IC) can include determining a characterization of routing congestion of the circuit design within the target IC and determining a first order cost component of using routing resources of the target IC according to the characterization. The method can include determining a higher order cost component of using routing resources of the target IC according to the characterization and assigning signals of the circuit design to routing resources according to costs calculated using the first order cost component and the higher order cost component. Signal assignments of the circuit design can be output.
    • 用于路由目标集成电路(IC)的电路设计的计算机实现的方法可以包括确定目标IC内的电路设计的路由拥塞的表征,并且根据目标IC的路由资源确定使用目标IC的路由资源的一阶成本分量 表征。 该方法可以包括根据表征确定使用目标IC的路由资源的较高阶成本分量,并根据使用第一阶成本分量和较高阶成本分量计算的成本将电路设计的信号分配给路由资源。 可以输出电路设计的信号分配。