141 search results - page 7 / 29 » Boolean Function Representation Using Parallel-Access Diagra... |
ECBS
2007
IEEE
14 years 1 months ago
2007
IEEE
The paper addresses software implementation of large sparse systems of Boolean functions. Fast evaluation of such functions with the smallest memory consumption is often required ...
GLVLSI
2002
IEEE
13 years 11 months ago
2002
IEEE
Spectral techniques have found many applications in computeraided design, including synthesis, verification, and testing. Decision diagram representations permit spectral coeffici...
STACS
2001
Springer
13 years 11 months ago
2001
Springer
Abstract. Ordered binary decision diagrams (OBDDs) nowadays belong to the most common representation types for Boolean functions. Although they allow important operations such as s...
SAS
1999
Springer
13 years 11 months ago
1999
Springer
Abstract. Binary Decision Graphs are an extension of Binary Decision Diagrams that can represent some infinite boolean functions. Three refinements of BDGs corresponding to class...
JSW
2007
13 years 6 months ago
2007
— The paper addresses software and firmware implementation of multiple-output Boolean functions based on cascades of Look-Up Tables (LUTs). A LUT cascade is described as a means ...