#### Filter Results:

#### Publication Year

1994

2016

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

We propose an approach for decomposing Boolean satisfiability problems while extending recent results of [12] on solving Boolean systems of equations. Developments in [12] were aimed at the expansion of functions f in orthonormal (ON) sets of base functions as a generalization of the Boole-Shannon expansion and the derivation of the consistency condition… (More)

Given a CNF formula F , we present a new algorithm for deciding the satisfiability (SAT) of F and computing all solutions of assignments. The algorithm is based on the concept of cofactors known in the literature. This paper is a fallout of the previous work by authors on Boolean satisfiability [11, 12, 13], however the algorithm is essentially independent… (More)

—In the context of mapping high-level algorithms to hardware, we consider the basic problem of generating an efficient hardware implementation of a single threaded program, in particular, that of an inner loop. We describe a control-flow mechanism which provides dynamic loop-pipelining capability in hardware, so that multiple iterations of an arbitrary… (More)

- ‹
- 1
- ›