Representations of logic functions using QRMDDs

This paper considers quasi-reduced multi-valued decision diagrams with k bits (QRMDD(k)s) to represent two-valued logic functions. It shows relations between the numbers of nodes in QRMDD(k)s and values of k for benchmark functions; an upper bound on the number of nodes in the QRMDD(k); difference between the upper bound and the number of nodes in the QRMDD(k)s for random functions; and the amount of total memory, evaluation time, and area-time complexity for QRMDD(k)s. Experimental results using standard benchmark functions show that the area-time complexity takes its minimum when k is between 3 and 6