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...

Full description

Saved in:

Bibliographic Details
Published in:	2013 26th International Conference on VLSI Design and 2013 12th International Conference on Embedded Systems pp. 245 - 250
Main Authors:	Kagliwal, A., Balachandran, S.
Format:	Conference Proceeding Journal Article
Language:	English
Published:	IEEE 01.01.2013
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!