0% found this document useful (0 votes)
2 views40 pages

Ece Module 1

The document provides an overview of Boolean algebra principles, including laws such as De Morgan's, commutativity, and distributivity. It discusses simplification techniques using Karnaugh maps and the representation of Boolean functions in standard and canonical forms. Additionally, it covers the implementation of digital circuits using basic gates and NAND gates.

Uploaded by

ThArùñ
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
0% found this document useful (0 votes)
2 views40 pages

Ece Module 1

The document provides an overview of Boolean algebra principles, including laws such as De Morgan's, commutativity, and distributivity. It discusses simplification techniques using Karnaugh maps and the representation of Boolean functions in standard and canonical forms. Additionally, it covers the implementation of digital circuits using basic gates and NAND gates.

Uploaded by

ThArùñ
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

30-0l- 0

Tnesday
Review of Booean Algna
haws

a. Cbmnmutate
9 DPstibutiwe
,

Theoom Piniples i
j De Morgan s haus (3and a)
a Duaity.
-’ ASs ecialuue law:
(A+B) +c a A+ CB+c)
(AB). C A (B.c)

Commutat Lao -
CAtB) (8+A)
(A8) (BA)

-’ Dstfbutie lau -

A+(B+c) (At8)i CAtc).


A. (B+c) lAB)+ (Ac)
Rules -
At0 = A

At|= 1

3 tdertityaug
4. A| A
5. A+A A
6.
ddonpontert la
A+ A = 1
8. A. A 0 Comptermert law

10. A + AB A

ACI+6)
AC) A

A+ AB At 8

(A+A). (A+B)
IA+B) AtB

A1 Bc - (A+B(A+e)
Jheom -
d Dernor gan The oim:
A + B

A+B A.B.

Duaity i
Riould be epPce, b 1 and

al 1'3
s' should be 9eplaced by o

AND Bgn (+) shoud be eplaced by OR SFn


(t) ound dR son l+) Bhoulol lbe ePlaceo by
AND gn (").

Earnple3 A+l A
Siptigícatíen -

AB + (8+c) +-B-B+e),
AB+ A(B+c) t B(8+ c)

AB+ AB+ AC + B.B + Bc.


AB+ ACt B+ Be

ABt AB
AB+ AC t B
8( 1+A) + Ac
B+ AC.

a. (AB L C+ BD] + A8) c

(ABC+ AB8D t AB) e

ABC + ABC

CAtA)
Bc CAtA) Bc () Bc
3. AB t Ac + AB

AB AetAB¬, 1

ABAE ABe
ABtt+
ABtAc t A Bc

(AB). (Ac)+ ABC

AA

At BC
ABC+ ABCt ABC + BCt AR

Ac C Bt B) +

ABC

A+ ÀBC

Booean function Represen tatien


Bovlen functin - Botlean fons
d Juth Jable 3 Non- Standad
a. kogie Gate
CLoglcat txesion) 3. Canonical
3. Staternent.

Standosd foorn
J. Stand ard Pos .’ : (A+8.-lBtc). CA+c). (AtDJ

CanoniCal fo:
ABC + ABct BC
(anenlo al S0p

yla,8,c) (A+Btc). (A+ B+8), (HtB +)


(anonc al Pos
quen Jruth table fend the
mintom and Maxteem Vaues

?:- mintuis

minttenm

when
o Ps expresed as Corhplenent

1 ith no complement
AB,ABC ABT
Mo M5

then maxtn
when
oP's expressed wath no corn plement
d oth Complement
C'AtB)
:. (AB+c), (A+Bt), Ma
(anenital- 0P

Y: mo,m: m4ms me)


En (0.l, .5,6)

(anon cal - Pos

(A4 B+c). (a+Bt). (Ãt 8+*)


1: Ya
n. Ms. Ma

t[2,3,J

ton vesion Sta ndnd fom to Canone al foim


Y ABt AC+ BC

ABC C+)+ Ac B+B)+ Bc(AtÃ)

ABC + ABC t ABC + ABCt ABC+ Âße

ABC
- ABC + ABC t AGC +
ma t
Y= AtB) (Bt c) (A+c)
N(AB, c) = (A tB). CB+c). (At)
(At8 +0),(BtCt0) (AtC+o)
- (A+s+ Ce]). (Btct (AA)). (Atc+ (BB))
= (A+B tc) (AtBt) (Bte+A) [B+0+Ð)( A+Btc

:AtB+) (AtB+)CA+Btc)(AtBte)

y= mo Mi, M.. Ma
ye (o,ia,+)

Cony ot SOP fnto POs -


y= En (o, 1,3,5,4):

Conyet &tandasd fom to Canbnica fom g-


y A+ Be i
4iA,B, c) [A:l)+ (Bc L1) )
-(A. (B+B) (Ctt) ) +(Bc (AtÂJ)
- PB+AB.(etz)] + [ Bc (a+A)]
t

ABC + ABCt ABC t ABC + AB C

Y= m llstS, 6,)
Canonical Pos -

lAB,e) = [ , a, 3)

Cunonical Pos:A
AB+ BC +cA

YlA8.):(B6.1)+ (B¢1)+ (CA:1


(B+ê).
: (ÄB(c+t))+ (BT(A+A)) +(Cã.
ÄBC+ ABË +ABC+ ABC + ABC + ÅBC
ABC t ABC+ ABCt
m3 t mt mG m1

TM0, tS,9)
(A+Bt).(AtB+c), (A+3+). (AtB+@)
=
Boule an funetien 8fnpuffoatten
I[Canonteal foimi foto Sandakd fom

DB+ As
BlAtÀ) B0) - B
Karnaugh Map l k-map).
H- Nasiabte kmap (A ,8,C; D)

AB CD C
11
ABCD
AB

ABDÔBD ÄBCO
S
ABD ABCD ABCD

ABCO

AB

Rules -

d. Au the t' sheuld be gsuped


a mininmum No. o geup Bhôutd be qreuped.
3. Each., qaeup,. 8hawcl, haue hnannum no.
ovenlappng s poíited.
be
4 Retended qeup | Repeoted goup. &hald
elinnate d.
1 ind the si
Simpisicd boelr an cqiatenn by
wsing K-map
A BC D

y minteim

minleim

31

2
a. find the simplyied boofean equatên 9

also impttment the funetieny using


| basic gate
Q NAND gate .
Co CD Co
A6 10

31

ABD
AB

11
AB AC
2

AB
AB

Reduced Sop - ÄBD +BD+eB+ Ac.

A J" Basic qates


ABD

AGD +BcDt AG tAc

AB

AC
C
a. NAND gate NHND -NAND mplementa,
A
ABD

A AB

3 F ABCO) mo, ,3,6,,8, 10,12, 13)

AB CD C.0

13 Ac

ABC

F: Äc + BÓ t A8e
1. Basc gates ?-.

o
A
Ac

AB

B
Tod tae simpübi d korlear
Hind tthe xpresion fo
the gien fenetöns
9,B, t,) - m0,),5, 9,[Link], I3, 6) +
P(
pe ( 2,3, 10, 1)

3 2
AB

AB

X
A

A B+(ha)+
(A.G. )

digtal coceuit with Soun înput


d Design aa
the output is Kigh ohen
Ond d tput
Én input binay epe ention contans
euen nes

A Be D P= Eml 3,S, 6.,9, 10,15,12)


o-o--Oo--o-0 -o

8, , 13, |H)
design Ps not possible

Design dijtal locitnohese npat


a

BCo numbe the output s gh


(Binuy Coded ceina)
When BeD. inumbs Ce 9 3, 6, , 9

AB e D
AS
ABC
AB
13) 1a, 8,
(0, 2,5,7, lo, 2m
,10,2,4|3,
5) FAB,c-D)
D,
ABCD +
t')
BD Ct (AtÐ),+,
AB Aco(B+B)
BcD + ABTD
SoP?minëmen find map K-Wsung
BeD+ABeD+ BcD ACD+ +CD AR CoD)eA,B,
: Q.
AD
AD. Ct
X
X 2
\cD
BD+ ABD + ABe

funetisn
4 Csing K-rap sinpity the qiven
ing cny vAND
p minimum SoP) and alize
gate nhee , 8,11, 15,
AB

X
2 13

X
BD

Ac+ BD

F
K-map:
AD

L
ABD

10 ACD

AB t B°D + ABDtCD.

AB

ABC

AC+ AB+ BD
4 Im(i,s,6,31,i3) + Dl13, 1S)
AR\CD D

X
13

ACDt ABC+ AcO ABe

8 A student uoarti to des Egn a igtal logte


a

soitehing fenettns oheh s descbe by the


fououng botean -funtiÝn p- TMlI.s.6,7,12
+di13, IS) but he has poo)dec! fth oniy
mihfnurn [Link] NAND 9ates

F: Em(O, a,3, H,8, 9, 10, | ,J4)


AB

X
A-yaniable k~nmap thursday

CO
AB
J0
At3+c+ AtB1c At8+i A+8+e+d
AB
01 A+Bte+A+B4ctB+•A++&
+D

|2 |3
t D
15

10
D

AB

AG
(2 3 4
AB

Y" (7). (B5)


y(A+¢) .(6tD)
Basic gatu?
A
A+c

(A+c), (Bto)
D
to
NOR qates
A

A+C
A+e+ D

AB
CD ctD

-A+
V= nM(0,S-9 8,4, o,H}4. s)
A8\CD

B++D

Ats+B
A
+B

0,0 A+

H: y: M[02,3, 6,,8 , 10,12,13)


CD D ctD c5 C+D
AB

B+D

11
AB

TS

X X

a : atn I ,3, 4,6,9,), 12, )4]+dD,8 10,)3,15]

AB CtD C+D C+D


10

Lo
AtB 2

X
11
X
o
X

y(B+D) . (B+5)
g. N Em (o, S6,9, 10, I1,4,is) hd Pos

Ne aM 4,9, 10, )Q, 13)

33-Vaiable k- map

BC Bc Be Bc
A

Ao

AèEAic
6

AB

AG

to AB nGc
A Bc [Link]
01

A1

AC.

00

GD, 3

AB + BE
3 y= mlDal, Q,3, 6,9)
Be
10

A3

13
14

A 1

AB
A
13

- A

DI Be
A BE

Em l ol,2,3)+ de l6,4)

AO

8- N= En Cpl, 6,9)+de l2,3)


BC
Do 10

A
A
Bte

AO

A o llo 0- A
Y= A.

(2,3)
Q y th(0ol, 67) + de

Aoo

Ve A.B

Buien tmporay sion oge Ccañhe memosy)


Dign XOR Sng NAND 9ate,
A
A|B Y=A8

o--o

Bubter

AE
A
A
Same vaue

A
\B,
A

rt
(aa)a()4

Do
y= AB + AB +Oto

-| + TAG+G@J
A[B+ AJ t 8[A+ BJ
Do
D

At6tB

y· (Ã+ (A). (E A.2))


AB
At AB + ßt

Duian XNDR wsing NAND gate;


A A:

B
Do
vOR sing 0R

A4(43)
A+8

s+(A42)
A
At{A48)
A A+B

( AG+A3)
B+ (&+h)

A+[AtB), (B+ (HfB)


AOB

te
g att
ExOR=
(Ex
NDR)
NOR g
nOR
wsmg
wing

ENOR
EXOR

EXNOR
OB
A

AOB

NAND
gate
sing
NAND
gate

ExNoR
(ExOR)
=
usirg

-
OR EXNOR
Ex B
surg K- map tind the mnimum 80P for
fouocng fune i
f= Em (0s,4,s,6)
A

11
A

3: Zm ( 12,3,)
01 11 10 Ac

AO
LIDID-Äs
(r

01

D
Ac

5. S2,3,S, 6,9)

A 1

6. lD, ,46)

o1 13

A 1

1. F 2y t yãt yã
CDo0111 10

AB
- (9 0) + [yzu) + (ayz)
e (5(zt)) t l yala+a)) +(7y~)

m1t mo t mgt t mo

1 Psime mptlcant
a. Essentiat prime împicant
3 Reduandany prime Pmptant
4 Seletuu Pnme impltat.
the essentiat Pr and Seleetue Pr.

A8

essential
Beletu

AD+ BD +(AB
(4 S6,)

’ Em( O, a, 3, S 39 8,10,l, 4, Is)


AG

12 3
y It t 3+ 4 t5

eSSetial
Pr
Selectu PI

y: BD + ABD AC +
3,4, 5,!
Q3, 0,u

ma,3, 4,S, 6,9,9,l, 1,3)


AS

Y- J+Jt3 ’ sentiat PI
AC+ BC + ABD

’ Em (13, 6,3,8,9, 12,13, l4 15)


CD
AB

essential Pr
AB 11
AS ED,
0

BD+ BOt
eattial seleteie
\S,13,9)
A8\CDB
10
4)
2 2

A8 o1

AB 11

Seleetu

You might also like