Higher Logic Learning Series - The Mission Driven Volunteer (02-27-14)
Logic Design Lecr 02 Logic Gates.ppt
Transcript of Logic Design Lecr 02 Logic Gates.ppt
![Page 1: Logic Design Lecr 02 Logic Gates.ppt](https://reader030.fdocuments.in/reader030/viewer/2022012710/61aa278131eaa93a56062379/html5/thumbnails/1.jpg)
Tishk International UniversityScience FacultyIT Department
Logic Design
2nd Grade –Fall Semester 2021-2022
Lecture 02: Logic Gates and Boolean Algebra
Instructor: Alaa Ghazi
![Page 2: Logic Design Lecr 02 Logic Gates.ppt](https://reader030.fdocuments.in/reader030/viewer/2022012710/61aa278131eaa93a56062379/html5/thumbnails/2.jpg)
Lecture 2
Logic Gates and Boolean Algebra
![Page 3: Logic Design Lecr 02 Logic Gates.ppt](https://reader030.fdocuments.in/reader030/viewer/2022012710/61aa278131eaa93a56062379/html5/thumbnails/3.jpg)
Key Key Key TermsTermsTerms
Inverter
Truth table
Timing
diagram
Boolean
algebra
AND gate
A logic circuit that inverts or complements its
inputs.
A table showing the inputs and corresponding
output(s) of a logic circuit.
A diagram of waveforms showing the proper
time relationship of all of the waveforms.
The mathematics of logic circuits.
A logic gate that produces a HIGH output only
when all of its inputs are HIGH.
![Page 4: Logic Design Lecr 02 Logic Gates.ppt](https://reader030.fdocuments.in/reader030/viewer/2022012710/61aa278131eaa93a56062379/html5/thumbnails/4.jpg)
Key Key Key TermsTermsTerms
OR gate
NAND gate
NOR gate
Exclusive-OR
gate
Exclusive-NOR
gate
A logic gate that produces a HIGH output when
one or more inputs are HIGH.
A logic gate that produces a LOW output only
when all of its inputs are HIGH.
A logic gate that produces a LOW output when one
or more inputs are HIGH.
A logic gate that produces a HIGH output only
when its two inputs are at opposite levels.
A logic gate that produces a LOW output only
when its two inputs are at opposite levels.
![Page 5: Logic Design Lecr 02 Logic Gates.ppt](https://reader030.fdocuments.in/reader030/viewer/2022012710/61aa278131eaa93a56062379/html5/thumbnails/5.jpg)
Binary Digits, Logic Levels, and Digital Waveforms
• The two binary digits are designated 0 and 1
• They can also be called LOW and HIGH, where
LOW = 0 and HIGH = 1
• In order to practice with Logic Gates we can use:
•LogicCircuit
•CEDAR Logic Simulator
•Logisim
![Page 6: Logic Design Lecr 02 Logic Gates.ppt](https://reader030.fdocuments.in/reader030/viewer/2022012710/61aa278131eaa93a56062379/html5/thumbnails/6.jpg)
Logic Gates
• Inverter
• AND Gate
• OR Gate
• NAND Gate
• NOR Gate
• Exclusive-OR Gate
• Exclusive-NOR Gate
![Page 7: Logic Design Lecr 02 Logic Gates.ppt](https://reader030.fdocuments.in/reader030/viewer/2022012710/61aa278131eaa93a56062379/html5/thumbnails/7.jpg)
Floyd, Digital Fundamentals, 10th ed
The inverter performs the Boolean NOT operation. When the
input is LOW, the output is HIGH; when the input is HIGH,
the output is LOW.
The InverterA X
Input
A X
Output
LOW (0) HIGH (1)HIGH (1) LOW(0)
The NOT operation (complement) is shown with an overbar.
Thus, the Boolean expression for an inverter is X = A.
![Page 8: Logic Design Lecr 02 Logic Gates.ppt](https://reader030.fdocuments.in/reader030/viewer/2022012710/61aa278131eaa93a56062379/html5/thumbnails/8.jpg)
Floyd, Digital Fundamentals, 10th ed
The Inverter
Example waveforms:
A
X
A X
A group of inverters can be used to form the 1’s complement
of a binary number: Binary number
1’s complement
1 0 0 0 1 1 0 1
0 1 1 1 0 0 1 0
![Page 9: Logic Design Lecr 02 Logic Gates.ppt](https://reader030.fdocuments.in/reader030/viewer/2022012710/61aa278131eaa93a56062379/html5/thumbnails/9.jpg)
Truth Tables
• Total number of possible combinations of binary inputs
N = 2n
• For two input variables: N = 22 = 4 combinations
• For three input variables: N = 23 = 8 combinations
• For four input variables: N = 24 = 16 combinations
![Page 10: Logic Design Lecr 02 Logic Gates.ppt](https://reader030.fdocuments.in/reader030/viewer/2022012710/61aa278131eaa93a56062379/html5/thumbnails/10.jpg)
Floyd, Digital Fundamentals, 10th ed
The AND gate produces a HIGH output when all inputs are
HIGH; otherwise, the output is LOW. For a 2-input gate,
the truth table is
The AND Gate
The AND operation is usually shown with a dot between the
variables but it may be implied (no dot). Thus, the AND
operation is written as X = A .B or X = AB.
Inputs
A B X
Output
0 0
0 1
1 0
1 1
0
0
0
1
A
B
X
![Page 11: Logic Design Lecr 02 Logic Gates.ppt](https://reader030.fdocuments.in/reader030/viewer/2022012710/61aa278131eaa93a56062379/html5/thumbnails/11.jpg)
Floyd, Digital Fundamentals, 10th ed
Example waveforms:
A
X
The AND operation is used in computer programming as a
selective mask. If you want to retain certain bits of a binary
number but reset the other bits to 0, you could set a mask with
1’s in the position of the retained bits.
The AND GateA
B
X
B
00000011
If the binary number 10100011 is ANDed with
the mask 00001111, what is the result?
![Page 12: Logic Design Lecr 02 Logic Gates.ppt](https://reader030.fdocuments.in/reader030/viewer/2022012710/61aa278131eaa93a56062379/html5/thumbnails/12.jpg)
The AND Gate for more than 2 inputs
33--Input AND GateInput AND Gate
44--Input AND GateInput AND Gate
![Page 13: Logic Design Lecr 02 Logic Gates.ppt](https://reader030.fdocuments.in/reader030/viewer/2022012710/61aa278131eaa93a56062379/html5/thumbnails/13.jpg)
Floyd, Digital Fundamentals, 10th ed
The OR gate produces a HIGH output if any input is HIGH;
if all inputs are LOW, the output is LOW. For a 2-input gate,
the truth table is
The OR Gate
The OR operation is shown with a plus sign (+) between the
variables. Thus, the OR operation is written as X = A + B.
Inputs
A B X
Output
0 0
0 1
1 0
1 1
0
1
1
1
A
B
X
![Page 14: Logic Design Lecr 02 Logic Gates.ppt](https://reader030.fdocuments.in/reader030/viewer/2022012710/61aa278131eaa93a56062379/html5/thumbnails/14.jpg)
Floyd, Digital Fundamentals, 10th ed
Example waveforms:
A
X
The OR operation can be used in computer programming to set certain
bits of a binary number to 1.
The OR Gate
B
A
B
X
ASCII letters have a 1 in the bit 5 position for lower case letters
and a 0 in this position for capitals. (Bit positions are numbered
from right to left starting with 0.) What will be the result if you
OR an ASCII letter with the 8-bit mask 00100000?
The resulting letter will be lower case.
![Page 15: Logic Design Lecr 02 Logic Gates.ppt](https://reader030.fdocuments.in/reader030/viewer/2022012710/61aa278131eaa93a56062379/html5/thumbnails/15.jpg)
33--Input OR GateInput OR Gate
44--Input OR GateInput OR Gate
The OR Gate for more than 2 inputs
![Page 16: Logic Design Lecr 02 Logic Gates.ppt](https://reader030.fdocuments.in/reader030/viewer/2022012710/61aa278131eaa93a56062379/html5/thumbnails/16.jpg)
Floyd, Digital Fundamentals, 10th ed
The NAND gate produces a LOW output when all inputs
are HIGH; otherwise, the output is HIGH. For a 2-input
gate, the truth table is
The NAND Gate
Inputs
A B X
Output
0 0
0 1
1 0
1 1
1
1
1
0
A
B
X
The NAND operation is shown with a dot between the
variables and an overbar covering them. Thus, the NAND
operation is written as X = A .B (Alternatively, X = AB.)
![Page 17: Logic Design Lecr 02 Logic Gates.ppt](https://reader030.fdocuments.in/reader030/viewer/2022012710/61aa278131eaa93a56062379/html5/thumbnails/17.jpg)
Floyd, Digital Fundamentals, 10th ed
Example waveforms:
A
X
The NAND gate is particularly useful because it is a
“universal” gate – all other basic gates can be constructed
from NAND gates.
The NAND Gate
B
How would you connect a 2-input NAND gate
to form a basic inverter?
A
B
X
![Page 18: Logic Design Lecr 02 Logic Gates.ppt](https://reader030.fdocuments.in/reader030/viewer/2022012710/61aa278131eaa93a56062379/html5/thumbnails/18.jpg)
Floyd, Digital Fundamentals, 10th ed
The NOR gate produces a LOW output if any input is
HIGH; if all inputs are HIGH, the output is LOW. For a
2-input gate, the truth table is
The NOR Gate
Inputs
A B X
Output
0 0
0 1
1 0
1 1
1
0
0
0
A
B
X
The NOR operation is shown with a plus sign (+) between
the variables and an overbar covering them. Thus, the NOR
operation is written as X = A + B.
![Page 19: Logic Design Lecr 02 Logic Gates.ppt](https://reader030.fdocuments.in/reader030/viewer/2022012710/61aa278131eaa93a56062379/html5/thumbnails/19.jpg)
Floyd, Digital Fundamentals, 10th ed
Example waveforms:
A
X
The NOR operation will produce a LOW if any input is HIGH.
The NOR Gate
B
When is the LED is ON for the circuit shown?
The LED will be on when any of
the four inputs are HIGH.
A
CB
D
X
330 Ω
+5.0 V
A
B
X
![Page 20: Logic Design Lecr 02 Logic Gates.ppt](https://reader030.fdocuments.in/reader030/viewer/2022012710/61aa278131eaa93a56062379/html5/thumbnails/20.jpg)
Floyd, Digital Fundamentals, 10th ed
The XOR gate produces a HIGH output only when both
inputs are at opposite logic levels. The truth table is
The XOR Gate
Inputs
A B X
Output
0 0
0 1
1 0
1 1
0
1
1
0
A
B
X
The XOR operation is written as X = AB + AB.
Alternatively, it can be written with a circled plus sign
between the variables as X = A + B.
![Page 21: Logic Design Lecr 02 Logic Gates.ppt](https://reader030.fdocuments.in/reader030/viewer/2022012710/61aa278131eaa93a56062379/html5/thumbnails/21.jpg)
Floyd, Digital Fundamentals, 10th ed
Example waveforms:
A
X
Notice that the XOR gate will produce a HIGH only when exactly one
input is HIGH.
The XOR Gate
B
If the A and B waveforms are both inverted for the above
waveforms, how is the output affected?
There is no change in the output.
A
B
X
![Page 22: Logic Design Lecr 02 Logic Gates.ppt](https://reader030.fdocuments.in/reader030/viewer/2022012710/61aa278131eaa93a56062379/html5/thumbnails/22.jpg)
Floyd, Digital Fundamentals, 10th ed
The XNOR gate produces a HIGH output only when both
inputs are at the same logic level. The truth table is
The XNOR Gate
Inputs
A B X
Output
0 0
0 1
1 0
1 1
1
0
0
1
A
B
X
The XNOR operation shown as X = AB + AB. Alternatively,
the XNOR operation can be shown with a circled dot
between the variables. Thus, it can be shown as X = A . B.
![Page 23: Logic Design Lecr 02 Logic Gates.ppt](https://reader030.fdocuments.in/reader030/viewer/2022012710/61aa278131eaa93a56062379/html5/thumbnails/23.jpg)
Floyd, Digital Fundamentals, 10th ed
Example waveforms:
A
X
Notice that the XNOR gate will produce a HIGH when both inputs are the
same. This makes it useful for comparison functions.
The XNOR Gate
B
If the A waveform is inverted but B remains the same, how is
the output affected?
The output will be inverted.
A
B
X
![Page 24: Logic Design Lecr 02 Logic Gates.ppt](https://reader030.fdocuments.in/reader030/viewer/2022012710/61aa278131eaa93a56062379/html5/thumbnails/24.jpg)
Boolean Operations and
Expressions• Addition
0 + 0 = 0
0 + 1 = 1
1 + 0 = 1
1 + 1 = 1
• Multiplication
0 * 0 = 0
0 * 1 = 0
1 * 0 = 0
1 * 1 = 1
![Page 25: Logic Design Lecr 02 Logic Gates.ppt](https://reader030.fdocuments.in/reader030/viewer/2022012710/61aa278131eaa93a56062379/html5/thumbnails/25.jpg)
Laws Boolean Algebra
• Commutative Laws
• Associative Laws
• Distributive Law
![Page 26: Logic Design Lecr 02 Logic Gates.ppt](https://reader030.fdocuments.in/reader030/viewer/2022012710/61aa278131eaa93a56062379/html5/thumbnails/26.jpg)
Laws of Boolean Algebra
• Commutative Law of Addition:
A + B = B + A
![Page 27: Logic Design Lecr 02 Logic Gates.ppt](https://reader030.fdocuments.in/reader030/viewer/2022012710/61aa278131eaa93a56062379/html5/thumbnails/27.jpg)
Laws of Boolean Algebra
• Commutative Law of Multiplication:
A * B = B * A
![Page 28: Logic Design Lecr 02 Logic Gates.ppt](https://reader030.fdocuments.in/reader030/viewer/2022012710/61aa278131eaa93a56062379/html5/thumbnails/28.jpg)
Laws of Boolean Algebra
• Associative Law of Addition:
A + (B + C) = (A + B) + C
![Page 29: Logic Design Lecr 02 Logic Gates.ppt](https://reader030.fdocuments.in/reader030/viewer/2022012710/61aa278131eaa93a56062379/html5/thumbnails/29.jpg)
Laws of Boolean Algebra
• Associative Law of Multiplication:
A * (B * C) = (A * B) * C
![Page 30: Logic Design Lecr 02 Logic Gates.ppt](https://reader030.fdocuments.in/reader030/viewer/2022012710/61aa278131eaa93a56062379/html5/thumbnails/30.jpg)
Laws of Boolean Algebra
• Distributive Law:
A(B + C) = AB + AC
![Page 31: Logic Design Lecr 02 Logic Gates.ppt](https://reader030.fdocuments.in/reader030/viewer/2022012710/61aa278131eaa93a56062379/html5/thumbnails/31.jpg)
Rules of Boolean Algebra
![Page 32: Logic Design Lecr 02 Logic Gates.ppt](https://reader030.fdocuments.in/reader030/viewer/2022012710/61aa278131eaa93a56062379/html5/thumbnails/32.jpg)
Rules of Boolean Algebra
• Rule 6
OR Truth Table
![Page 33: Logic Design Lecr 02 Logic Gates.ppt](https://reader030.fdocuments.in/reader030/viewer/2022012710/61aa278131eaa93a56062379/html5/thumbnails/33.jpg)
Rules of Boolean Algebra
• Rule 7
AND Truth Table
![Page 34: Logic Design Lecr 02 Logic Gates.ppt](https://reader030.fdocuments.in/reader030/viewer/2022012710/61aa278131eaa93a56062379/html5/thumbnails/34.jpg)
Rules of Boolean Algebra
• Rule 8
AND Truth Table
![Page 35: Logic Design Lecr 02 Logic Gates.ppt](https://reader030.fdocuments.in/reader030/viewer/2022012710/61aa278131eaa93a56062379/html5/thumbnails/35.jpg)
Rules of Boolean Algebra
• Rule 9
![Page 36: Logic Design Lecr 02 Logic Gates.ppt](https://reader030.fdocuments.in/reader030/viewer/2022012710/61aa278131eaa93a56062379/html5/thumbnails/36.jpg)
Rules of Boolean Algebra
• Rule 10: A + AB = A
AND Truth Table OR Truth Table
![Page 37: Logic Design Lecr 02 Logic Gates.ppt](https://reader030.fdocuments.in/reader030/viewer/2022012710/61aa278131eaa93a56062379/html5/thumbnails/37.jpg)
Rules of Boolean Algebra
• Rule 11: BABAA ++++====++++
AND Truth Table OR Truth Table
![Page 38: Logic Design Lecr 02 Logic Gates.ppt](https://reader030.fdocuments.in/reader030/viewer/2022012710/61aa278131eaa93a56062379/html5/thumbnails/38.jpg)
Rules of Boolean Algebra
• Rule 12: (A + B)(A + C) = A + BC
AND Truth Table OR Truth Table
![Page 39: Logic Design Lecr 02 Logic Gates.ppt](https://reader030.fdocuments.in/reader030/viewer/2022012710/61aa278131eaa93a56062379/html5/thumbnails/39.jpg)
DeMorgan’s theorems are equally valid for use with three, four or
more input variable expressions.
Example1:
Example2:
DeMorgan’s Theorems • Theorem 1
• Theorem 2YXXY ++++====
YXYX ====++++
Remember: Remember:
“Break the bar, “Break the bar,
change the sign”change the sign”
![Page 40: Logic Design Lecr 02 Logic Gates.ppt](https://reader030.fdocuments.in/reader030/viewer/2022012710/61aa278131eaa93a56062379/html5/thumbnails/40.jpg)
Summary of the Rules of Boolean Algebra
![Page 41: Logic Design Lecr 02 Logic Gates.ppt](https://reader030.fdocuments.in/reader030/viewer/2022012710/61aa278131eaa93a56062379/html5/thumbnails/41.jpg)
Relations Between Logic Forms
Boolean Expression to Truth-table: Evaluate expression for all
input combinations and record output values.
Boolean Expression to Logic Circuit : Use AND gates for the
AND operators, OR gates for the OR operators, and inverters for
the NOT operator. Wire up the gates the match the structure of the
expression.
Logic Circuit to Boolean Expression: Reverse the above process
![Page 42: Logic Design Lecr 02 Logic Gates.ppt](https://reader030.fdocuments.in/reader030/viewer/2022012710/61aa278131eaa93a56062379/html5/thumbnails/42.jpg)
Example: Find the Boolean Expression for the logic circuit below
Solution
![Page 43: Logic Design Lecr 02 Logic Gates.ppt](https://reader030.fdocuments.in/reader030/viewer/2022012710/61aa278131eaa93a56062379/html5/thumbnails/43.jpg)
Example: For the below Boolean Expression find out the
Truth table and Logic Circuit
Solution:
![Page 44: Logic Design Lecr 02 Logic Gates.ppt](https://reader030.fdocuments.in/reader030/viewer/2022012710/61aa278131eaa93a56062379/html5/thumbnails/44.jpg)
Example Find the Boolean Expression and Truth Table for
below Logic Circuit.
Solution: