S3 BDU10803 Digital Electronics B v1

Electrical & Electronic Technology
for Aeronautical Engineers - Semester III 2015/2016
Topic 1: Digital Electronics - B
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.
Transformasi Anda Bermula di SiniFKEE UTHM
2
Logic Gates and Truth Table
Boolean Constants & Variables
Boolean algebra allows only two values; 0 and 1.

Logic 0 can be: false, off, low, no, open switch.
Logic 1 can be: true, on, high, yes, closed switch.
Three basic logic operations: OR, AND, and NOT.
4
Truth Tables
A truth table describes the relationship between the

input and output of a logic circuit.
The number of entries corresponds to the number of
inputs.
For example a 2 input table would have 22 or 4
entries. A 3 input table would have 23 or 8 entries.
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.
Truth table and circuit symbol for a two input OR

gate.

7
7
Cont
The OR operation is similar to addition but where

A and B are 1, the OR operation produces
1+1=1.
In the Boolean expression
x=1+1+1=1
x is true (1) when A is true (1) OR B is true (1) OR C is true (1).
8
Example
Example
Determine the OR gate output for the following figure.
10
Solution
11
Example
Determine the OR gate output for the following figure.
12
Solution
13
AND Operations with AND Gates
The Boolean expression for the AND operation is

x=AB
This is read as x equals A and B.
x will equal 1 when A and B equal 1.
Truth table and circuit symbol for a two input AND gate. Notice
the difference between OR and AND gates.
14
AND Operation with AND Gates
The AND operation is similar to multiplication.

In the Boolean expression
x=ABC
x will equal 1 only when A, B, and C are all 1.
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
The Boolean expression for the NOT operation is

xA
This is read as:
x equals NOT A, or
x equals the inverse of A, or
x equals the complement of A
19
Cont
Truth table, symbol, and sample waveform for the

NOT circuit.
20
Describing Logic Circuits Algebraically
Describing Logic Circuits Algebraically
The three basic Boolean operations (OR, AND, NOT) can

describe any logic circuit.
If an expression contains both AND and OR gates the
AND operation will be performed first, unless there is a
parenthesis in the expression.
22
Cont
Examples of Boolean expressions for logic

circuits:
23
Cont
The output of an inverter is equivalent to the input

with a bar over it.
Examples using inverters.
24
Evaluating Logic Circuit Outputs
Rules for evaluating a Boolean expression:

Perform all inversions of single terms.
Perform all operations within parenthesis.
Perform AND operation before an OR operation unless
parenthesis indicate otherwise.
If an expression has a bar over it, perform the operations inside
the expression and then invert the result.
25
Other Options
Evaluate Boolean expressions by substituting

values and performing the indicated operations
A 0,B 1,C 1, and D 1
x ABC(A D)
x 011 (0 1)
x 111 (0 1)
x 111 (1)
x 111 0
x 0
26
Implementing Circuits from Boolean Expressions
Implementing Circuits from Boolean Expressions
It is important to be able to draw a logic

circuit from a Boolean expression.
But, how?
28
Example
Example
30
Solution
31
Example
?
32
Solution
33
NOR Gates and NAND Gates
Combine basic AND, OR, and NOT operations.

The NOR gate is an inverted OR gate.
An inversion bubble is placed at the output of
the OR gate.
The Boolean expression is, x A B
34
The NAND gate is an inverted AND gate.

An inversion bubble is placed at the output
of the AND gate.
The Boolean expression is, x AB
35
The output of NAND and NOR gates may be

found by simply determining the output of an
AND or OR gate and inverting it.
The truth tables for NOR and NAND gates show
the complement of truth tables for OR and
AND gates.
36
(a) NOR symbol; (b) equivalent circuit; (c) truth table
37
(a) NAND symbol; (b) equivalent circuit; (c) truth table.
38
Example
Example
?
40
Solution
41
Example
?
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
Simplify the expression
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
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
When the OR sum of two variables is inverted,

it is equivalent to inverting each variable
individually and ANDing them.
When the AND product of two variables is
inverted, it is equivalent to inverting each
variable individually and ORing them.
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
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
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
NAND or NOR gates can be used to create the three

basic logic expressions (OR, AND, and INVERT)
Following slides illustrate how combinations of NANDs or
NORs are used to create the three logic functions.
This characteristic provides flexibility and is very useful in
logic circuit design.
62
63
Universality of NOR Gates
64
Alternate Logic-Gate Representations
To convert a standard symbol to an alternate:

Invert each input and output (add an inversion
bubble where there are none on the standard
symbol, and remove bubbles where they exist on the
standard symbol.
Change a standard OR gate to and AND gate, or an
AND gate to an OR gate.
66
Cont
The equivalence can be applied to gates with any

number of inputs.
No standard symbols have bubbles on their inputs.
All of the alternate symbols do.
The standard and alternate symbols represent the
same physical circuitry.
Next slides compares the standard and alternate
symbols.
67
68
Active high an input or output has no inversion

bubble.
Active low an input or output has an inversion
bubble.
An AND gate will produce an active output
when all inputs are in their active states.
An OR gate will produce an active output when
any input is in an active state.

69
69
IEEE/ANSI standard Logic Symbols
Rectangular symbols represent logic gates and

circuits.
Dependency notation inside symbols show how
output depends on inputs.
A small triangle replaces the inversion bubble.

70

70
IEEE/ANSI standard Logic Symbols
Compare the IEEE/ANSI symbols to

traditional symbols.
These symbols are not widely
accepted but may appear in some
schematics.
71
Digital Aircraft Systems
Common Logic Circuit Functions
Adders and subtractors
Digital clock circuits
Latches and flip flops
73
Adders & Subtractors
Perform basic calculations in computer

Adders ~ add binary digits
Half-adder ~ capable of adding two binary digits, but they
cannot carry a digit to the next higher-order column
Full-adder ~ a combination of two half-adders to carry any
necessary digits
Subtractors ~ subtract operations
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

S3 BDU10803 Digital Electronics B v1

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

S3 BDU10803 Digital Electronics B v1

Uploaded by

Copyright:

Available Formats

Electrical & Electronic Technology

for Aeronautical Engineers - Semester III 2015/2016

Topic 1: Digital Electronics - B

Transformasi Anda Bermula di SiniFKEE UTHM

Boolean algebra allows only two values; 0 and 1.

Transformasi Anda Bermula di SiniFKEE UTHM

A truth table describes the relationship between the

Transformasi Anda Bermula di SiniFKEE UTHM

Transformasi Anda Bermula di SiniFKEE UTHM

Truth table and circuit symbol for a two input OR

Transformasi Anda Bermula di SiniFKEE UTHM

The OR operation is similar to addition but where

Transformasi Anda Bermula di SiniFKEE UTHM

Determine the OR gate output for the following figure.

Transformasi Anda Bermula di SiniFKEE UTHM

Transformasi Anda Bermula di SiniFKEE UTHM

Transformasi Anda Bermula di SiniFKEE UTHM

Transformasi Anda Bermula di SiniFKEE UTHM

The Boolean expression for the AND operation is

Transformasi Anda Bermula di SiniFKEE UTHM

The AND operation is similar to multiplication.

Transformasi Anda Bermula di SiniFKEE UTHM

Transformasi Anda Bermula di SiniFKEE UTHM

Transformasi Anda Bermula di SiniFKEE UTHM

Transformasi Anda Bermula di SiniFKEE UTHM

The Boolean expression for the NOT operation is

Transformasi Anda Bermula di SiniFKEE UTHM

Truth table, symbol, and sample waveform for the

Transformasi Anda Bermula di SiniFKEE UTHM

The three basic Boolean operations (OR, AND, NOT) can

Transformasi Anda Bermula di SiniFKEE UTHM

Examples of Boolean expressions for logic

Transformasi Anda Bermula di SiniFKEE UTHM

The output of an inverter is equivalent to the input

Transformasi Anda Bermula di SiniFKEE UTHM

Rules for evaluating a Boolean expression:

Transformasi Anda Bermula di SiniFKEE UTHM

Evaluate Boolean expressions by substituting

It is important to be able to draw a logic

Transformasi Anda Bermula di SiniFKEE UTHM

Transformasi Anda Bermula di SiniFKEE UTHM

Transformasi Anda Bermula di SiniFKEE UTHM

Transformasi Anda Bermula di SiniFKEE UTHM

Combine basic AND, OR, and NOT operations.

Transformasi Anda Bermula di SiniFKEE UTHM

The NAND gate is an inverted AND gate.

Transformasi Anda Bermula di SiniFKEE UTHM

The output of NAND and NOR gates may be

Transformasi Anda Bermula di SiniFKEE UTHM

Transformasi Anda Bermula di SiniFKEE UTHM

Transformasi Anda Bermula di SiniFKEE UTHM

Transformasi Anda Bermula di SiniFKEE UTHM

Transformasi Anda Bermula di SiniFKEE UTHM

Transformasi Anda Bermula di SiniFKEE UTHM

Simplify the expression

Transformasi Anda Bermula di SiniFKEE UTHM

Transformasi Anda Bermula di SiniFKEE UTHM

Transformasi Anda Bermula di SiniFKEE UTHM

Transformasi Anda Bermula di SiniFKEE UTHM

When the OR sum of two variables is inverted,

Transformasi Anda Bermula di SiniFKEE UTHM

Transformasi Anda Bermula di SiniFKEE UTHM

Transformasi Anda Bermula di SiniFKEE UTHM

Transformasi Anda Bermula di SiniFKEE UTHM