Benchmark circuit complexity validation using binary decision diagram characteristics

Mills,, Bruce and Prasad,, P. W. C and Prasad,, V. C. (2006) Benchmark circuit complexity validation using binary decision diagram characteristics. Benchmark circuit complexity validation using binary decision diagram characteristics. pp. 462-466.

Full text not available from this repository.

Abstract

It has been shown that when Binary Decision Diagrams (BDDs) are formed from uniformly distributed random Boolean Functions (BFs), the average number of nodes in the BDDs is in a simple relation to the number of variables and terms in the BFs. In the present work, the node counts for BBDs formed from ISCAS benchmark circuits are examined and compared to the results for random BFs. The model for random BFs is shown to have strong descriptive power for the benchmark data. Therefore, the model is promoted as a method of predicting, for a given BF, circuit complexity measures such as the area of a VLSI implementation.

Item Type: Article
Subjects: Q Science > QA Mathematics > QA75.5-76.95 Electronic computers. Computer science
Divisions: Faculty of Engineering and Technology (FET)
Depositing User: Ms Rosnani Abd Wahab
Date Deposited: 21 Sep 2011 08:13
Last Modified: 21 Sep 2011 08:13
URI: http://shdl.mmu.edu.my/id/eprint/2140

Actions (login required)

View Item View Item