Академический Документы
Профессиональный Документы
Культура Документы
afandia@uthm.edu.my
Outlines
2.1 Logic Gates and Truth Table
2.1.1 Inverter, AND, OR, NAND, NOR, XOR and XNOR gates.
2.2 Boolean operation and expression.
2.2.1 Algebra Boolean Laws.
2.2.2 DeMorgans Theorem.
2.2.3 Circuit analysis and design using Boolean algebra.
2.3 Karnaugh Map.
2.3.1 SOP Karnaugh map minimization.
2.3.2 Karnaugh POS Karnaugh map minimization.
2.4 Combination Logic Circuits.
2.4.1 Combination logic implementation.
2.4.2 Universality of NAND and NOR gates.
2.4.3 Combinational of NAND and NOR gates.
2.5 Timing diagram implementation.
2
Logic Gates and Truth Table
Boolean Constants & Variables
4
Truth Tables
5
Truth Tables
Examples of truth tables with 2, 3, and 4 inputs.
6
OR Operation with OR Gates
The Boolean expression for the OR operation is
X=A+B
This is read as x equals A or B.
X will equal 1 when A or B equals 1.
8
Example
Example
10
Solution
11
Example
Determine the OR gate output for the following figure.
12
Solution
13
AND Operations with AND Gates
14
AND Operation with AND Gates
15
Truth Table and Symbol for a Three-input AND Gate
16
Example
Determine the AND gate output for the following figure.
17
Solution
18
NOT Operation
19
Cont
20
Describing Logic Circuits Algebraically
Describing Logic Circuits Algebraically
22
Cont
23
Cont
24
Evaluating Logic Circuit Outputs
25
Other Options
26
Implementing Circuits from Boolean Expressions
Implementing Circuits from Boolean Expressions
28
Example
Example
30
Solution
31
Example
?
Transformasi Anda Bermula di SiniFKEE UTHM
32
Solution
33
NOR Gates and NAND Gates
34
NOR Gates and NAND Gates
35
NOR Gates and NAND Gates
36
(a) NOR symbol; (b) equivalent circuit; (c) truth table
37
(a) NAND symbol; (b) equivalent circuit; (c) truth table.
38
Example
Example
?
Transformasi Anda Bermula di SiniFKEE UTHM
40
Solution
41
Example
?
Transformasi Anda Bermula di SiniFKEE UTHM
42
Solution
43
Boolean Theorems
Boolean Theorems
x0 0
x 1 1
The theorems or laws at right may xx x
represent an expression containing
more than one variable. xx 0
x 1 x
xx x
Transformasi Anda Bermula di SiniFKEE UTHM x x 1
45
Single-variable Theorems
46
Boolean Theorems
Multivariable theorems: x y yx
Understanding all of the x y yx
Boolean theorems will be useful x ( y z) ( x y) z x y z
in reducing expressions to their x( yz ) ( xy ) z xyz
simplest form. x( y z ) xy xz
( w x)( y z ) wy xy wz xz
x xy x
x xy x y
Transformasi Anda Bermula di SiniFKEE UTHM x xy x y
47
Example
Example
y ABD AB D
49
Solution
Given y ABD AB D
y AB ( D D ); ( D D ) 1
y AB (1)
y AB
50
Example
Simplify the expression
z ( A B )( A B )
51
Solution
Given z ( A B)( A B)
z A A A B B A B B
Notice that,
A A 0 and B B B
z AB AB B
z B( A A 1); A A 1
z B(1 1)
z B(1)
zB
52
DeMorgans Theorems
DeMorgans Theorems
54
DeMorgans Theorems
A NOR gate is equivalent to an AND gate with inverted inputs.
A NAND gate is equivalent to an OR gate with inverted inputs.
( x y) x y
( x y) x y
55
Example
Example
Simplify the expression
z ( A C ) ( B D)
57
Solution
Given z = (A + C) (B + D)
Let' s put,
x = (A + C) and y = (B + D)
We have,
z= x y= x+y
z = A+C+B+D
z = ( A C) + B D
z = AC + BD
Transformasi Anda Bermula di SiniFKEE UTHM
58
Example
Determine the output expression for the following circuit
and simplify it using DeMorgans theorems
59
Solution
60
Universality of NAND and NOR Gates
Universality of NAND and NOR Gates
62
Universality of NAND and NOR Gates
63
Universality of NOR Gates
64
Alternate Logic-Gate Representations
Alternate Logic-Gate Representations
66
Cont
67
Alternate Logic-Gate Representations
68
Alternate Logic-Gate Representations
69
IEEE/ANSI standard Logic Symbols
71
Digital Aircraft Systems
Common Logic Circuit Functions
Adders and subtractors
Digital clock circuits
Latches and flip flops
73
Adders & Subtractors
74
Digital Clock Circuits
Certain functions of digital circuits require a consistently
timed binary signal
A digital clock provides a stable frequency of binary 1s
and s
The heart of a digital clock is an oscillator, or
multivibrator circuit (a crystal material that being
commonly used to control the pulse time of a logic
circuit)
75
Latches & Flip-flop Circuits
Latches and flip-flop circuits are combinations of logic gates
that perform basic memory functions
Both types of circuits retain their output signal even after the
input signal has been removed; therefore, these circuits
remember the input data
Two basic latch circuits, the RS latch and the data-type latch
Flip-flop circuits are similar to latch circuits; however flip-flops
change their output upon presence of a trigger pulse
76
Further Readings
Aeronautical Radio Incorporated (ARINC)
Commercial Standard Digital Bus (CSDS)
Avionics Standard Communication Bus (ASCB)
Logic troubleshooting techniques
Built-In Test Equipment (BITE)
Data Bus Analyzers
Measurement of logic levels
High-Energy Radiated Electromagnetic Fields (HERF)
Electrocstatic Discharge-Sensitive (ESDS) Components
77
The End