Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
12 views24 pages

Simplification of Boolean Functions Map Method: Complexity of The Digital Logic Gates That Implement A Boolean Function

The document discusses the simplification of Boolean functions using the Map Method, which provides a visual and systematic approach to minimize complex algebraic expressions. It covers the Karnaugh Map for two, three, and four variables, detailing how to simplify Boolean functions and utilize 'don't care' conditions for further optimization. Additionally, it addresses the implementation of functions using NAND and NOR gates.

Uploaded by

boo20012007
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
12 views24 pages

Simplification of Boolean Functions Map Method: Complexity of The Digital Logic Gates That Implement A Boolean Function

The document discusses the simplification of Boolean functions using the Map Method, which provides a visual and systematic approach to minimize complex algebraic expressions. It covers the Karnaugh Map for two, three, and four variables, detailing how to simplify Boolean functions and utilize 'don't care' conditions for further optimization. Additionally, it addresses the implementation of functions using NAND and NOR gates.

Uploaded by

boo20012007
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/ 24

Simplification of Boolean Functions

Map Method
• Complexity of the digital logic gates that implement a Boolean
function
– directly related to the complexity of the algebraic expression
implemented.
• Simplification by algebraic means is awkward
– due to the lack of specific rules to predict succeeding steps.
• Map method provides
– straightforward procedure for minimizing Boolean functions
– Can be considered as pictorial form of a truth table or as an extension of
the Venn diagram
• First proposed by Veitch (1) and slightly modified by Karnaugh (2),
– known as the “Veitch diagram” or the “Karnaugh map.”
Karnaugh Map
• Map is a diagram made up of squares.
– Each square represents one minterm.
– presents a visual diagram of all possible ways a function may
be expressed in a standard form.
• By recognizing various patterns,
– alternative algebraic expressions for the same function is
derived.
– Simplest expression is selected (with minimum literals- not
necessarily unique).
Two variable map
• Useful way to represent any one of the 16 Boolean
functions of two variables
Three variable map
• Minterms are arranged, not in a binary sequence, but in a
sequence where,
– only one bit changes from 1 to 0 or from 0 to 1.
Simplify the Boolean function:
F = x′yz + x′yz′ + xy′z′ + xy′z
• 1 marked in each square as needed to represent the
function.
• Adjacent squares are grouped together (minterms differ
by 1 variable).
Simplify the Boolean function:
F = x′yz + x′yz′ + xy′z′ + xy′z
• Ans: F=x′y+xy′
Simplify F = x′yz + xy′z′ + xyz + xyz′
Simplify F = A′C + A′B + AB′C + BC
Simplify F(x,y, z) = Σ(0, 2, 4, 5, 6).
Four variable map
• 16 minterms
• Rows and columns are numbered
– with only one digit changing value between two adjacent rows
or columns.
• Each square can be obtained from the concatenation of
the row number with the column number.
Four variable map (continued..)
Simplify F(w, x,y, z) = Σ(0, 1, 2, 4, 5, 6, 8, 9,
12, 13, 14)
Simplify F = A′B′C′ + B′CD′ + A′BCD′ +
AB′C′
Product of Sums Simplification
• All problems were on sum of products.
• Write the equation for F′.
• Find its’s complement F′′ to get the equation of the
function in the POS form.
Simplify F (A, B, C, D) = Σ(0, 1, 2, 5, 8, 9, 10)
(a) sum of products
(b) product of sums.

F = (A′ + B′ ) (C′ + D′) (B′ + D′)


Simplify F (x, y, z) = Π (0, 2, 5, 7)
Don’t care Conditions
• A four-bit decimal code has six combinations which are not
used.
• Digital circuit using this code operates under the assumption
that
– unused combinations never occurs when the system works properly.
• Hence, we don’t care what the function o/p is for these
combinations.
– can be used for further simplification of the function.
• It is marked as ‘X’ to distinguish it from 1’s and 0’s.
– For simplification, it can assume either 0 or 1, whichever gives the
simplest expression.
Simplify
F(w, x, y, z) = Σ(1,3, 7, 11, 15) and the don’t-care
conditions:
d(w, x, y, z) = Σ(0, 2, 5)
NAND and NOR Implementation
Implement F = AB + CD + E
a) AND and OR gates.
b) Using NAND gates.
Implement with NAND gates
• F(x, y, z) = Σ (0, 6)
• Implement F′.
NOR implementation
Implement with NOR gates
• F(x, y, z) = Σ (0, 6)
• Implement F′.
Review
• Map method for 3 and 4 variables.
• Don’t care condition
• NOR and NAND implementation

You might also like