Abstract
An analysis is presented to predict the input variable subsets that give efficient disjunctive decompositions of complex combinatorial logic functions. A substantially smaller number of possible solutions, compared to all possible solutions, is predicted using a comparatively simple analysis, based on a count of the covers between tuples in the function description when one or two variables are swapped across the input variable partition. From these data, prominent variables, whose positions heavily influence the function decomposition, can be predicted and optimal orderings obtained. The effectiveness and efficiency of the method is demonstrated through a number of examples.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: IEE Proceedings - Computers and Digital Techniques
Disclaimer: 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.