8 search results - page 1 / 2 » A method to decompose multiple-output logic functions |
DAC
2004
ACM
14 years 5 months ago
2004
ACM
This paper shows a method to decompose a given multipleoutput circuit into two circuits with intermediate outputs. We use a BDD for characteristic function (BDD for CF) to represe...
ITCC
2002
IEEE
13 years 9 months ago
2002
IEEE
: Since modern programmable devices contain embedded memory blocks, there exists a possibility to implement Finite State Machines (FSM) using such blocks. The size of the memory av...
DAC
2008
ACM
14 years 5 months ago
2008
ACM
Boolean function bi-decomposition is a fundamental operation in logic synthesis. A function f(X) is bi-decomposable under a variable partition XA, XB, XC on X if it can be written...
ICCAD
2008
IEEE
14 years 1 months ago
2008
IEEE
Functional decomposition is a fundamental operation in logic synthesis. Prior BDD-based approaches to functional decomposition suffer from the memory explosion problem and do not...
FTRTFT
1994
Springer
13 years 8 months ago
1994
Springer
We specify the black box behavior of dataflow components by characterizing the relation between their input and their output histories. We distinguish between three main classes of...