Scribd
Upload
28 views18 pages

3-Boolean Algebra Cont'd

Uploaded by

Hamayun
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
28 views18 pages

3-Boolean Algebra Cont'd

Uploaded by

Hamayun
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 18

ACS134

DIGITAL & EMBEDDED SYSTEMS

LECTURE 5
BOOLEAN ALGEBRA (cont’d)
2
Recap

• Boolean Algebra
• Properties
• Theorems
3
Outline

• Expressions of Boolean functions


• Algebraic equations
• Symbols
• Truth tables
• Simplifications of Boolean expressions
• Complementing functions
• Canonical forms
4
Boolean functions

Given the expression G = xy + yz, draw the corresponding


truth table and the circuit diagram

x y z
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1
5
Representation conversion

• Need to transition between boolean expression, truth


table, and circuit (symbols).
• Converting between expression and circuit is easy.
• Converting from expression to truth table is easy.
• More difficult to convert truth table to expression or
circuit.

Circuit Boolean
Expression

Truth
Table
Truth table to expression 6

Converting a truth table to an expression:


• Each row with output of 1 becomes a product term
• Sum product terms together

x y z G
0 0 0 0
Any Boolean Expression can be
0 0 1 0
0 1 0 0 represented in sum of products form!
0 1 1 1
1 0 0 0
1 0 1 0
1 1 0 1
1 1 1 1
7
Equivalent representations of
circuits
• Number of 1’s in truth table output column equals AND
terms for Sum-of-Products (SOP)

x y z G x
0 0 0 0
0 0 1 0
y
0 1 0 0 G
0 1 1 1
1 0 0 0
1 0 1 0 z
1 1 0 1
1 1 1 1
G = xyz + xyz’ + x’yz
8
Reducing Boolean
Expressions
• Is this the smallest possible implementation of
expression G = xyz + xyz’ + x’yz ?
• Use Boolean Algebra rules to reduce complexity while
preserving functionality.
• Step 1: Use a + a = a:
xyz + xyz’ + x’yz = xyz + xyz + xyz’ + x’yz
• Step 2: Use distributive rule a(b + c) = ab + ac:
xyz + xyz + xyz’ + x’yz = xy(z + z’) + yz(x + x’)
• Step 3: Use a + a’ = 1:
xy(z + z’) + yz(x + x’) = xy  1 + yz  1
• Step 4: Use a  1 = a
xy  1 + yz  1 = xy + yz
9
Reduced hardware
implementation
• Reduced equation requires less hardware (compare with
circuit on Slide#7)!
• Same function implemented!
x y z G
0 0 0 0
x
0 0 1 0 y
0 1 0 0 G
0 1 1 1
1 0 0 0
1 0 1 0 z
1 1 0 1
1 1 1 1

G = xyz + xyz’ + x’yz = xy + yz


10
Complementing functions

x y z G G’
0 0 0 0 1
0 0 1 0 1 G = xyz + xyz’ + x’yz
0 1 0 0 1
0 1 1 1 0
1 0 0 0 1 G’ = (xyz + xyz’ + x’yz)’
1 0 1 0 1
1 1 0 1 0
1 1 1 1 0

Can we find a simpler representation?


11
Complementing functions
G = a + b+ c
G’ = (a + b + c)’
• Step 1: assign temporary names
 b + c -> z
 (a + z)’ = G’
• Step 2: Use DeMorgans’ Law
 (a + z)’ = a’  z’
• Step 3: Resubstitute (b+c) for z
 a’  z’ = a’  (b + c)’
• Step 4: Use DeMorgans’ Law
 a’  (b + c)’ = a’  (b’  c’) G’ = a’  b’  c’ = a’b’c’
• Step 5: Associative rule
 a’  (b’  c’) = a’  b’  c’
12
Complementation example

• Find complement of F = x’z + yz


F’ = (x’z + yz)’
• DeMorgan’s

• DeMorgan’s

• Reduction -> eliminate double complement on x

This format is called Product of Sums


13
Minterms and Maxterms
• Each variable within a term in a Boolean expression in
complemented (x’) or uncomplemented (x) form is a literal
• Minterm is a product of all the literals (with or without
complement)
• Maxterm is a sum of all the literals (with or without
complement)
For example: For example:
Minterms Maxterms
x y z Minterm x y z Maxterm
0 0 0 x’y’z’ m0 0 0 0 x+y+z M0
0 0 1 x’y’z m1 0 0 1 x+y+z’ M1
… …
1 0 0 xy’z’ m4 1 0 0 x’+y+z M4
… …
1 1 1 xyz m7 1 1 1 x’+y’+z’ M7
Representing functions 14

with Minterms
• Minterm number same as row position in truth table
(starting from top from 0)
• Shorthand way to represent functions

x y z G
0 0 0 0
0 0 1 0
0 1 0 0 G = xyz + xyz’ + x’yz
0 1 1 1
1 0 0 0
1 0 1 0 G = m7 + m6 + m3 = Σ(3, 6, 7)
1 1 0 1
1 1 1 1
15

Conversion between canonical


forms
Canonical forms: sum of minterms, product of maxterms

x y z G G = xyz + xyz’ + x’yz


0 0 0 0
0 0 1 0
0 1 0 0 G = m7 + m6 + m3 = Σ(3, 6, 7)
0 1 1 1
1 0 0 0
1 0 1 0 G = M0M1M2M4M5 = Π(0,1,2,4,5)
1 1 0 1
1 1 1 1
G = (x+y+z)(x+y+z’)(x+y’+z)(x’+y+z)(x’+y+z’)
16
Representation of circuits

• All logic expressions can be represented in 2-level


format
• Circuits can be reduced to minimal 2-level
representation
• Sum of products representation most common in
industry.
17

Private Study

• Review the slides

• Mano, Ciletti, Digital Design:


• Read Chapter 2: Sections 2.5 and 2.6
18

Summary
• Expressions of Boolean functions
• Algebraic equations
• Symbols
• Truth tables
• Simplifications of Boolean expressions
• Complementing functions
• Canonical forms

You might also like