Hardware Reference
In-Depth Information
the full flexibility. We show how such relations can be imposed by making some
internal variables external.
Chapter 14 introduces the problem of selecting a “minimum” reduction or
submachine of the largest solution. This is an introductory chapter about an open
problem that does not have yet a satisfactory solution. Once we have the largest
(or even a restricted) flexibility we need to select a deterministic behavior to
implement in place of the original one. We would like to choose such a solution
so that the final implemented logic is the best with respect to area, and/or delay,
testability, power consumption and so on. So we need “minimizers” to select
the best implementation; however, it is not obvious how to explore state-based
representations with cost functions defined at the gate-level, and this makes quite
difficult the task. For instance, a common criterion of selecting a deterministic
behavior is to find a state-based representation with a minimum number of states,
however this does not track necessarily well with a minimum area at the gate-level.
Search WWH ::




Custom Search