MinimI2ation O

o Boolean unction using Karnauah map

and repre sentation
using koaic gates
This Section deals
This with Boolean algebra

and seveval simplification techniques. The first step s to learn

algebra Using these
we
the laws and theorems of boolean .

Can earrange boolean equations to a7ve at simpler 0qlog

cizcuit. karnaugh map (K-map) is a method to Sioplify
are
boolean equattons. In this approach geometnic techniques
used to Simplify logic
circuits
Theve ane two fundamental approaches
Loqic desiqn the Sum and procuc
fproduct (soP) method
OSum (PoS) nmethod Either method produce a loqic ciCut
CoTTesponding to a iven truth table

Boolea Laws and heorems

Basic laws 1) h e tommutatve lau

A+B B+A +8
9 - AB
B BA

2) The Associative law

+(BtC) = CAB)+ A (BC)= (AB)c
3) The Distvibutwe law
A (BC) AB+ AC

OR Operations
1) + O A 4) A+ A 1

2) A+ A A

3) A+ 1 = 1
 AND Operations

1) A1 A 3) A O O

2) AA A 4) A O

*The Double Tnversion Rule A A

De MoYqan's heovem

AtB B3 AB +B

Exclusive - OR

AB =AB +A B
Exclusive - NOR

AO B AB + B
Gu Prove that A ( (AB t¢) ( +Z) = oO
(AA +Ac) ( +AB + BC + CC )

ACAB ABZ +ABc

A ABC+ AÃ BC + AABCC =

SOM OF PRODUCT METHOD

Consider we have tuwo nput Signals. here ave
our possuble ways to ANO make the output product -1) these
tuoo
signals ave m COmplemented oT uncomplemented prm hese
Outputs ave called fundamenta) products.he fund amental
pJoductS ave also called
mintevms
A he antevms ae
Fundamental
Produc A B, 8, AB and AB
O high B mo
These are vepre sented
B
1 AB m b mo, m, ,m2 I Mz:
AB
 Fundamental products fox 3 inputs

A B C Fundamental puoducts
O ABC mo
O
BC
1 O M2
B
1 1 BC

1 ABC MA
O 1 ABC mS
AB
1 1
ABC
1

Fe n vaziable problem, theve can be 2 no ominterms.

eg- Tnput 2 vanable minteams -24.

Tnput 3 vanables no Of mintems =2 8

Fundamental products 4 inputs

Fundamental pxoducts
AB C D

O o BED
BD

O 1 ABCD m2

1 1 BcD m3

1 oo ABED

O 1 O 1 ABED
1 ABD

1 1 1 8CD m1
1
O ABD
1 O 1 ABcD
1 O 1 1 BBCD
1 ABO Mi2
 1 1 ABD
1 1 ABCD O14
1 1 ABCD

Sum of Product Eauatons

cnsider a thuth table Based on this tuth table we have

the loqic equaticn In th Sum pxOcluct fom

Step 1 Locate each cutput 1 in
he trutn table
and wnte down the fundamental produt+
, m ,Ms ABe
O
m BBC
1 AB
1 ms Step 2 Tget the Sum f product equatren,
1 O4 we have to CR the sundamental preducts
1 1 1 ms A8 +Bc + ABZ+ AB
1 M
1 1 1 m1 F (A B.c) 2m (2,5,6,T)
2 Summation cr loq1ual CR Operaticn
Loaic Grcuit
ter aetting he sum product equation, we have
to deive the lgic ciuit. he Sumf preduct Solution Tesults in an
BND OR 0 NAND - NAND netwcsk.

C D
D
- BC+ PBC+BC +ABc

AND-OR Solution
Qu:example-) van\oble uh table has ahiah p dor hese

nput (onddion Ouo, DiG, oo,l1o who{ K the um f puduct

Ciacuit Dlo implfu he (ovespondin04 bouleon equatun

oo 1 BE
1

0 1 1
B
1
1AB
1 1
1
1
1 AB B
D A (B4B)+ A (B +B)
B AEAT
a (A1A) C

Kainaugh- máP
the fundamentad
K-map IavIKual display o
ofP1oduct olutwn
PYOlucts needed fov Sum

lwo Uaable map

A B
- AB+ AB
O O O Mo - Z 2,3) A BE m

O
B B A AB
m3
m2- AB
O

1 g B 1

hxee- Vaziable map

Doaw a
k-map for the loqic equation F (A,B.c) 2m(2,6,1)
C
- A B BEo O B mo m, AB ABZ ABC
AB AB
DB DBC AB B AB ABC
AB e z B
 foud Vaable - nmap
Daw a A- vaiable k-map for : F (A,8,<,D) » 2m (1,6,1,4)
D CD CD
m BD cD TD CD CD
O6 P BCD 1 0 Bm4 M5 91 m
BBO o 1 1
bBmi2 mi3 mis M14
14 ABCD B 1 B a m Mu Mio

AB O 0o

enteved vaviable map

1n enteved vanable map, one othe Input vaviable Is

placed inside the k-map This educes the k-map Size by 1-deqree. -

ConsideY a 3-variable truth table.

A B *C15 taken an he map as enteved vaiable

B
o 1
O
1
O 1
A O

1 o 0 |o
1
o o
1

fais Quads aOckects

K- map 1s a epres entation aboolean equation. Paus
Gudds and octects ave joined o the simplification t h e boolean
equaton using k-map
1 Paras
A pai elminales
B one vaviable
B Oo(1 1) ABC+ ABT
E O
 Auas
Auad s a auur adaert fM luo vaaiables (an be

eltminated

E O o O AB
BC
(D4D) ABc (D+D)
1 1 1 1 DBC BC
O
AB

3 Octects
D D CD CD

B 0 O O
he qoup a adjarent enght hxee vanables
DBO O
Can be eluminated.
1 1 1 T|
AE 1 1 1 1
A

K-map Simplificaution
As we know, a pai euiinaleone vaniable and its

Conoponent, a quad eluminates 2 vaviables and an octect eluminats

3 Vaiables. The step
o K-map Simplufication ane
1) Dxauw k-map Correspondung to the tuh table
2) nude the octect 7st, then quad and then pai

3 1 any Isolated 's ave hee, enciacle them and eliminate eduntan
4) wite he pps
boolean equatwn
o-Wloile he Simplufied boolean equation f0x he loqi equation
loq equaturn
texms F(AB,CD)
Cxpressed by min
m
(,2,3,6,s, 1,0,12, 13, 14)
ne o 1 1 1
ABO + (D + AT
E O O1

he1 1
1
 Rolluna map.
PmothevN way to Jovm he laaqest aoup ofcne's bu
ollung
O

PB O
AG D +
ABCD
B
ABD (T4C)+ ABD (EA¢).
e BD (6+A) BD
Eliminatung Reduntaunt qroups
Dter enccluna xoups, eltminate an eduntant qoup
hat s a qaoup whose one's aae alheady used b oher qroups
feve we can
eluminate the
O O 1O quad Sine
Since
alhe one's i
1 1 O the quad are a pat of
B O1 11 othe qDup 1 an one in the quad is
let ree, then we should tonsides the
quad also.
B +AZO + ABC+ Bc D

Simplificatton of entered variable map

1s steP step
=
B B
B +Ae

O 1
Bc ABB

O O O O
B BA+B7
B1 A

BA = B
 Don't (axe (ondituOn

) Daaw a map with , 1% and doi(aves

he aclual 1' On he k
fnctacle map n he lavgest q1oup u
Can find b fveating the dont (anes a 1

3) Dftes 1he artual 1 have been tncluded ( u p s , discard he

Visualising hem a, O's.

nemaunnq dont (ane, b

AD

E X xXx
1

PRODUCT OF SOM METHOD

With prcluct Sum (Pos) method, the undameotal
Sum produces an oulput zevo fos he toresponding input Condito%
input
Tne undamental sums ave ako called Max terms (Mi)

B fundamental e, AtB, AB B ,AB Ae the

qDup
undaments sum of a two rpuE
O O +B M
AB M yariable truth table -

+B M2
1
1 AB Ma

Tbee- Vaniable

BB Fundamental sum

Mo
O

1 M
M2
1 O
M3

1 O A+B1C MA
M
Ma
M
 (onuertn4 a tuth table lo an equation

xLocate he output o's the truth table and write down he

undamental Sum
AND the undamental Sum to foum the boolean equatton

O0O O AtBtC Mo
F (A,B.c) T M(0,3,6)

1 -(A+8+c). (a4 B4) (5 4 +c)

1 1 O A+B+7 Ma
1 O 1
1 1 1

1 o
+B +C M
1 1

LOGIC CIRCOIT
Loqic
Loalc CIruit of product OSum equaton 15 drawn

ou
OR-OR- AND netwoxk ox NOR NOR network.

-Draw he loqe urui of the above equation

(AB1) (A+ B+a) ( AB+<)

A

OR-AnND Netioosk.

NORNOR Nettoonk
Simplification of Boolean equation t Pos using K-mn
q - Simplify the Boclean expressIon, - TM (4 5.6 1.34) 15 metod
M4 Ol O0 A+B++D
C+D E +D
Ms 1O A+B ++D 1 1
M A+
M OL 1 1 1 1

Mg o00 + B+C+D +B

Ma loO B+(+D - (A). (B-e-c)

2n method
TIM (4,5,6.1,s.a) 2m(c,,2,3,10,u,12,13,14,15)
hE 1 1 Take the Complemen
B O O O
B
AB 1 111

AE O o 11
B O
AB AB
(AB) (A8¢