Building Circuits from Relations [chapter]

James H. Kukula, Thomas R. Shiple
2000 Lecture Notes in Computer Science  
Given a Free BDD for the characteristic function of an input-output relation T (x, y), we show how to construct a combinational logic circuit satisfying that relation. Such relations occur as environmental constraints for module specifications, as parts of a proof strategies, or can be computed from existing circuits, e.g., by formal analysis of combinational cycles. The resulting circuit C can be used for further analysis, e.g. symbolic simulation, or to reformat a circuit as a logic
more » ... on tactic. The constructed circuit includes supplementary parametric inputs to allow all legal outputs to be generated in the case that T is non-deterministic. The structure of the circuit is isomorphic to that of the BDD for T , and hence is as compact as the BDD. In particular, when T represents a relation between bit vector integer values definable in Presburger arithmetic, the constructed circuit will have a regular bit slice form.
doi:10.1007/10722167_12 fatcat:mlqitban6jd4dayufhnssp2k64