144 search results - page 9 / 29 » Representations of Logic Functions Using QRMDDs |
ICCD
2000
IEEE
15 years 7 months ago
2000
IEEE
This paper presents a new method to extract functionally equivalent structures from logic netlists. It uses a fast functional regularity extraction algorithm based on structural e...
121
click to vote
ICFP
2012
ACM
13 years 23 days ago
2012
ACM
This paper presents a new functional programming model for graph structures called structured graphs. Structured graphs extend conventional algebraic datatypes with explicit defi...
ICCAD
2002
IEEE
15 years 7 months ago
2002
IEEE
In this paper we present an advanced functional extraction tool for automatic generation of high-level RTL from switch-level circuit netlist representation. The tool is called FEV...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
This paper presents a toolkit for spreadsheet visualization based on logical areas, semantic classes and data Logical areas, semantic classes and data modules are abstract represe...
132
click to vote
CC
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...