Functional calculations using ordered partial multidecision diagrams
Don E. Ross, M. Ray Mercer · 1990
An ordered set of acyclic directed graphs, called Ordered Partial Multi Decision Diagrams for historical consistency, allows logic functions to be calculated very rapidly given an implementation of digital hardware described as an interconnection of primitive component functions (operators). Current research is being done on large combinational circuits described as an interconnection of logic gates, but the work can be extended beyond the Boolean domain to allow switches and states to be modeled. These graphs and techniques are generally exploitable where large amounts of functional results must be calculated and consolidated across large circuits. The result is an efficiently consumable graphical consolidation of the logical response at the circuit's outputs to a significant fraction (often all) of the possible logical input combinations to the circuit. Our technique has produced function calculation rates in excess of 10$\sp{22}$ unique implicants per cpu second on a single processor workstation.
Cited by 2 works.