MINOR 1 (EEL324) Digital Hardware Design

Time: 1 Ho r
2!1!

Ma"# Mar$s: 2%

&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&& N'ME: Entr( No# &&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&

N# )#: Do the calculations on continuation sheet provided. This is o*en +oo$ , notes e"amination, but trans-er of notes to each other is strictly *ro.i+ited. / 1: & 0or a resetting ma1orit( - n2tion we .a3e t.e state transition ta+le as +elow:

4# 5#
5! 51 52 53 !! 53 5! 53 52

Ne"t 5tate6 78 !1 1!
52 51 5! 52 51 52 51 51

11 5! 53 51 5!

O t* t 9
1 ! 1 !

:sing a state assignment o- 5! ; !!6 51 ; !16 52 ; 11 and 53 ; 1! 2om*lete t.e design o- t.e ma2.ine as -ar as )oolean e< ations -or t.e ne"t state logi2# =rite t.e ne"t state e< ations and o t* t e< ation +elow: (4)

D!> ;

D1> ;

T.e ma2.ine a+o3e .as -o r states (I- one&.ot en2oding is sed)6 -o r -li*&-lo*s are needed6 and t.e / lines o- t.ese -li*&-lo*s will +e denoted +( /! # # #/3# T.e o t* t 9 (0or one&.ot en2oding) is t.en gi3en sim*l( +(:

9;
/ 2: & 0or t.e )oolean - n2tion gi3en +elow red 2e t.e order o- ?# ma* +( de2laring t.e 3aria+le C as entered 3aria+le and *la2e t.em in t.e s*a2e *ro3ided# (2) 0 (')@) ; Am (16 26 46 B)

'nswer: T.e ?# ma* -or t.e a+o3e is as +elow:

';! ';1 );! );1

=rite t.e minimiCed , sim*li-ied e"*ression -or t.is ma*# 0 (')@) ;

/ 3: & ' Moore ma2.ine .as two in* ts x and y6 and an o t* t z# T.e ma2.ine starts in an idle state in w.i2. C = !# =.en in t.e idle state6 it *ro2esses its in* ts as -ollows: xy !! !1 1! 11 a2tion remain idle assert z -or 1 2lo2$ 2(2le6 and t.en ret rn idle assert z -or 2 2lo2$ 2(2les6 and t.en ret rn idle assert z -or 3 2lo2$ 2(2les6 and t.en ret rn idle

=.en t.e ma2.ine is not in t.e idle state6 it disregards t.e 3al e o- t.e in* ts# Draw t.e state transition diagram -or t.is ma2.ine sing t.e least n m+er o- states# (4)

'nswer:

5tate diagram

/ 4: & MinimiCe t.e -inite state ma2.ine as gi3en +elow# Draw t.e 2om*ati+ilit( ta+le6 sa( w.at states 2an +e merged6 and draw t.e minimiCed ma2.ine# (4)

'nswer:& T.e e< i3alent states are as +elow:

Draw t.e red 2ed state diagram on rig.t side o- im*li2ation 2.art gi3en +elow a-ter -illing t.e 2.art 2orre2tl(#

/%: & @on3ert t.e ma2.ine o- 0ig re as gi3en +elow into a Moore ma2.ine (+( s*litting states): (2)

'nswer:

/ D: & Use the nonrestoring division algorithm for the unsigned integers with n ; 3.

The numbers are Di3idend EDF ; 1!!1! Di3isor EGF ; @om* te and *la2e t.e 3al es in t.e ta+le +elow:
5te* '2tion

(4)

' (a22

m lator register)

/ (<

otient register)

'nswer: / otient ; Remainder ;

! "# $ Compute a systolic array to multiply 3 7 3 matrices. %ssume proper function of processing cell and initial values appearing at the input. &atrices are# 7; % 1 3 H B 4 ! I H 11 8; 1! H 13 D B

Compute 9; 7 J 8, where resultant matri' components are computed by,

*i( = + i) .,)(
) =1

-uppose that the structure used to multiply specific 3 J 3 matrices is same as discussed in the class ./ef# K# 4# Ha(s0. 1ist the values appearing at the output labeled D (; 7i J 8i > DF) of each of the three cells in the t.ird 2ol mn, for t ; 3 to t ; H .2rite them in tabular form0. %ssume any undefined values that occur initially are all 3ero. (%)

@ell L
@16 3 @26 3 @36 3

t3

t4

t%

tD

tB

tI

tH