DSD Assignment Solutions
DSD Assignment Solutions
opesodon. hca
A 1-64 (A>B)
y(A<B)
Comparrato |(4=B)
Trth Table
-
o -o
= AB
y=
AB
Z AC B
( Block Dtaggom
D
A
(A>B)
(2) Dkaw 4f explaln te block
diag a
Subtrctors B,B, B,B, and Ay Ag A, Ay
Soln, Coidea tws 4-bit binay numbeu
doneby
o be ad de uth a cns input C. This can be ean
s'grt
cas cadiug fou tull addese'eiycuitt The least cund casauy
A, B aunal , ase added te te podute sum output S4
etput g Canay output C, is Hhen odcled to the next siqnieau b ts
Sum output S, and casay output Cg eHen
3added to Aa and B, and so en Taus fina producing te fou
t surm output S,s, S,S,and final casou output Cout
pol
Bl ock Diaqrami
(B- 4 -bit
Cott |Parallel Adden
Logic Drapam;
Bu
B3 Bz A
FA FA PA FA
Similarly
i4 use comides tuso nunmbeny A(Minuend) and B( Subtahend)
can be subtracted by 4-bit pan llel. Bubtactor
Let A= A, A, A, Ao sand B = B,B, B, Bo
Bo,
A-B = A +2'% conmplement ot B
= A+(1s omplement t t 1)
Thus, 4- bit biuay mmbew Aaud B. Chun cbtct as
C
A, A, A,A, A6 Miuend
B Bo1': canp o B
1’ 1
S3 Sz SSo
Logie Diogrom: A
FA
Cin-1
So (A)
3 Desig f implenneut the,convenuien circats fo BcD t Exáeu3code.
ScthyXS-3 Code BCD + 3 (o01)T
(BCD) (XS-2)
B, B Bo
1 1
foje w
BPe o
2
1
1
4 1 1
5
lo
X = B, (B, +B)1
Logie diaqrom
Bz B Be
UKealize F(o,x y, z) Sn(I,4,6,9, 8, 4,lo, 11,1s) sng X1 MUX
Bdoy Tmplentg yz y2
the
yz
10
wx yz + wx yz +
Ueiug $X1Mux
8X1
1
MUX
wy
w y (Ae)
Implement the expreion Y( A,B,{) m(o,2,4,S,6) alng N-NOR logic
Seln, Using-Kmap Loqie Diagam
y- C.( +B)
c. (A: B) c oP
Y=
T+(A.B) Ct A"B
(An)
XX
X
X x X
0
D, dioqram State Solny
itotieu state Nexd stoPresent
te
frer Dig o00,-
-(repeat) 1lo, l00, olo, oll, ool,
incount ich countes
e the
JK FF .
ymchono MOD-6
A A 1
|Ja =1 KA =1)
Map fo Jp Map for Ke
A D
K,- A
Map for Te Map for Ken
Be 6 Be
xD X
Jo = AB
MOD- 6 Countes ba
A B
1tKa B
Clk
(A)
ro1o =10
1 1 tey wheu it
become lo the
nand gate is
Used sudh
tot
Jet to