m13240 An algorithm to implement a boolean function using only NAND's or only NOR's. 1.4 2006/01/04 14:23:33 US/Central 2009/07/01 13:45:35.119 GMT-5 Katherine E Fletcher Katherine Fletcher kef@rice.edu Katherine E Fletcher Katherine Fletcher kef@rice.edu Katherine E Fletcher Katherine Fletcher kef@rice.edu DeMorgan's Law Gate conversion Logical Completeness Science and Technology An algorithm to implement a boolean function as a gate network using only NAND's or only NOR's is presented. Any boolean function can be implemented straightforwardly using AND's, OR's, and NOT gates. Using DeMorgan's Law in different forms gates in the network can be successively converted to use only NAND's or only NOR's. en NAND's and NOR's are the most common basic logic circuit element in use because they are simpler to build than AND and OR gates, and because each is logically complete . Many logical functions are expressed using AND's, OR's, and Inverters (NOT), however, because an implementing circuit can be constructed straightforwardly from the truth table expression of a logical function and because Karnaugh Map's can be used to minimize AND, OR, INVERTER networks. This document is adapted, with permission, from algorithms and examples given in Dr. Jump's Elec326 course notes. Below a simple algorithm is given for converting a network with AND gates, OR gates and INVERTERS to one with NAND gates or NOR gates exclusively. First the boolean function is represented using AND's, OR's, and NOT gates. Then, using DeMorgan's Law in various forms, the AND, OR, INVERTER network is converted step-by-step to use only NAND gates or only NOR gates. OR to NAND AND to NOR a∨b≡¬(¬a∧¬b) a∧b≡¬(¬a∨¬b)

The figure is adapted with permission from Dr. Robert Jump's Elec326 lecture notes . The first two rows of the figure above illustrate DeMorgan's Law using gates. The third row illustrates how to eliminate any inverters with either NAND or NOR gates.

Draw AND, OR, INVERTER implementation. First draw out an implementation of the boolean function using AND gates, OR gates and INVERTERS. Any implementation that uses only those three gate types will work. One way to implement a boolean function using AND's, OR's and INVERTERS is to build the Disjunctive Normal Form of the boolean function from the truth table that describes the function. Disjunctive Normal Form, is also called Sum of Products form. Propositional Logic: Normal Forms gives a succinct treatment of normal forms and of how to go from a truth table to Disjunctive Normal Form. Apply DeMorgan's Law. Apply DeMorgan's Law to the circuit by using the equivalences in the first two rows of the Figure above. To create a NAND only circuit, use the transforms in the left box, and for a NOR only circuit use the transforms in the right-hand box. Remove redundant inverters: Any time that two inverters are in series (an inverted output goes directly in to an inverted input), remove both of them, since they cancel each other out. Replace remaining inverters. Replace any remaining inverters with the equivalent NAND or NOR implementation (the third row of the Figure).

Example conversion to a NAND only network.

Note that in step c. the final elimination of inverters isn't quite done since B and D are inverted into one of the NAND's. Karnaugh Map A visual map of the truth table of a boolean expression and an algorithm for removing redundant elements to realize a minimized boolean expression. logically complete A set of circuit gates or logical elements is logically complete if any boolean function representable by a truth table can be realized using only gates or elements from that set. AND, OR, and NOT is a logically complete set. NAND is logically complete. NOR is logically complete. Robert Jump NAND/NOR Networks Unpublished course notes from Elec 326 2004 Rice University, Department of Electrical and Computer Engineering, Houston TX 77251