Abstract :
This paper presents an elaboration of the unateness test of a Boolean function based on the definition of the so-called simple zero or unit transition of arguments of the given Boolean function. It is proved that the unateness of the given Boolean function is subject to the necessary and sufficient condition that there must be no occurrence of both simple unit transition and zero transition at the same time. Whether this condition is satisfied or not can easily be seen from the truth table of the given function.
Keywords :
Boolean function, code distance and minimal hypercube, methods of general synthesis of threshold logic elements, minimization of logical networks, properties of threshold logic functions, threshold logic function, transitions of arguments of a Boolean function, unateness test.; Boolean functions; Circuit synthesis; Cybernetics; Hypercubes; Logic functions; Logic testing; Minimization methods; Network synthesis; Sufficient conditions; Boolean function, code distance and minimal hypercube, methods of general synthesis of threshold logic elements, minimization of logical networks, properties of threshold logic functions, threshold logic function, transitions of arguments of a Boolean function, unateness test.;
