Asynchronous Sequential Switching Circuit
Asynchronous Sequential Switching Circuit
Logic Properties of Unate Discrete and Switching Functions
IEEE Transactions on Computers
| Hi-index | 0.00 |
The total and local unateness of discrete functions are first studied from a theoretical point of view. It is shown that the local unateness leads to the concept of hazard-free transition for a discrete function. Unate covers for discrete functions are defined: they are either the smallest unate functions larger than a discrete function, or the largest unate functions smaller than a discrete function. These concepts play a key-role in hazard-free design of multiple-valued networks. Two-and three-level types of multiple-valued networks using MIN and MAX gates are presented; these networks are straightforward generalizations of the well known two-level hazard-free networks presented by Eichelberger and of some types of switching networks which improve, from a hazard point of view, the Eichelberger's networks. Some results concerned with the symmetry of discrete functions are briefly summarized at the end of this pa- per. Finally, the paper presented by the authors at the preceding symposium (see ref. 4) constitutes a preriquisite for understanding the matter developed in the present paper.