IEICE TRANSACTIONS on Fundamentals
A Heuristic Algorithm for Boolean Factoring
Summary :
In this paper, an algorithm for Boolean factoring is presented. The algorithm is based on a technique of rectangle covering. A distinctive feature of the algorithm is that no minimization step is required to achieve Boolean factoring. The method for computing Boolean products rests on the concepts of super-product, extended kernel and extended co-kernel-cube matrix. Results of a comparison with the algorithms GOOD_FACTOR and QUICK_FACTOR implemented in SIS are presented. SIS is a program for logic synthesis developed at the University of Berkeley. All performed tests indicate that the proposed algorithm realizes a good tradeoff between factoring quality and computing time.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E81-A No.10 pp.2201-2211
- Publication Date
- 1998/10/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Category
- VLSI Design Technology and CAD
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Giuseppe CARUSO, "A Heuristic Algorithm for Boolean Factoring" in IEICE TRANSACTIONS on Fundamentals,
vol. E81-A, no. 10, pp. 2201-2211, October 1998, doi: .
Abstract: In this paper, an algorithm for Boolean factoring is presented. The algorithm is based on a technique of rectangle covering. A distinctive feature of the algorithm is that no minimization step is required to achieve Boolean factoring. The method for computing Boolean products rests on the concepts of super-product, extended kernel and extended co-kernel-cube matrix. Results of a comparison with the algorithms GOOD_FACTOR and QUICK_FACTOR implemented in SIS are presented. SIS is a program for logic synthesis developed at the University of Berkeley. All performed tests indicate that the proposed algorithm realizes a good tradeoff between factoring quality and computing time.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e81-a_10_2201/_p
Copy
@ARTICLE{e81-a_10_2201,
author={Giuseppe CARUSO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Heuristic Algorithm for Boolean Factoring},
year={1998},
volume={E81-A},
number={10},
pages={2201-2211},
abstract={In this paper, an algorithm for Boolean factoring is presented. The algorithm is based on a technique of rectangle covering. A distinctive feature of the algorithm is that no minimization step is required to achieve Boolean factoring. The method for computing Boolean products rests on the concepts of super-product, extended kernel and extended co-kernel-cube matrix. Results of a comparison with the algorithms GOOD_FACTOR and QUICK_FACTOR implemented in SIS are presented. SIS is a program for logic synthesis developed at the University of Berkeley. All performed tests indicate that the proposed algorithm realizes a good tradeoff between factoring quality and computing time.},
keywords={},
doi={},
ISSN={},
month={October},}
Copy
TY - JOUR
TI - A Heuristic Algorithm for Boolean Factoring
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2201
EP - 2211
AU - Giuseppe CARUSO
PY - 1998
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E81-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 1998
AB - In this paper, an algorithm for Boolean factoring is presented. The algorithm is based on a technique of rectangle covering. A distinctive feature of the algorithm is that no minimization step is required to achieve Boolean factoring. The method for computing Boolean products rests on the concepts of super-product, extended kernel and extended co-kernel-cube matrix. Results of a comparison with the algorithms GOOD_FACTOR and QUICK_FACTOR implemented in SIS are presented. SIS is a program for logic synthesis developed at the University of Berkeley. All performed tests indicate that the proposed algorithm realizes a good tradeoff between factoring quality and computing time.
ER -
English
