Measuring Area-Complexity Using Boolean Difference

For a combinational circuit, area-complexity is a measure that estimates the logic area of the circuit without mapping to logic gates. Several measures like literal count, number of primary input/outputs, etc. have been used in the past as area-complexity metrics. In this paper, we propose a novel a...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	2013 26th International Conference on VLSI Design and 2013 12th International Conference on Embedded Systems S. 245 - 250
Hauptverfasser:	Kagliwal, A., Balachandran, S.
Format:	Tagungsbericht Journal Article
Sprache:	Englisch
Veröffentlicht:	IEEE 01.01.2013
Schlagworte:	Area measurement area-complexity Benchmark testing Boolean algebra Boolean difference Boolean functions Circuits Complexity theory Conferences Design engineering Integrated circuits Logic Logic gates logic synthesis Taylor series Very large scale integration
ISBN:	146734639X, 9781467346399
ISSN:	1063-9667
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!