Proceedings of the IEEK Conference (대한전자공학회:학술대회논문집)
- 2005.11a
- /
- Pages.849-852
- /
- 2005
Boolean Factorization Technique Using Two-cube Terms
2개의 곱항에서 공통인수를 이용한 논리 분해식 산출
- Kwon, Oh-Hyeong (Dept. of Internet Engineering, Hanseo University)
- 권오형 (한서대학교 인터넷공학과)
- Published : 2005.11.26
Abstract
A factorization is an extremely important part of multi-level logic synthesis. The number of literals in a factored from is a good estimate of the complexity of a logic function, and can be translated directly into the number of transistors required for implementation. Factored forms are described as either algebraic or Boolean, according to the trade-off between run-time and optimization. A Boolean factored form contains fewer number of literals than an algebraic factored form. In this paper, we present a new method for a Boolean factorization. The key idea is to identify two-cube Boolean subexpression pairs from given expression. Experimental results on various benchmark circuits show the improvements in literal counts over the algebraic factorization based on Brayton's co-kernel cube matrix.
Keywords