Minimization of binary switching functions in bases 2AND-NOT, 2AND-2OR-NOT

This paper considers the approach to minimization of logic functions in the classical 2NOR basis and in the 2OR-2AND-NOT basis. It is shown that search for the optimal coverage of units of the given function is conducted in the form of a tree of implicants of the corresponding basis. Implementation in the redundant basis is equivalent with regard to the number of transistors but preferable in terms of speed.