0% found this document useful (0 votes)
12 views21 pages

D.E Module-2

The document discusses combinational circuits, focusing on digital logic design, including Boolean functions, K-Maps, and various types of adders and multiplexers. It covers the representation of logic functions, simplification techniques, and the implementation of basic digital components like half and full adders. Additionally, it explains the use of truth tables and Karnaugh maps for simplifying logical expressions and designing digital circuits.

Uploaded by

haribhopi34
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)
12 views21 pages

D.E Module-2

The document discusses combinational circuits, focusing on digital logic design, including Boolean functions, K-Maps, and various types of adders and multiplexers. It covers the representation of logic functions, simplification techniques, and the implementation of basic digital components like half and full adders. Additionally, it explains the use of truth tables and Karnaugh maps for simplifying logical expressions and designing digital circuits.

Uploaded by

haribhopi34
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/ 21

Modu le-2 aleate

Data

Combinahnd bagpe Digitd Ciscuib: Paga

A digstad ciuiE qre &iided oto tw


Combinahenal circai atrgorie,
2
Sequenhal eiscwt.

combinahml cicut!
The olp at instaot depend e presen state
at that ins tand ot bae.

Boolean Funchen and ther representaha

la'c Fynchen a expesed in teronm of logzal vanab


Any arbitay logie funcken
fynchen Can be ep esed IA
+wFosm,
Sunof product fen Csop)oanooical sop
SUm feson CPos)

Sop-Fn!
Pos fsn

To soP Fam
CAB,c)

dtunchn erthe
mtnted fen called
4 n afiabh funcheo Can hae

The Min tem denokeo by me,


m6
olssae.
the Daia

The coays
Canonlcal

Thuy
SoP

fCAB, c
txm by
shown To
K- Map
Hhis put
karnaygh - Map)
Fruth tible

Th)
- nll 2,3, nap.
Dabeilin Hhe Columns
|Tis is exhrenely Useful io Hhe
Po s funchen S or 6
Standard variablen
Canonical prrdc k- mgp Coosist a nu mber
ach S4uare Tepresenb

K-qp - struce

A
A oO
Syr term which Coota each of lo n
Vaiable Cempemente wncompieonented 2- Vaabk 3- Variabe
forn is Cell es manera
There be AG
Mod tein)
M3 suthx lenote hejsdeeemal
code.
AB 2

t (A6, c) - AB

m= AB, m2=AB m
2- Vanable
Here epresent No-Câ+8),M=(A+B) HaAt
M3 -(At8)
3- Variab k
A BC

Max term
Ny-AtBtC
Data

Sof erpreSh ada3 Vandbe


A B
Nap He eapresSim f=AB Bc
2-Yariable B
2
A
Em ,2)

AB+ AB + AB
tlap o exprssiof
B
LI
A e 4
2
4
2 4

mo term wbeh adjaceat to each |2

Can e cenbiacd to ferm o bigg


called 2-syuae
plsthag k. mp (Mad keioy) quade
B B
A 4 MoA+B
A 0
2 3 M2=
M3- AtB

Plot khe
He
eprtssie
f= M(0,2, )
O 2
Aedo ere tle Dala

-kr ma technigy B

BC Bo
B

Reduce the loca) eprtsticn


obtruo he Usig - map.and
ABc 2 m
AB
C1,S,7,9, 3, 15)
1
AB OD
AB ol
Y= AD BD+
2
AB )2/

AB J

Redvce
K- map and
inple ment ung basc
gates B
Y-CA+s+7)
Bo

Reduce cnappig He expresnn


A f M 2, S , J0, l4, 2, l4) and inple
AJ lagic Jate.

Coargt Sop form


f zmlo,4,3,415, 6,7, 13,!5)’ gff
Data
2
Ae

191

NAND
Tate obte gat. Cyse deonaypds the)
ioversio
A
(A8)AD)

ACBT)

A8C
B

Pedce mofling tle folodng ezpruhon and Reduce He


inplement He real minjm and imp lemen U5g
fCA6,c D) =Znll 3,S, 6, 7,8, 1l, 12/). A

AB
3 2

A6ot 4
Tate doyble invemis
12

AB tAB +0
AB AB
Mjaimize
tunchen UnyMepJ Dara

UoiJal
reqs Dooy coadi hon
D CD CBCD)
AB
BCD coyntey
6
loo1 094.
( certun
(2 13 Cvmbioah
AB megfos Adoe
wheathe
qre

Theoe Calles
Tople oeatah uny NAND gak
qnd) K- map prl)enked by x'
Tatng double RHs.
Peouce express f 2 o 2 S,6, 12, l3//4 )
A BCD t A GC f AB D ‘ AD 3 D +d 2 4 ) and nplrmenl Uso9 NAND

(ABco) CAg )CAE)Íp) (BD) |0


y=BT +AD +B D
Tatedouble
ol 4

AB (e )Ã D) (BD)

B
Dta
Paga.
Bina AoithHe ciscah
Adder and Subshactr
( Half and full)
Te diitd csnputes
Among He basic tn st Perdesmy variy y tagt,.
tho vaioy ar;lh me fe
cperabn, qrilhmahc °pernh'n
s binay peraka
Rules aayaddi ha
A Sum cay

Te conbinahenal Cincwt wtek pesm le


addiho 's cael eol holt adde

TAe cenbinahened ccwt whk perfam addih


celleed

Half adde
Sym

Addey

Tru th ta ble H'A


A B

1
eleenste
Data
Paga
B Tuth table
A

voin A T|e
B Cin Coyt
4

AB+ AB 1 AB
A B
3 4
Sym 4

Cay -
Relisab on gales (Hal[ adde
relisa bon
BC B A
o

A (1) A O
4

1oe diag Halr adde CaY ACio tAB +


Full ABC t ABG B Cio
ADPEe

A Ex-NO
a Conbinahn clA that add
too bit and
and bih camy and olp Sym bi Sym 1 Cinl B + Cio C AB)
Ci
Thé
fA B
full cddey bi A gnd
B and le camy f m S= AG B Cin
A
Cany 19 CCio) and Suth bi s on
Cout. ACA
A CmACin + A
AB

13Cia
SuB 3T PACTeP
Fau qddev
AfBxtCio HALE 3463RACToe A half Subshect is o
Combnatina! hal 3ubstoa ch
HA
ard pndse drd ierane,

Cio
A6
Cay B/cc diag
Half
Subhoctr

Tsuth tabl Bos


A B D
C

A8+ AB
C-Bmw
=AB

Eul! sbsacts

Sub shacts citcwI s Used


where in q
mulhbi!
bËt
Hhert
BB)n
AB
Y2-AB
BA
A Bio A
Bin
AB AB
>6 A
A<B Hen
4-6 BBn Z6+ +Bio Cp=A
=B A then B A Bìn
B-4 =d A 6-0 =o, A CA) Bio
B)+ A© (Bin
A
BBin BBin Bin 3Bip
B
Bin
A=B B ABBint
tBin ABBiot AB
comp 2-3it Difergncè
=
ble Touth
to
AcB
pplied
Cenpare AO
parata Cathne igitol
A
B8in Bin B B5
D
tob/c Touth
> Y3
A
hacl subs full
omw (6 Cn
toCompar
y Bit
iesAB full A
Mogridud. hree
Bin
ciacsate
CBow Sbsha B
Co
Y=
Ba Ao AL
4
ALAe
4
B, B,B Bi8 B,B A>B A=B Bi
>6 A BB <B A
table +ruth The
AJA long bit 2-
-(AiO
B,) A
Siaplity.
AlA compaty Bi 2r
BiB BoB,B,B, BiB
B,B
A
BBo oA 4
4.
gak Jogic A
A
rRalisa
ha
Pagn
Data.
alceote
( o t seleol) Dets

Qnd DemolHiplea e
A-Muliiplexe (1uy) is a logc accept.
seveve det n Topub and aous only
at time t gel houqh
The to desird duto T|e to the
T/Ps

D2

29 Dn
Bloct diaqeim
Line) Myn
S go

seleo T/p
nd m'select
NoYmaly whoeS
there
bit
are

combinahon deteyine hirh


S selected.

4:4
4
32 4

2 4
Toyth table
Engble

2:1
D

ECEngbh

s(sleo T/p
Boolean

Buolean E S Do +SD,)
FS D

41

ayranm Tp = 4

Seteet Tp
Fuu
D3

S Se
2-seeo Tp 2' 4.
Trutk teble Block

Select T/p

Do c. S Do dot Toyth Tb
S) S> D o/p=f
S; S D

Szl Ise
S
3See t
Dy
Deta

Do
DI

S2 Dz

dL Tnple men tle


obtn f CA felloir furch s
B,c)=
Uhhg 3 14 mux
Tayth table nlo,2,3,s)
Ans S
A

Connecleod io Paraled Lhjrd


S2 s
seleo PP Eaabk/ 2

ta ble
enablio
Selcel T/p
S2 So

So
S
D2
D3 inple nea t Ho logr funcha
Dy
2
enasle se lee - C8 )

4
de
Lonte a desga table
(0/ S)1nple men fotlwiny
23 eprtsna fCA Bc)-Z 0,25,6,))

Do D
D3

S
B
Tmple meot follswny tynchn Whng
S,C D) = Tn23, 4, 1l
Sajn 213, 14j13)
3-Seleel (B,CD)
8- data ( Do

D D
Ds
A 2 3
4) 6

B
Do

SO
alaesaate
Dede

Demolbpkau
and n' o/pconbioahmad
and m
cistuit
sefe ct T/Ps , wich
n -daln o/ps and selech
B/>ct d'g 4'n-demu
pats Dn
DEMAY
Fnebli

StS
Sm
Sim)lo o
12 DEv 2

DEmUX DEMd
ol ag
1 4 DÀ M
DËn o
2

DE ma

J 2 DEmVa
SI

Djn

k
Tople ment unchn
Zm/ d, 3, 7) Desigo f CoDE
Din Coorehe
USe DomUK,
Piaay to
-bi)
4.bit
is 4 bjt bingy nd
Code 44 bil
p
table
2 TIP (4-bit binay) olp (4-bit Gray)
3 B2 Bz B B G3
DEnv
E -N2

Sz S, Se 4

4
}2 o
13

n'te
Bs 62 B, 6 B)B. B Bo

A
BzB2 12
C2

B,B B, B G2 Guy to
to Binary Code conve Ae
Bz B2 B)B 8, 6
G2 Slepo Toyth table

G
Bingy Code
|2 |3
B3 'B,

8,B
Bg B B,8. BB B&. B, Bo
6
BzB
4
6|
B3B C
1B
Logie diafa 4

4 4
Ba B2 B) B
Go |2
|3
4
4

4 step simp if cohs

12
G3=B3

B B
G342 12
B2
B2
ou H (Ddesiqo 3- bít
Cooretoy
einary to

3 biL
6

2 |4
(2

Tou th tea ble


Bicag BCD co de cont

B3
Binat
B BL B
4392 2

|2.
2

4352
Bo
ol

|2

4
Step6

B 3t 92
BBo
KMps AsB46Bz+
24
B4 B2
Bo
2
fos - B
Map
B B3 B2 2,
63 61 2

B;62
12 (2

B3 B2 t B,B,

B38
B8

K -map f

4
3 2.

Conret He
(Btc)
-A6) Sop Y- Coove ConwS)on
Sor
(AonCalCan Cenocal
t6) Lle ABC 6Cct) A AB
Pos
erprsnn
tollooing eypresh
CA+c) expresa
ABABC-
Posso
C6eT) 6+AB)ttABCA
ABC AB
+
ATCBrB)
misaglet OR t BAA A
standtPos 5 ABC
each SondsdSof
Canonici'n o C+B) ABC
(AtBtC term
AB
‘AR
with
Âe

You might also like