共查询到18条相似文献,搜索用时 62 毫秒
1.
2.
3.
4.
二元判定图的有效描述将大大提高验证和测试生成效率。作者根据电路结构的特点,以标准门的BDD为基础,从原始输入到输出,通过逐级拼接,极有效地完成电路的BDD构造,另外根据验证和测试的需要,在BDD拼接过程中,提出通过可观值的定义获得有效路径的方法。 相似文献
5.
布尔函数的处理效果取决于布尔函数的表达形式,二元决策图(BDD:Binary decisiondiagram)是布尔函数的图的表达形式,它能对布尔函数进行高效处理。本文将阐述一种更加有效的布尔函数处理技术,它使用具有属性边的共享二元决策图(SBDD:Shared Binary Decision Diagram)。此方法包括对输入变量的编序算法和对任意项的处理方法。最后将给出用此方法进行布尔函数运算的实验结果。 相似文献
6.
7.
集成电路RT-Level功耗估计方法概论 总被引:1,自引:0,他引:1
随着便携式系统的出现,集成电路的功耗日渐成为人们普遍关心的一个问题。为了避免二次设计带来的损失,无论集成电路设计师还是芯片生产厂家都希望能够在较早的设计阶段对芯片的功耗进行准确地估计。集成电路的功耗估计方法主要分为两大类:静态估计和动态估计两种方法。本文对这两类方法进行了探讨,对每一类方法中现存典型的算法进行了介绍;并对如何计算Glitching Power进行了描述;对时序电路的功耗分析进行了探讨:最后对现存的问题进行了总结。 相似文献
8.
9.
10.
11.
通过分析传统事件树分析法在求解复杂系统可靠性时的不足,提出了一种基于二元决策图的事件树分析方法,主要讨论了各支点事件之间存在相关性的异常情况。二元决策图给出了故障树结构的二叉树的逻辑形式,用于描述系统失效的原因,并对系统顶事件进行分析。在对系统进行可靠性分析的过程中,由于不需要将最小割集和质蕴涵项作为中间步骤,从而提高了系统可靠性分析的效率和精度,为大型复杂系统的可靠性分析提供了一条新途径。 相似文献
12.
An ordered binary decision diagram (OBDD) is a canonical, graphical representation of a switching function. The space complexity of this representation as well as the time complexity for manipulating functions in this form is determained by the number of vertices in the OBDD. Symmetric functions are a class of functions which include the basic Boolean gates such as NOT, AND, NAND, NOR, XOR, etc., as well as less basic functions, such as voter logic for redundant circuit implementations. Symmetric functions exploit the most powerful properties of OBDDs to a very great extent. OBDDs have been shown to have size of O(n2), where n is the number of switching variables. However, this says little of the actual performance of OBDDs in practice. Exact equations of OBDD size are derived for the common classes of symmetric functions, as well as an exact equation for the largest OBDD that can exist for any arbitrary symmetric function. It is shown that OBDDs are (n
2) for the majority of functions from each common class of symmetric functions beyond the simplest Boolean gates. Since most functions can be expected to be more complex to represent than symmetric functions, this result has profound implications to the straightforward application of OBDDs to large functional problems.This work was supported by the National Science Foundation under Grant MIP-8552537. 相似文献
13.
14.
15.
The memristor is considered as the fourth fundamental circuit element along with resistor, capacitor and inductor. It is a two-terminal passive circuit element whose resistance value changes based on the amount of charge flowing through it. Another property of the memristor is that its resistance change is non-volatile in nature, and hence can be used for non-volatile memory applications. Researchers have been exploring memristors from various perspectives such as logic design and storage applications. In this paper, a slicing crossbar architecture for the efficient mapping of Boolean functions is proposed which exploits gate level parallelism using the memristor aided logic (MAGIC) design style. A Boolean function is first represented as a Binary Decision Diagram (BDD). The BDD nodes are expressed as netlists of NOR and NOT gates, and are mapped to the proposed slicing crossbar architecture with parallel node evaluation where possible. This is the first approach that combines BDD-based synthesis with MAGIC gate evaluation on memristor crossbar, while at the same time avoiding crossbar-related problems using a slicing architecture. Experimental evaluations on standard benchmark functions show considerable improvement in the solutions. 相似文献
16.
Let wt be a wire in a combinational Boolean network. There may exist a wire wa such that when wa is added and wt is removed, the overall circuit functionality is unchanged. Redundancy-addition-and-removal (RAR) is an efficient technique to find such a wa. The idea is to add a redundant alternative wire wa to make the target wire wt redundant. However, as long as the addition of wa together with the removal of wt does not change the overall functionality of the circuit, wires that are added and removed do not necessarily need to be redundant. This raises a question about the existence of alternative wires. Why can one wire replace another wire in a combinational Boolean network? In this paper, we analyze theoretically the existence of alternative wires and model it as an error-cancellation problem. The two existing rewiring techniques, the redundancy-addition-and-removal and the global flow optimization, are unified under the proposed generalized model. 相似文献
17.
18.
提出一种并行的决策树学习方法。该方法首先将数据库分为若干个子部分,针对每个子部分分别进行决策树学习,优选分裂属性,再对各个决策树学习的结果综合,生成最终的树。在树上剪枝以降低分类错误率。通过在变压器绝缘故障诊断中的应用表明该方法有很强的学习能力和诊断速度,是一种有效的决策树学习方法。 相似文献