Boolean Extraction Technique Using Two-cube Divisors and Complements


The KIPS Transactions:PartA, Vol. 15, No. 1, pp. 9-16, Feb. 2008
10.3745/KIPSTA.2008.15.1.9,   PDF Download:

Abstract

This paper presents a new Boolean extraction technique for logic synthesis. This method extracts two-cube Boolean subexpression pairs from each logic expression. It begins by creating two-cube array, which is extended and compressed with complements of two-cube Boolean subexpressions. Next, the compressed two-cube array is analyzed to extract common subexpressions for several logic expressions. The method is greedy and extracts the best common subexpression. Experimental results show the improvements in the literal counts over well-known logic synthesis tools for some benchmark circuits.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
O. H. Kwon and I. G. Oh, "Boolean Extraction Technique Using Two-cube Divisors and Complements," The KIPS Transactions:PartA, vol. 15, no. 1, pp. 9-16, 2008. DOI: 10.3745/KIPSTA.2008.15.1.9.

[ACM Style]
Oh Hyeong Kwon and Im Geol Oh. 2008. Boolean Extraction Technique Using Two-cube Divisors and Complements. The KIPS Transactions:PartA, 15, 1, (2008), 9-16. DOI: 10.3745/KIPSTA.2008.15.1.9.