Solutions - Final Exam (December 8 7:00 pm) Presentation and clarity are very important! Show your procedure!

Transcription

1 ILUT OLUT LCTRICAL AN COMPUTR NGINRING PARTMNT, OAKLAN UNIVRSITY C-278: igital Logic eign Fall 26 Solution - Final am (ecember 8 7: m) Preentation and clarit are ver imortant! Sho our rocedure! PROBLM (2 PTS) Given the folloing circuit, comlete the timing diagram. The LUT 6-to-6 imlement the folloing function: OLUT = rt(ilut), here ILUT i a 6-bit unigned number. For eamle ILUT = 35 ( 2 ) OLUT = rt(35) = 6 ( 2 ) I O 6 ATA LUT 6-to-6 O ceil(rt(6)) = ceil(rt(59)) = 8 ceil(rt(8)) = 3 ceil(rt(32)) = 6 O ATA I O PROBLM 2 (2 PTS) Comlete the timing diagram of the folloing circuit. G = G 3 G G 2 G =, = G G G 2 G 3 Intructor: aniel Llamocca

2 LCTRICAL AN COMPUTR NGINRING PARTMNT, OAKLAN UNIVRSITY C-278: igital Logic eign Fall 26 PROBLM 3 (22 PTS) Seuence detector: The machine ha to generate = hen it detect the euence. Once the euence i detected, the circuit look for a ne euence. The ignal i an inut enable: It validate the inut, i.e., if =, i valid, otherie i not valid. FINIT STAT MACHIN ra the State iagram (an rereentation), State Table, and the citation Table of thi circuit ith inut and and outut. I thi a Meal or a Moore machine? Wh? (5 t) Provide the ecitation euation (imlif our circuit uing K-ma or the uine-mccluke algorithm) ( t) Sketch the circuit. (3 t) State iagram, State Table, and citation Table: / =,/,,/,,/ / S / State Aignment: S: = : = : = S: = S / / / /,/ PRSNT STAT S S S S S S S S NXT STAT S S S S S S S S PRSNT STAT (t) NXTSTAT (t+) Thi i a Meal Machine. The outut deend on the inut a ell a on the reent tate. citation euation, minimiation, and circuit imlementation: (t + ) = + + (t + ) = + + = (t+) (t+) 2 Intructor: aniel Llamocca

3 LCTRICAL AN COMPUTR NGINRING PARTMNT, OAKLAN UNIVRSITY C-278: igital Logic eign Fall 26 PROBLM (2 PTS) Comlete the timing diagram of the circuit hon belo: (8 t) a b Full Adder FA cout cin cout a b cout Provide the State iagram (an rereentation), the citation Table, and the citation euation of the folloing Finite State Machine: (2 t) (t + ) = ( + ) (t + ) = = State Aignment: S: = : = : = S: = PRSNT STAT (t) NXTSTAT (t+) PRSNT STAT S S S S NXT STAT S S S S S = / S / / S / / / / / / 3 Intructor: aniel Llamocca

4 LCTRICAL AN COMPUTR NGINRING PARTMNT, OAKLAN UNIVRSITY C-278: igital Logic eign Fall 26 PROBLM 5 (6 PTS) ra the State iagram (in ASM form) of the FSM hoe VHL decrition in hon belo. I it a Meal or a Moore FSM? Comlete the Timing iagram. librar ieee; ue ieee.td_logic_6.all; entit circ i ort (, : in td_logic; r,, : in td_logic;,, : out td_logic); end circ; S = architecture behavioral of circ i te tate i (S,, ); ignal : tate; Tranition: roce (,, r,, ) if = '' then <= S; elif ('event and = '') then cae i hen S => if r = then <= ; ele if = then <= ; ele <= S; hen => if = '' then <= S; ele <= ; r end cae; end roce; hen => if = '' then <= ; ele <= ; Outut: roce (, r,, ) <= ; <= ; <= ; cae i hen S => if r = then if = then <= ; <= ; hen => if = then <= ; if = then <= ; hen => if = then <= ; end cae; end roce; end behavioral; Thi i a Meal Machine. The outut,, deend on the inut a ell a on the reent tate. r (tate) S S S S S S S S S Intructor: aniel Llamocca

5 LCTRICAL AN COMPUTR NGINRING PARTMNT, OAKLAN UNIVRSITY C-278: igital Logic eign Fall 26 PROBLM 6 (8 PTS) Comlete the timing diagram of the folloing digital circuit that include an FSM (in ASM form) and a dataath circuit. data S = clr + clr FINIT STAT MACHIN clr clr: nchronou clear If =clr=, then = done clr done data clr tate S S S S done 5 Intructor: aniel Llamocca