A Comparison of Multi-Valued and Heterogeneous Decision Diagram Machines
Hiroki Nakahara, Tsutomu Sasao and Munehiro Matsuura
This paper compares best decision diagram machines (DDMs) with respect to area-time complexity, throughput, and compatibility to the off-the-shelf memory. Our previous work shows that, as for area-time complexity, the QDDM is the best; and as for throughput, the QRQDDM is the best. This paper introduces three types of DDMs: the QDDM, the standard HMDDM, and the prefetching HMDDM. It compares three types of DDMs with respect to the compatibility to the off-the-shelf memory. It shows that the prefetching HMDDM has the best compatibility to the off-the-shelf memory.
Keywords: Decision Diagram Machine, Heterogeneous Multi-valued Decision Diagram