面向多输出电路的BDD拼接构造
MULTIPLE OUTPUT CIRCUIT-BASED BDD ANALYSIS AND DESIGN
-
摘要: 二元判定图(Binary Decision Diagram,BDD)的有效描述将大大提高验证和测试生成效率。作者根据电路结构的特点,以标准门的BDD为基础,从原始输入到输出,通过逐级拼接,极有效地完成电路的BDD构造。另外根据验证和测试的需要,在BDD拼接过程中,提出通过可观值的定义获得有效路径的方法。实验证明,作者提出的方法简单、直观而且有效。Abstract: Effective description for Binary Decision Diagram(BDD) has proven useful in many applications as data structure for Boolean function. Based on the BDD of standard gate, recursive appending from primary input to output for BDD construction is proposed. Several benchmark circuits is shown to verify this method.
-
Lee C. Representation of switching circuits by BDDs. Bell Sys. Tech. J., 1959, 38(7): 985-999.[2]Bryant R E. Graph-based algorithms for Boolean function manipulation. IEEE Trans. on Comput,[3]86, 635(8): 677-691.[4]Brace K S.[J].Rudell R E, Bryant R E. Efficient implementation of a BDD package. Design Autometion8.1987,:-[5]Jain J.[J].et al. IBDDs: An efficient functional representation for digital circuits. Design Autometion9.1992,:-. IBDDs: An efficient functional representation for digital circuits. Design Autometion' target='_blank'>[6]Minato S.[J].Ishiura N, Yajima S. Shared BDD with attributed edge for efficient Boolean functional manipulation, DA9.1990,:- -
计量
- 文章访问数: 1984
- HTML全文浏览量: 93
- PDF下载量: 379
- 被引次数: 0
下载:
