Scribd
Upload
68 views

Simplification of Boolean Function

This document discusses simplification of Boolean functions using Karnaugh maps. It provides the following information: - There are two main methods for simplifying Boolean functions: the algebraic method using identities and the graphical method using Karnaugh maps. - Karnaugh maps allow simplifying functions through grouping of adjacent 1s in the map. They become easier to use for more variables by having the rows and columns in a reflected binary code. - Examples of 2, 3, and 4-variable Karnaugh maps are shown along with simplified Boolean functions found using the grouping approach. - Implementation of simplified functions can then be done using logic gates, reducing the total number of gates needed.

Uploaded by

Arshad Kv
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
68 views

Simplification of Boolean Function

This document discusses simplification of Boolean functions using Karnaugh maps. It provides the following information: - There are two main methods for simplifying Boolean functions: the algebraic method using identities and the graphical method using Karnaugh maps. - Karnaugh maps allow simplifying functions through grouping of adjacent 1s in the map. They become easier to use for more variables by having the rows and columns in a reflected binary code. - Examples of 2, 3, and 4-variable Karnaugh maps are shown along with simplified Boolean functions found using the grouping approach. - Implementation of simplified functions can then be done using logic gates, reducing the total number of gates needed.

Uploaded by

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

Islamic University

Simplification of Boolean Functions:

An implementation of a Boolean

Function requires the use of logic


gates.
A smaller number of gates, with each
gate (other then Inverter) having less
number of inputs, may reduce the cost
of the implementation.
There are 2 methods for simplification
of Boolean functions.
2

Simplification of Boolean Functions:


Two Methods

The algebraic method by using Identities


The graphical method by using Karnaugh Map
method

The

K-map method is easy and


straightforward. This method was first
proposed by Veitch and later slightly
modified by Karnaugh
A K-map for a function of n variables
consists of 2n cells, and,
in every row and column, two adjacent cells
should differ in the value of only one of the
logic variables.

Examples of K-Maps:

Examples:
Cell numbers are written in the cells.

2-variable K-map

Note that A appears primed in row 0 and unprimed in


row 1. Similarly B appears primed in column 0 and
4
unprimed in column 1.

The function F=AB

The function F=A+B


5

3-Variable K-Map:

3-variable K-map
There are 8 minterms for 3 variables.
Therefore a three-variable K-Map
consists of eight squares.

4-variable K-map
4-variable K-map
Four variable Karnaugh map contains 24
= 16 squares.
m0

m1

m3

m2

m4

m5

m7

m6

m12

m13

m15

m14

m8

m9

m11

m10

The rows and columns in the above K-Map are


numbered in a reflected code sequence, with
only one digit changing its value between two
adjacent rows or columns.

Part 1
F = ABC + ABC + ABC + ABC
= 000 + 001+110+111
Minterm shorthand equation
=(0,1,6,7)

F=AB+AB

10

Logic Diagram
A
B

11

Part 2: control of pseudo


4-bit binary codes

12

CD

00
0
00 10
01 0
11 1
10 0

AB

01

11

Q=AB+AC

13

NAND TECHNOLOGY

14

Logic diagram

15

You might also like