한국산업융합학회 논문집 (Journal of the Korean Society of Industry Convergence)
- 제3권1호
- /
- Pages.17-27
- /
- 2000
- /
- 1226-833X(pISSN)
- /
- 2765-5415(eISSN)
부울 분해식 산출 방법
Boolean Factorization
- 권오형 (위덕대학교 컴퓨터공학과)
- Kwon, Oh-Hyeong (Dept. of Computer Engineering, Uiduk University)
- 투고 : 1999.12.20
- 심사 : 2000.02.25
- 발행 : 2000.02.28
초록
A factorization is an extremely important part of multi-level logic synthesis. The number of literals in a factored form 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 build an extended co-kernel cube matrix using co-kernel/kernel pairs and kernel/kernel pairs together. The extended co-kernel cube matrix makes it possible to yield a Boolean factored form. We also propose a heuristic method for covering of the extended co-kernel cube matrix. Experimental results on various benchmark circuits show the improvements in literal counts over the algebraic factorization based on Brayton's co-kernel cube matrix.