Abstract
An approach for factoring general boolean functions was described in [5] which is based on graph partitioning algorithms. In this paper, we present a very fast algorithm for recognizing and factoring read-once functions which is needed as a dedicated factoring subroutine to handle the lower levels of that factoring process. The algorithm is based on algorithms for cograph recognition and on checking normality. Our method has been implemented in the SIS environment, and an empirical evaluation is given.
Original language | English |
---|---|
Pages (from-to) | 109-114 |
Number of pages | 6 |
Journal | Proceedings - Design Automation Conference |
DOIs | |
State | Published - 2001 |
Externally published | Yes |
Event | 38th Design Automation Conference - Las Vegas, NV, United States Duration: 18 Jun 2001 → 22 Jun 2001 |
Keywords
- Cograph
- Factoring
- Normality
- Read-once functions
ASJC Scopus subject areas
- Hardware and Architecture
- Control and Systems Engineering