Abstract
This paper presents a generic approach to implementation of Decision Diagrams (DDs) for representation and manipulation of Multi-Valued Logic (MVL) functions. The core package is based on recursive synthesis operations, where the recursive step is given by a table look-up technique. This allows to simply exchange the decomposition type without reimplementation of the complete program. The approach can easily be used for prototyping of MVL DD packages. We investigate the problem from a theoretical point of view, i.e. several decompositions that can be realized using the technique are given. Experimental results are reported to demonstrate the efficiency of the approach.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
