Comparing simulations and graphical representations of complexities of benchmark and large-variable circuits

P. W.C. Prasad; Azam Beg; Ashutosh Kumar Singh

doi:10.1109/ICETC.2010.5529799

Comparing simulations and graphical representations of complexities of benchmark and large-variable circuits

P. W.C. Prasad, Azam Beg, Ashutosh Kumar Singh

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

Abstract: In this work, we analyzes the relationship between randomly generated BooIean 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 com plexities.

Original language	English
Title of host publication	ICETC 2010 - 2010 2nd International Conference on Education Technology and Computer
Pages	V5134-V5138
DOIs	https://doi.org/10.1109/ICETC.2010.5529799
Publication status	Published - 2010
Event	2010 2nd International Conference on Education Technology and Computer, ICETC 2010 - Shanghai, China Duration: Jun 22 2010 → Jun 24 2010

Publication series

Name	ICETC 2010 - 2010 2nd International Conference on Education Technology and Computer
Volume	5

Other

Other	2010 2nd International Conference on Education Technology and Computer, ICETC 2010
Country/Territory	China
City	Shanghai
Period	6/22/10 → 6/24/10

Keywords

Area complexity
Benchmark circuits
Binary decision diagram

ASJC Scopus subject areas

Computer Science (miscellaneous)
Education

Access to Document

10.1109/ICETC.2010.5529799

Cite this

Prasad, P. W. C., Beg, A., & Singh, A. K. (2010). Comparing simulations and graphical representations of complexities of benchmark and large-variable circuits. In ICETC 2010 - 2010 2nd International Conference on Education Technology and Computer (pp. V5134-V5138). Article 5529799 (ICETC 2010 - 2010 2nd International Conference on Education Technology and Computer; Vol. 5). https://doi.org/10.1109/ICETC.2010.5529799

Comparing simulations and graphical representations of complexities of benchmark and large-variable circuits. / Prasad, P. W.C.; Beg, Azam; Singh, Ashutosh Kumar.
ICETC 2010 - 2010 2nd International Conference on Education Technology and Computer. 2010. p. V5134-V5138 5529799 (ICETC 2010 - 2010 2nd International Conference on Education Technology and Computer; Vol. 5).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Prasad, PWC, Beg, A & Singh, AK 2010, Comparing simulations and graphical representations of complexities of benchmark and large-variable circuits. in ICETC 2010 - 2010 2nd International Conference on Education Technology and Computer., 5529799, ICETC 2010 - 2010 2nd International Conference on Education Technology and Computer, vol. 5, pp. V5134-V5138, 2010 2nd International Conference on Education Technology and Computer, ICETC 2010, Shanghai, China, 6/22/10. https://doi.org/10.1109/ICETC.2010.5529799

Prasad PWC, Beg A, Singh AK. Comparing simulations and graphical representations of complexities of benchmark and large-variable circuits. In ICETC 2010 - 2010 2nd International Conference on Education Technology and Computer. 2010. p. V5134-V5138. 5529799. (ICETC 2010 - 2010 2nd International Conference on Education Technology and Computer). doi: 10.1109/ICETC.2010.5529799

@inproceedings{9db6cd21a9ff42a4a687fd0397590234,

title = "Comparing simulations and graphical representations of complexities of benchmark and large-variable circuits",

abstract = "Abstract: In this work, we analyzes the relationship between randomly generated BooIean 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 com plexities.",

keywords = "Area complexity, Benchmark circuits, Binary decision diagram",

author = "Prasad, {P. W.C.} and Azam Beg and Singh, {Ashutosh Kumar}",

year = "2010",

doi = "10.1109/ICETC.2010.5529799",

language = "English",

isbn = "9781424463688",

series = "ICETC 2010 - 2010 2nd International Conference on Education Technology and Computer",

pages = "V5134--V5138",

booktitle = "ICETC 2010 - 2010 2nd International Conference on Education Technology and Computer",

note = "2010 2nd International Conference on Education Technology and Computer, ICETC 2010 ; Conference date: 22-06-2010 Through 24-06-2010",

}

TY - GEN

T1 - Comparing simulations and graphical representations of complexities of benchmark and large-variable circuits

AU - Prasad, P. W.C.

AU - Beg, Azam

AU - Singh, Ashutosh Kumar

PY - 2010

Y1 - 2010

N2 - Abstract: In this work, we analyzes the relationship between randomly generated BooIean 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 com plexities.

AB - Abstract: In this work, we analyzes the relationship between randomly generated BooIean 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 com plexities.

KW - Area complexity

KW - Benchmark circuits

KW - Binary decision diagram

UR - http://www.scopus.com/inward/record.url?scp=77956079196&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77956079196&partnerID=8YFLogxK

U2 - 10.1109/ICETC.2010.5529799

DO - 10.1109/ICETC.2010.5529799

M3 - Conference contribution

AN - SCOPUS:77956079196

SN - 9781424463688

T3 - ICETC 2010 - 2010 2nd International Conference on Education Technology and Computer

SP - V5134-V5138

BT - ICETC 2010 - 2010 2nd International Conference on Education Technology and Computer

T2 - 2010 2nd International Conference on Education Technology and Computer, ICETC 2010

Y2 - 22 June 2010 through 24 June 2010

ER -

Comparing simulations and graphical representations of complexities of benchmark and large-variable circuits

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this