面向多輸出電路的BDD拼接構(gòu)造
MULTIPLE OUTPUT CIRCUIT-BASED BDD ANALYSIS AND DESIGN
-
摘要: 二元判定圖(Binary Decision Diagram,BDD)的有效描述將大大提高驗證和測試生成效率。作者根據(jù)電路結(jié)構(gòu)的特點,以標(biāo)準(zhǔn)門的BDD為基礎(chǔ),從原始輸入到輸出,通過逐級拼接,極有效地完成電路的BDD構(gòu)造。另外根據(jù)驗證和測試的需要,在BDD拼接過程中,提出通過可觀值的定義獲得有效路徑的方法。實驗證明,作者提出的方法簡單、直觀而且有效。
-
關(guān)鍵詞:
- 標(biāo)準(zhǔn)門; BDD; 節(jié)點; 共享; 變量排序
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,:- -
計量
- 文章訪問數(shù): 2011
- HTML全文瀏覽量: 103
- PDF下載量: 382
- 被引次數(shù): 0