1) A universal set of gates is a set that can be used to implement any Boolean function. Common universal sets include AND, OR, NOT and NAND, NOR.
2) NAND and NOR gates are versatile and can be used to implement all basic logic gates. A NAND gate outputs 1 only if all its inputs are 0, while a NOR gate outputs 1 only if all its inputs are 1.
3) Block diagram transformations can be used to simplify logic circuits. This includes reducing the number of inputs, applying DeMorgan's laws, and representing circuits as Sum of Products or Product of Sums using only NAND or NOR gates respectively.
1) A universal set of gates is a set that can be used to implement any Boolean function. Common universal sets include AND, OR, NOT and NAND, NOR.
2) NAND and NOR gates are versatile and can be used to implement all basic logic gates. A NAND gate outputs 1 only if all its inputs are 0, while a NOR gate outputs 1 only if all its inputs are 1.
3) Block diagram transformations can be used to simplify logic circuits. This includes reducing the number of inputs, applying DeMorgan's laws, and representing circuits as Sum of Products or Product of Sums using only NAND or NOR gates respectively.
1) A universal set of gates is a set that can be used to implement any Boolean function. Common universal sets include AND, OR, NOT and NAND, NOR.
2) NAND and NOR gates are versatile and can be used to implement all basic logic gates. A NAND gate outputs 1 only if all its inputs are 0, while a NOR gate outputs 1 only if all its inputs are 1.
3) Block diagram transformations can be used to simplify logic circuits. This includes reducing the number of inputs, applying DeMorgan's laws, and representing circuits as Sum of Products or Product of Sums using only NAND or NOR gates respectively.
CK Cheng, Diba Mirza Dept. of Computer Science and Engineering University of California, San Diego
1
Combinational Logic: Other Types of Gates ! Universal Set of Gates ! Other Types of Gates 1) XOR 2) NAND / NOR 3) Block Diagram Transfers: Converting a circuit to an equivalent circuit 2 Universal Set Universal Set: A set of gates such that every switching function can be implemented with gates in this set. Ex: {AND, OR, NOT} {AND, NOT} {OR, NOT} 3 Universal Set Universal Set: A set of gates such that every Boolean function can be implemented with gates in this set. Ex: {AND, OR, NOT} {AND, NOT} OR can be implemented with AND & NOT gates a+b = (ab) {OR, NOT} AND can be implemented with OR & NOT gates ab = (a+b) {XOR} is not universal {XOR, AND} is universal 4 iClicker 5 Is the set {AND, OR} (but no NOT gate) universal? A. Yes B. No Universal Set {AND, NOT} combined into a single gate:
{OR, NOT} combined into into a single gate: 6
1. Implementing NOT using NAND
2. Implementing AND using NAND
3. Implementing OR using NAND
7 Implementing NOT, AND and OR using NAND gates
1. Implementing NOT using NOR
2. Implementing OR using NOR
3. Implementing AND using NOR
8 Implementing NOT, AND and OR using NOR gates
1. Implementing NOT using XOR
X 1 = X.1 + X.1 = X if constant 1 is available.
2. Implementing OR using XOR and AND Same as implementing OR using AND and NOT except NOT is implemented using XOR as shown above
9 Universal gates {XOR, AND} 1 Universal Set 10 Remark: Universal set is a powerful concept to identify the coverage of a set of gates afforded by a given technology. Other Types of Gates
(a) Commutative X Y = Y X (b) Associative (X Y) Z = X (Y Z) (c) 1 X = X 0 X = 0X + 0X = X (d) X X = 0, X X = 1
1) XOR X Y = XY + XY 11 X Y XY XY
e) if ab = 0 then a b = a + b
Proof: If ab = 0 then a = a (b+b) = ab+ab = ab b = b (a + a) = ba + ba = ab a+b = ab + ab = a b
f) X XY XY (X + Y) X = ??
To answer, we apply Shannons Expansion. 12 Shannons Expansion (for switching functions)
Formula: f (x,Y) = x * f (1, Y) + x * f (0, Y)
Proof by enumeration: If x = 1, f (x,Y) = f (1, Y) : 1*f (1, Y) + 1*f(0,Y) = f (1, Y)
If x = 0, f(x,Y) = f (0, Y) : 0*f (1, Y) + 0*f(0,Y) = f(0, Y) 13 Back to our problem
X XY XY (X + Y) X = ?
X (XY) (XY) (X + Y) X = f (X, Y)
If X = 1, f (1, Y) = 1 Y 0 1 1 = Y If X = 0, f (0, Y) = 0 0 Y Y 0 = 0
Thus, f (X, Y) = XY
14 XOR gates 15 iClicker: a+(b c) = (a+b) (a+c) ? A. Yes B. No 2) NAND, NOR gates
NAND, NOR gates are not associative Let a | b = (ab) (a | b) | c ! a | (b | c) 16 3) Block Diagram Transformation a) Reduce # of inputs. " " 17 b. DeMorgans Law " (a+b) = ab " (ab) = a+b 18 c. Sum of Products (Using only NAND gates) " " Sum of Products (Using only NOR gates) " " 19 d. Product of Sums (NOR gates only) " " 20 NAND, NOR gates 21 Remark: Two level NAND gates: Sum of Products Two level NOR gates: Product of Sums Part II. Sequential Networks Memory / Timesteps Clock Flip flops Specification Implementation 22 Reading 23 [Harris] Chapter 3, 3.1, 3.2