In this work, we analyzes the relationship between randomly generated Boolean function complexity and the number of nodes in benchmark circuits using the Binary Decision Diagrams (BDD). We generated BDDs for several ISCAS benchmark circuits and derived the area complexity measure in terms of number of nodes. We demonstrate that the benchmarks and randomly generated Boolean functions behave similarly in terms of area complexity. The experiments were extended to a large number of variables to verify the complexity behavior. It was confirmed that the rise of the complexity graph is only important to calculate the circuit complexities.
|Title of host publication||2nd International Conference on Education Technology and Computer (ICETC), 2010|
|Number of pages||5|
|Publication status||Published - 2010|
|Event||International Conference on Education Technology and Computer (ICETC) - Shanghai, China|
Duration: 22 Jun 2010 → 24 Jun 2010
|Conference||International Conference on Education Technology and Computer (ICETC)|
|Period||22/06/10 → 24/06/10|