Algorithms for physical implementation of multiple-valued circuits
SMO'05 Proceedings of the 5th WSEAS international conference on Simulation, modelling and optimization
| Hi-index | 0.00 |
This paper addresses the problem of finding a smallsize Multiple-Valued Decision Diagram (MDD)representation of an incompletely specified multiple-valued function. Optimal MDD representationimproves performance and flexibility of manyapplications in logic design and multiple-valuedcircuit synthesis.We introduce an algorithm which incorporates anew operation on incompletely specified MDDs, calledfusion. The diagram is optimized by dynamic variableordering, graph compaction and minimization. Duringthe optimization the structure of the underlying MDDis modified in a way that only specified values arerepresented while don't cares are ignored. The resultson multiple-valued as wel as binary benchmarks withdon't cares are given to demonstrate the efficiency androbustness of the algorithm.