Académique Documents
Professionnel Documents
Culture Documents
E1.2 Digital Electronics I 4.1 Oct 2007 E1.2 Digital Electronics I Oct 2007
A•B=B•A
E1.2 Digital Electronics I 4.3 Oct 2007 E1.2 Digital Electronics I 4.4 Oct 2007
Associative Laws of Boolean Algebra Distributive Laws of Boolean Algebra
A • (B + C) = A • B + A • C
A + (B + C) = (A + B) + C
A (B + C) = A B + A C
A • (B • C) = (A • B) • C
E1.2 Digital Electronics I 4.5 Oct 2007 E1.2 Digital Electronics I 4.6 Oct 2007
• Rule 1
OR Truth Table
• Rule 2
• Rule 3
• Rule 5 • Rule 9
• Rule 10: A + AB = A
OR Truth Table
• Rule 6
AND Truth Table OR Truth Table
• Rule 7
• Rule 8
E1.2 Digital Electronics I 4.9 Oct 2007 E1.2 Digital Electronics I 4.10 Oct 2007
• Simplify ( )
z = A + B (A + B )
z=B
• Rule 12: (A + B)(A + C) = A + BC
x = ACD + BCD
E1.2 Digital Electronics I 4.11 Oct 2007 E1.2 Digital Electronics I 4.12 Oct 2007
DeMorgan’s Theorems
Review Questions
• Theorem 1
y = AC + AB C
• Simplify (x + y ) = x ⋅ y Remember:
y = AC “Break the bar,
• Theorem 2
change the operator”
• Simplify y = ABC D + ABC D (x ⋅ y ) = x + y
y = AB D
– DeMorgan's theorem is very useful in digital circuit design
– It allows ANDs to be exchanged with ORs by using invertors
• Simplify y = AD + ABD – DeMorgan's Theorem can be extended to any number of
variables.
y = AD + BD
E1.2 Digital Electronics I 4.13 Oct 2007 E1.2 Digital Electronics I 4.14 Oct 2007
z = AC + B D
E1.2 Digital Electronics I 4.15 Oct 2007 E1.2 Digital Electronics I 4.16 Oct 2007
Implications of DeMorgan’s Theorems(I) Implications of DeMorgan’s Theorems(II)
E1.2 Digital Electronics I 4.17 Oct 2007 E1.2 Digital Electronics I 4.18 Oct 2007
• Determine the output expression for the below • Using DeMorgan’s Theorems to convert the
circuit and simplify it using DeMorgan’s expressions to one that has only single-variable
Theorem inversions.
y = R ST + Q y = ( R + S + T )Q
z = ( A + B )⋅ C z = AB + C
• Use DeMorgan’s theorems to convert below
expression to an expression containing only
single-variable inversions.
y = A + B + CD y = A B(C + D )
E1.2 Digital Electronics I 4.19 Oct 2007 E1.2 Digital Electronics I 4.20 Oct 2007
Universality of NAND gates Universality of NOR gate
E1.2 Digital Electronics I 4.21 Oct 2007 E1.2 Digital Electronics I 4.22 Oct 2007
E1.2 Digital Electronics I 4.23 Oct 2007 E1.2 Digital Electronics I 4.24 Oct 2007
Example
E1.2 Digital Electronics I 4.25 Oct 2007 E1.2 Digital Electronics I 4.26 Oct 2007
E1.2 Digital Electronics I 4.27 Oct 2007 E1.2 Digital Electronics I 4.28 Oct 2007
Several points Logic-symbol interpretation
• The equivalences can be extended to gates with any
number of inputs. • Active high/low
• None of the standard symbols have bubbles on their – When an input or output line on a logic circuit
inputs, and all the alternate symbols do. symbol has no bubble on it, that line is said to
• The standard and alternate symbols for each gate be active-high, otherwise it is active-low.
represent the same physical circuit; there is no
difference in the circuits represented by the two
symbols.
• NAND and NOR gates are inverting gates, and so
both the standard and the alternate symbols for each
will have a bubble on either the input or the output,
AND and OR gates are non-inverting gates, and so
the alternate symbols for each will have bubbles on
both inputs and output.
E1.2 Digital Electronics I 4.29 Oct 2007 E1.2 Digital Electronics I 4.30 Oct 2007
Interpretation of the two NAND gate symbols Interpretation of the two OR gate symbols
E1.2 Digital Electronics I 4.31 Oct 2007 E1.2 Digital Electronics I 4.32 Oct 2007
Equivalency of three circuits
• Which circuit diagram should be used?
• Bubble placement
Whenever possible, choose gate symbols so
that bubble outputs are connected to bubble
inputs, and nonbubble outputs to nonbubble
inputs
E1.2 Digital Electronics I 4.33 Oct 2007 E1.2 Digital Electronics I 4.34 Oct 2007
E1.2 Digital Electronics I 4.35 Oct 2007 E1.2 Digital Electronics I 4.36 Oct 2007
Summary: Summary
How to represent the basic logic functions • Boolean Algebra: a mathematical tool used in the analysis
and design of digital circuits
• Logical statements in our own language • OR, AND, NOT: basic Boolean operations
• Truth tables • OR: HIGH output when any input is HIGH
• AND: HIGH output only when all inputs are HIGH
• Traditional graphic logic symbols • NOT: output is the opposite logic level as the input
• Boolean algebra expressions • NOR: OR with its output connected to an INVERTER
• Timing diagrams • NAND: AND with its output connected to an INVERTER
• Boolean theorems and rules: to simplify the expression of a
logic circuit and can lead to a simpler way of implementing
the circuit
• NAND, NOR: can be used to implement any of the basic
Boolean operations
E1.2 Digital Electronics I 4.37 Oct 2007 E1.2 Digital Electronics I 4.38 Oct 2007