Scribd
Upload
256 views10 pages

Minimization: Uniting Theorem Grouping of Terms in Boolean Functions Cubes Karnaugh Maps

The document discusses techniques for minimizing Boolean logic functions, including: 1) Minimizing Boolean functions using the uniting theorem and grouping terms on Karnaugh maps. 2) Simplifying two-level combinational logic by finding minimal sum-of-products or product-of-sums realizations and exploiting don't care conditions. 3) Computer-aided design tools use heuristic methods to find good solutions for large functions in a reasonable time.

Uploaded by

Adari G V Chiranjeevi ACOE
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
256 views10 pages

Minimization: Uniting Theorem Grouping of Terms in Boolean Functions Cubes Karnaugh Maps

The document discusses techniques for minimizing Boolean logic functions, including: 1) Minimizing Boolean functions using the uniting theorem and grouping terms on Karnaugh maps. 2) Simplifying two-level combinational logic by finding minimal sum-of-products or product-of-sums realizations and exploiting don't care conditions. 3) Computer-aided design tools use heuristic methods to find good solutions for large functions in a reasonable time.

Uploaded by

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

Minimization of

Boolean logic
 Minimization
 uniting theorem
 grouping of terms in Boolean functions
 Alternate representations of Boolean functions
 cubes
 Karnaugh maps

Winter CSE370 - V - Logic 1


Simplification of two-level
combinational logic
 Finding a minimal sum of products or product of sums realization
 exploit don’t care information in the process
 Algebraic simplification
 not an algorithmic/systematic procedure
 how do you know when the minimum realization has been found?
 Computer-aided design tools
 precise solutions require very long computation times, especially for
functions with many inputs (> 10)
 heuristic methods employed – "educated guesses" to reduce amount of
computation and yield good if not best solutions
 Hand methods still relevant
 to understand automatic tools and their strengths and weaknesses
 ability to check results (on small examples)

Winter CSE370 - V - Logic 2


The uniting
theorem
 Key tool to simplification: A (B’ + B) = A
 Essence of simplification of two-level logic
 find two element subsets of the ON-set where only one variable
changes its value – this single varying variable can be eliminated
and a single product term used to represent both elements

A B F
F = A’B’+AB’ = (A’+A)B’ = B’
0 0 1
0 1 0
B has the same value in both on-set rows
1 0 1 – B remains, actually B’ because B is 0 in both cases
1 1 0

A has a different value in the two rows


– A is eliminated
Winter CSE370 - V - Logic 3
Boolean
cubes
 Visual technique for indentifying when the uniting theorem
can be applied
 n input variables = n-dimensional "cube"

01 11
0 1
Y 2-cube
1-cube
X 10
00
X

1111
111 0111

3-cube 4-cube
YZ 101
Y
000 Z W
1000
X
0000 X
Winter CSE370 - V - Logic 4
Mapping truth tables onto
Boolean cubes
 Uniting theorem combines two "faces" of a cube
into a larger "face"
 Example:
F two faces of size 0 (nodes)
A B F combine into a face of size 1(line)
01 11
0 0 1
0 1 0 B

1 0 1 00 10
A
1 1 0

A varies within face, B does not


this face represents the literal B'
ON-set = solid nodes
OFF-set = empty nodes
DC-set = 'd nodes

Winter CSE370 - V - Logic 5


Three variable
example
 Binary full-adder carry-out logic
(A'+A)BCin

A B Cin Cout AB(Cin'+Cin)


111
0 0 0 0
0 0 1 0
0 1 0 0
0 1 1 1 BC 101
1 0 0 0
1 0 1 1 000 A
A(B+B')Cin
1 1 0 1
1 1 1 1 the on-set is completely covered by
the combination (OR) of the subcubes
of lower dimensionality - note that “111”
is covered three times

Cout = BCin+AB+ACin

Winter CSE370 - V - Logic 6


Higher dimensional
cubes
 Sub-cubes of higher dimension than 2

F(A,B,C) = m(4,5,6,7)
on-set forms a square
011 i.e., a cube of dimension 2
111 110 represents an expression in one variable
010
i.e., 3 dimensions – 2 dimensions
001
BC 101 A is asserted (true) and unchanged
B and C vary
000 A 100
This subcube represents the
literal A

Winter CSE370 - V - Logic 7


m-dimensional cubes in a n-
dimensional Boolean space
 In a 3-cube (three variables):
 a 0-cube, i.e., a single node, yields a term in 3 literals
 a 1-cube, i.e., a line of two nodes, yields a term in 2 literals
 a 2-cube, i.e., a plane of four nodes, yields a term in 1 literal
 a 3-cube, i.e., a cube of eight nodes, yields a constant term "1"
 In general,
 an m-subcube within an n-cube (m < n) yields a term
with n – m literals

Winter CSE370 - V - Logic 8


Karnaugh
maps
 Flat map of Boolean cube
 wrap–around at edges
 hard to draw and visualize for more than 4 dimensions
 virtually impossible for more than 6 dimensions
 Alternative to truth-tables to help visualize adjacencies
 guide to applying the uniting theorem
 on-set elements with only one variable changing value are
adjacent unlike the situation in a linear truth-table
A B F
A
B 0 1 0 0 1
0 1 1
0 2 0 1 0
1 0 0 1 0 1
1 3
1 1 0

Winter CSE370 - V - Logic 9


Karnaugh maps
(cont’d)
 Numbering scheme based on Gray–code
 e.g., 00, 01, 11, 10
 only a single bit changes in code for adjacent map cells

AB A
C 00 01
11 10 A
0
0 2 6 4
0 4 12 8

C 1 1 3 7 5
1 5 13 9
B D
3 7 15 11
A
C
0 2 6 4 2 6 14 10
B
C 13 = 1101= ABC’D
1 3 7 5
B

Winter CSE370 - V - Logic 1

You might also like