Known upper bounds on the number of required nodes (size) in the ordered binary and multiple-valued decision diagram (DD) for representation of logic functions are reviewed and reduced by a small constant factor. New upper bounds are derived for partial logic functions containing don't cares and also for complete Boolean functions specified by Boolean expressions. The evaluation of upper bounds...

In this paper, a new intelligent algorithm was proposed to minimize the number of control steps of overall operation when scheduling is performed by deciding the precedence of competing operations under the condition that only limited hardware resources were allowed to use. The proposed method could reduce the number of control steps for operation by using multiple criteria, while previous algo...

This paper describes a semi-dynamic CMOS flip-flop family featuring embedded Threshold Logic functions. First, we describe the new Threshold Logic flipflop concept and circuit operation. Second, we present the concepts of embedded Threshold logic and run-time reprogrammability. Finally, it is proved by Spice simulation results that wide (up to 8 inputs) AND/OR Boolean functions can be embedded ...

Reversible logic is of growing importance to many future computer technologies. We introduce a regular structure to realize symmetric functions in binary reversible logic. This structure, called a 2 * 2 Net Structure, allows for more efficient realization of symmetric functions than the methods shown by previous authors. Our synthesis method allows to realize arbitrary symmetric function in a c...

To the memory of our colleague and friend George Gargov ABSTRACT. Hyperboolean algebras are Boolean algebras with operators, constructed as algebras of complexes (or, power structures) of Boolean algebras. They provide an algebraic semantics for a modal logic (called here a hyperboolean modal logic with a Kripke semantics is accordingly based on frames in which the worlds are elements of Boolea...