Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Download as pdf or txt
Download as pdf or txt
You are on page 1of 37

ICT 1105 – Digital Electronics

Fundamentals

Basic Logic Operations,


Boolean Expressions,
and
Boolean Algebra
Basic Logic Operations

2
Basic Logic Operations
 AND
 OR
 NOT (Complement)

 Order of Precedence
1. NOT
2. AND
3. OR
 can be modified using parenthesis

3
Basic Logic Operations

4
Basic Logic Operations

5
Additional Logic Operations
 NAND
 F = (A . B)'
 NOR
 F = (A + B)'
 XOR
 Output is 1 iff either input is 1, but not both.
 XNOR (aka. Equivalence)
 Output is 1 iff both inputs are 1 or both inputs
are 0.

6
Additional Logic Operations
NAND XOR

NOR denotes inversion XNOR

7
Additional Logic Operations

Exercise:

Derive the Truth table for each of the


following logic operations:

1. 2-input NAND
2. 2-input NOR

8
Additional Logic Operations

Exercise:

Derive the Truth table for each of the


following logic operations:

1. 2-input XOR
2. 2-input XNOR

9
Truth Tables

10
Truth Tables
 Used to describe the functional behavior of a Boolean
expression and/or Logic circuit.
 Each row in the truth table represents a unique
combination of the input variables.
 For n input variables, there are 2n rows.
 The output of the logic function is defined for each
row.
 Each row is assigned a numerical value, with the rows
listed in ascending order.
 The order of the input variables defined in the logic
function is important.

11
3-input Truth Table

F(A,B,C) = Boolean expression

12
4-input Truth Table

F(A,B,C,D) = Boolean expression

13
Boolean Expressions

14
Boolean Expressions
 Boolean expressions are composed of
 Literals – variables and their complements
 Logical operations
 Examples
 F = A.B'.C + A'.B.C' + A.B.C + A'.B'.C'

literals logic operations

 F = (A+B+C').(A'+B'+C).(A+B+C)
 F = A.B'.C' + A.(B.C' + B'.C)

15
Boolean Expressions
 Boolean expressions are realized using a
network (or combination) of logic gates.
 Each logic gate implements one of the logic
operations in the Boolean expression
 Each input to a logic gate represents one of
the literals in the Boolean expression
A
B
literals logic operations

16
Boolean Expressions
 Boolean expressions are evaluated by
 Substituting a 0 or 1 for each literal
 Calculating the logical value of the expression
 A Truth Table specifies the value of the Boolean
expression for every combination of the
variables in the Boolean expression.
 For an n-variable Boolean expression, the truth
table has 2n rows (one for each combination).

17
Boolean Expressions

Example:

Evaluate the following Boolean expression,


for all combination of inputs, using a Truth
table.

F(A,B,C) = A'.B'.C + A.B'.C' + A.C

18
Boolean Expressions
 Two Boolean expressions are equivalent if they
have the same value for each combination of
the variables in the Boolean expression.
 F1 = (A + B)'
 F2 = A'.B'
 How do you prove that two Boolean
expressions are equivalent?
 Truth table
 Boolean Algebra

19
Boolean Expressions

Example:

Using a Truth table, prove that the following


two Boolean expressions are equivalent.

F1 = (A + B)'
F2 = A'.B'

20
Boolean Algebra

21
Boolean Algebra
 George Boole developed an algebraic description for
processes involving logical thought and reasoning.
 Became known as Boolean Algebra
 Claude Shannon later demonstrated that Boolean
Algebra could be used to describe switching circuits.
 Switching circuits are circuits built from devices that
switch between two states (e.g. 0 and 1).
 Switching Algebra is a special case of Boolean
Algebra in which all variables take on just two distinct
values
 Boolean Algebra is a powerful tool for analyzing and
designing logic circuits.
22
Basic Laws and Theorems

Commutative Law A+B=B+A A.B = B.A


Associative Law A + (B + C) = (A + B) + C A . (B . C) = (A . B) . C
Distributive Law A.(B + C) = AB + AC A + (B . C) = (A + B) . (A + C)
Null Elements A+1=1 A.0=0
Identity A+0=A A.1=A
Idempotence A+A=A A.A=A
Complement A + A' = 1 A . A' = 0
Involution A'' = A
Absorption (Covering) A + AB = A A . (A + B) = A
Simplification A + A'B = A + B A . (A' + B) = A . B
DeMorgan's Rule (A + B)' = A'.B' (A . B)' = A' + B'
Logic Adjacency (Combining) AB + AB' = A (A + B) . (A + B') = A
Consensus AB + BC + A'C = AB + A'C (A + B) . (B + C) . (A' + C) = (A + B) . (A' + C)

23
Idempotence
A+A=A
F = ABC + ABC' + ABC
F = ABC + ABC'
Note: terms can also be added using this theorem

A.A=A
G = (A' + B + C').(A + B' + C).(A + B' + C)
G = (A' + B + C') + (A + B' + C)
Note: terms can also be added using this theorem

24
Complement
A + A' = 1
F = ABC'D + ABCD
F = ABD.(C' + C)
F = ABD

A . A' = 0
G = (A + B + C + D).(A + B' + C + D)
G = (A + C + D) + (B . B')
G=A+C+D

25
Distributive Law
A.(B + C) = AB + AC A + (B.C) = (A + B).(A + C)

F = WX.(Y + Z) F = WX + (Y.Z)
F = WXY + WXZ F = (WX + Y).(WX + Z)

G = B'.(AC + AD) G = B' + (A.C.D)


G = AB'C + AB'D G = (B' + A).(B' + C).(B' + D)

H = A.(W'X + WX' + YZ) H = A + ( (W'X).(WX') )


H = AW'X + AWX' + AYZ H = (A + W'X).(A + WX')

26
Absorption (Covering)
A + AB = A A.(A + B) = A

F = A'BC + A' F = A'.(A' + BC)


F = A' F = A'

G = XYZ + XY'Z + X'Y'Z' + XZ G = XZ.(XZ + Y + Y')


G = XYZ + XZ + X'Y'Z' G = XZ.(XZ + Y)
G = XZ + X'Y'Z' G = XZ

H = D + DE + DEF H = D.(D + E + EF)


H=D
H=D
27
Simplification
A + A'B = A + B

F = (XY + Z).(Y'W + Z'V') + (XY + Z)'


F = Y'W + Z'V' + (XY + Z)'

A.(A' + B) = A . B

G = (X + Y).( (X + Y)' + (WZ) )


G = (X + Y) . WZ

28
Logic Adjacency (Combining)
A.B + A.B' = A

F = (X + Y).(W'X'Z) + (X + Y).(W'X'Z)'
F = (X + Y)

(A + B).(A + B') = A

G = (XY + X'Z').(XY + (X'Z')' )


G = XY

29
Boolean Algebra

Example:

Using Boolean Algebra, simplify the following


Boolean expression.

F(A,B,C) = A'.B.C + A.B'.C + A.B.C

30
Boolean Algebra

Example:

Using Boolean Algebra, simplify the following


Boolean expression.

F(A,B,C) = (A'+B'+C').(A'+B+C').(A+B'+C')

31
DeMorgan's Laws
 Can be stated as follows:
 The complement of the product (AND) is the
sum (OR) of the complements.
 (X.Y)' = X' + Y'
 The complement of the sum (OR) is the
product (AND) of the complements.
 (X + Y)' = X' . Y'
 Easily generalized to n variables.
 Can be proven using a Truth table

32
Proving DeMorgan's Law
(X . Y)' = X' + Y'

33
DeMorgan's Theorems
x1
x1 x1
x2 x2
x2

(a) x1 x2 = x1 + x2

x1
x1 x1
x2 x2
x2

(b) x1 + x2 = x1 x2

34
Importance of Boolean Algebra

 Boolean Algebra is used to simplify Boolean


expressions.
– Through application of the Laws and Theorems
discussed
 Simpler expressions lead to simpler circuit realization,
which, generally, reduces cost, area requirements, and
power consumption.
 The objective of the digital circuit designer is to design
and realize optimal digital circuits.

35
Algebraic Simplification
 Justification for simplifying Boolean expressions:
– Reduces the cost associated with realizing the
expression using logic gates.
– Reduces the area (i.e. silicon) required to fabricate the
switching function.
– Reduces the power consumption of the circuit.
 In general, there is no easy way to determine when a
Boolean expression has been simplified to a minimum
number of terms or minimum number of literals.
– No unique solution

36
Algebraic Simplification
 Boolean (or Switching) expressions can be
simplified using the following methods:
1. Multiplying out the expression
2. Factoring the expression
3. Combining terms of the expression
4. Eliminating terms in the expression
5. Eliminating literals in the expression
6. Adding redundant terms to the expression
As we shall see, there are other tools that can be used to simplify Boolean Expressions.
Namely, Karnaugh Maps.

37

You might also like