Multiple-valued Logic Operations with Universal Literals

Abstract

We propose the use of universal literals as a means of reducing the cost of multiple-valued circuits. A universal literal is any function on one variable. The target architecture is a sum-of-products structure, where sum is the truncated sum and product terms consist of the minimum of universal literals. A significant cost reduction is demonstrated over the conventional window literal. The proposed synthesis method starts with a sum-of-products expression. Simplification occurs as pairs of producttermsaremergedandreshaped. Weshowunder what conditions such operations can be applied.Research supported by the Natural Sciences and Engineering Research Council of Canada and by the Naval Research Laboratory, Washington, DC through direct funds at the Naval Postgraduate School, Monterey, CAResearch supported by the Natural Sciences and Engineering Research Council of Canada and by the Naval Research Laboratory, Washington, DC through direct funds at the Naval Postgraduate School, Monterey, C

    Similar works