613 Starting fnom stte a and the

inpt
seaiuence 0141O0L0011, determme he
outpt oquenee fon
(a) the state talbe or previsus problem
(b) he neducad state table from the
prreios problem. Shao that hedame
Mequenee is obtâned o both.
oudput
(An swer)
a) iben, the state Hable from preios
prrodem is,
Pnesent Next State
Shte
b
a 4
b
 nod, the shate table's otput seauenee
the gen impat soyenee,
Rresent State Input Ney Stateodot

1. b
b
1

1
1

1 1
1

S0, the oet sequenee O1000 11404co

Nas, the
educad shaa table fum thp
gien ctate table is ghen
arer belo
 Presert Next Sate
State

Now, he ndput peueree is determioed bel

Yrom
Aom tha teduce d shte taldle,
Present Ste inpt Neyt State

1
1 a
1

4
d
1
d 1

d
 beguenee. s oIQ001110O10
So he otput
So, we Can see hat th Sane outpt
obtained tnom both stete
seqpe nee is
Aades
|stowed
5.15

List a state tabe tor he Jk

J larflop usng as the pesent stote
and next state and. Jand Ka ts.
sequential cireuit spetfd by
Desitn the ht it is
the state table and oho
egivalot to Jig 512 (a)sGanespenan
S.)2

date diagram fon the shte tabb]

ble

Anseri The state table. ushg

Present
sate, Inpats Net state,

No change
1 C Resdt

Now
he chavateristie cqyuatn
01

Now the
euit is,
 So, wwe Can see that this sequania eiourt
is Gquivalent to Figurce, 5.2 (a)

b.
to inplement a se raal adder
(A+ is sho in seion G.9 44 i5 mece star
modih. e cneit to convegtt them
to
to erial t subteaeons(A -).
-6,5
a) Usimg
shase the changes needod to peitfornx
At2s esmplement ot b.
6.6.Aha
() Usig the CireuiH
 the changes needod
by modijng Tasle 6.2
an addere to a nbtactor cirit.

An swer
(omplementin g he aerialotpit
Jn fg 65,
set the mitial
initiad canry
f rgi ster G and
value equal to .

SI

:Shdt kefs ter, A y Adder

(

and
SI

Shitt Regis ter, b

Here he ale is gâen be,

Presert Thpts Ne ate

Stade 9(-t) D
3

1 1

y
01
 X
00
0.
X
*
fne
Map 00
Nao, K
Here the modtied deigo is gren belos,
desgo

D
Serâad îpt

K
6.13 Show that a Bep rapple asuster an be
bt binay ripple anunten
Cgmstruted using a 4
and a NAND ade tht
asynchemas daare
Ntents he 000urtnanee 10 10.
deteots

Answeri
lbith 4 bit biharcy ripple aun ter
ter we

meanig
bep Conter CUe

to 001

A.

Raple
Counten
deare A4

Fjune DeD rapl Counter fom a 4 bjt rapde Counten

6.23

Decign a tiai noait tht prav+das an

I2 ela
siqnal tht stgs
yeles Astant sianal sends heiotat to Ahe
1state after l2 docle ydlos the
and
t the o stte
signl runs to
Aawen'
A 4 bt Gunter has a marimum Cunt f
lb bits whit ton the Caunt 0D00 o 4L
Naw ing cieuit is designed beoas

Ao A Ag As

4 bit koad
Raunter

(tatt signal)
when the oudpt stete is hanged fram mtal o
state, t is eed bacl to the Court npt
4 he 4 bit eaun terc and i4t starts
starets caunta
The NAND ate outpt is d comec ted to the
elacle af the t fsop ond cla mpt af
the contere. st with erh eloek pulse, the
Cauner ill snenement .
when eer we Aawe |100 Means
eloek ac oles, the ntput uiI| be feed back
Plork ipt . means it wil put he
hto
oloc îhto lns puse ond ît ill
dange

plenent the daput o4 the uplp fum

cm
count
to
ond it wid stop the crunten trorm