ASSI GN MENT-02

1 write short note on look ahead cavny addens.

A Carry look-ahead addgn reducos the pro pogaior
dela by intro duang more complex hand warne
In this doaign , the ripplo cavy dein iS
suitably tranaformed such that the cauy ogie
Oven fixed groups bits of the adden is
reduced to twO -

1eve1 logic

Cim

Cout

A B Cout Condihiom
Cin
NO Carry
O
aenerate
O

NO Carry
O
Propogate
Carr
Gnenercte
Considen the previou full ad den cix cuit with
cOrrespondung tru th tablo we dehino tuwo
Vaiab l a cany qennote and cany
propoqate Pi, then-
P: Ai O8i
Gi=Ai Bi
The sum
output and cwuy output can be
expresed in teNMR oh camy genenate (Gi) ahnd
cay propoqate CP:)as
SiPrCi
Ci+ i t Pi-Ci
when i producaA the cmy when both Ai3
Bi 1, reqand las sh the inp ut cauy- Pi is
ane

assodated with the

Ci to Ci
propogahion sh amy trom
So
C Go t Po Cin
C2 , t Pi Ci =
at P tPPo Cin
C3 Cat Pa C Gt Prnt P2 PGn t
PP, Po Cin
Cu Gat PC3= ng1 Pant P,P,Gn, +PaPPCntP,Pifo
Cim
from the above Boolean
equaho nda we can
obseve that Cy dpes not have to waut for C3
and C2 to propogate, but actually Cy is
Propoqated at tho samo time a Ca and Cz
Simce tha boo leauh
expreuion for ea ch cauy
output is the sum oh produ so thee can be

implemerted wi th ono level

o AND qale foll-
-o wed by an OR gafe
2 Drau the flowch i t tor Booth's Algonhm fo
mulipucahon and shous mul hipu ca1hi on proce4
uimg
simg Boo th's Alqom thm fov -?)x (+2).

Multiplicahiom
CBo o th's Alo)

MulhpUen in aR
Mulipu caund in BR
AC o

SC n

- 109 n+

00
ACACtBR+I
01
ACAC+ BR

asha (AC?QP)
SCSC 1

0sC = 0

END

7 ) x C12)

QR( =
Ol+ =
I000 +I=1001
BR(+2)= 0010

BR+I(-2)=0o10+ 1101t = I||0

 O
A
O
O
O
olo O O o o oO o
O
-3- Draw the
flous ch ant for reestomng and
division openahon usith nom-restonne
suitabla eramplo.
Restorinq Division Method
Stant
NEno f, bits im divi dend counte
A O
M duvisos
dividend
09ica le,t sh ft (A Q)
A-A-M

0 MSEL
Qo 10
Retore A

N N-1

Remaum don A
Quohente
End
E7/3
, M3): O -M(-3) = 10
A Openuhon
Tnihau2e
ogical t shi f
AA M

OO
MS eR =1,
O, Rastove fA
 loqicad a r sh t
A A-M

000
MSB = O,

logical lal,t shuft 0

A A -M
OO

MSB ot A 1 ,
oIO
Qo0, Restove A
oLoient (Q) 0I0 (2)
Remaumdwr (A ) 0 0 | C1)

Nom-Reatonng Division Method-

Stn t
N n o of bits in dividend ounfe
A 0, Mdivis ox , Q A vo h'ent
MS B o A

l09ical t shíft oqic al t shif

A A
A A-M ATM

&o 0
N N-l
NO N 0 ?/

MSBo A AtM
0
Remaund A
uo hent Q
End)
 O

o
loo

O
D O

o
94 Ex plain TEEE standand fov Floahing point
representahion u9ith example.
ag
The two IE EE stondand fov floahng poirti

32 bit floaling poind representahion-

1bit 8 bits 23 bits
Bi aed
MamtisSa Sing ezpreion
1qn e ponent
it bit (NOT Tm a u u floohnq poi nt
Cet 12t) st undand
32 brts
for
Mam tiSSa

64 bit floahng point representahon -

1bit 1 bits S2 bitss
Sign Biaed Manhssa Douhy ez p TeLs iOn
eponent
bitePoneLne7m alu
bi floohnq point
Cet1023) Standgnd
69 hits
for
Munhssa