The document discusses additional logic functions including NAND, NOR, XOR and XNOR gates. It describes how NAND gates can be used to represent NOT, AND and OR functions through different input configurations. Specifically, a NAND gate with both inputs being the same realizes a NOT function; a NAND gate with complemented output realizes an AND function; and a NAND gate with complemented inputs realizes an OR function. Therefore, NAND gates can be used to construct any switching function and are considered primitive or functionally complete. The document also briefly mentions NOR gates and converting between sum-of-products and NAND/NOR representations.
Download as PPT, PDF, TXT or read online on Scribd
0 ratings0% found this document useful (0 votes)
32 views
More Logic Functions: NAND, NOR, XOR and XNOR
The document discusses additional logic functions including NAND, NOR, XOR and XNOR gates. It describes how NAND gates can be used to represent NOT, AND and OR functions through different input configurations. Specifically, a NAND gate with both inputs being the same realizes a NOT function; a NAND gate with complemented output realizes an AND function; and a NAND gate with complemented inputs realizes an OR function. Therefore, NAND gates can be used to construct any switching function and are considered primitive or functionally complete. The document also briefly mentions NOR gates and converting between sum-of-products and NAND/NOR representations.
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 9
Lecture 6
More Logic Functions: NAND, NOR, XOR and XNOR
Overvie w ° More 2-input logic gates (NAND, NOR, XOR) ° Extensions to 3-input gates ° Converting between sum-of-products and NANDs • SOP to NANDs • NANDs to SOP
° Converting between sum-of-products and NORs
• SOP to NORs • NORs to SOP
° Positive and negative logic
• We use primarily positive logic in this course. Logic functions of N variables
° Each truth table represents one possible function
(e.g. AND, OR) ° If there are N inputs, there are 22N ° For example, is N is 2 then there are 16 possible truth tables. ° So far, we have defined 2 of these functions • 14 more are possible.
° Why consider new functions?
x y G • Cheaper hardware, more flexibility. 0 0 0 0 1 0 1 0 0 1 1 1 Logic functions of 2 variables
Truth table - Wikipedia,
The NA ND A Gat Y B e ° This is a NAND gate. It is a combination of an AND gate followed by an inverter. Its truth table shows this… ° NAND gates have several interesting properties… • NAND(a,a)=(aa)’ = a’ = NOT(a) • NAND’(a,b)=(ab)’’ = ab = AND(a,b) A B Y • NAND(a’,b’)=(a’b’)’ = a+b = OR(a,b) 0 0 1 0 1 1 1 0 1 1 1 0 The NA ° NDThese three properties show that a NAND gate with both Gat of its inputs driven by the same signal is equivalent to a e NOT gate ° A NAND gate whose output is complemented is equivalent to an AND gate, and a NAND gate with complemented inputs acts as an OR gate. ° Therefore, we can use a NAND gate to implement all three of the elementary operators (AND,OR,NOT). ° Therefore, ANY switching function can be constructed using only NAND gates. Such a gate is said to be primitive or functionally complete. NA ND Gat (what are these circuits?) es A into Oth Y A er B Y NOT Gate Gat es AND Gate