34th International Symposium on Multiple-Valued Logic (ISMVL'04) On the Minimization of Multiple-Valued Input Binary-Valued Output Functions University of Toronto, Toronto, Canada May 19-May 22 ISBN: 0-7695-2130-4
The success of the local covering approach to multiple-valued input two-valued output (MVITVO) functions minimization depends vastly on the proper choice of the base minterms from the ON set of the some new techniques to improve the performance of this approach. We have introduced a graph called an enhanced assignment graph (EAG) for the efficient grouping of the Boolean variables. In order to make the best choice of the proper base minterm we have defined a new technique to find the potential canonical cube (PCC) covering it. In this process we have succeeded in finding out the essential primes efficiently which enhances the total computation time and produces better sum of products (SOP).
Index Terms:
Multiple-Valued Input Two-Valued Output Functions, Prime Implicant, Logic Minimization, Sum-of-Products (SOPs)
Citation:
Hafiz Md. Hasan Babu, Moinul Islam Zaber, Md.Rafiqul Islam, Md. Mazder Rahman, "On the Minimization of Multiple-Valued Input Binary-Valued Output Functions," ismvl, pp.321-326, 34th International Symposium on Multiple-Valued Logic (ISMVL'04), 2004 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||