A new tool for manipulation of logic functions is presented in this paper. The source functions are described by an algebraic expression (or a set of expressions), in a VHDL-like style, by a truth table (PLA) or as a CNF form. In particular, any multilevel network of logic gates can be used as a source for the tool. The tool is capable of performing basic Boolean operations on the source functi...

We introduce a new efficient minimization method for functions described by many (up to millions) product terms. The algorithm is based on processing a newly proposed efficient representation of a set of product terms – a ternary tree. The minimization procedure is based on a fast application of basic Boolean operations upon the ternary tree, combined with algorithms used in the Espresso minimi...

We introduce a new efficient minimization method for functions described by many (up to millions) product terms. The algorithm is based on processing a newly proposed efficient representation of a set of product terms – a ternary tree. The minimization procedure is based on a fast application of basic Boolean operations upon the ternary tree, combined with algorithms used in the Espresso minimi...

We discuss new analytical formulations for localized and controllable blending operations in the functionbased solid modeling. The blending set operations are defined using R-functions and displacement functions with the localized area of influence. The shape and location of the blend are controlled by an additional bounding solid thus turning the operation into a ternary one. We also describe ...

Basic logic gates and their operations in ternary quantum domain are involved in the synthesis of ternary quantum circuits. Only a few works define ternary algebra for ternary quantum logic realization. In this paper, a ternary logic function is expressed in terms of projection operations including a new one. A method to realize new multi-qutrit ternary gates in terms of generalized ternary gat...