20065eeM16_2_20062eeM16_1_EEM16_hw4

20065eeM16_2_20062eeM16_1_EEM16_hw4 - encoded transition...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
EEM16- HW#4 Ch. 7 : 3, 5, 9, 15, 19 Note: for 7.19, just do a minimum number of states approach. You don’t need to use the minimization procedure – use your knowledge to design the state machine with the least number of states possible. Ch. 8 : 5, 6, 17, 27 Note: for 8.17, make sure you produce next-state equations (derived from FF inputs),
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: encoded transition & output table, coded-to-symbolic state mapping, symbolic transition & output table, state diagram and a high-level description. Then, use the state diagram to come up with a timing diagram (time behavior) for an arbitrary input sequence of your choice (~10-15 inputs should be sufficient)....
View Full Document

This note was uploaded on 10/31/2009 for the course EE EE M16 taught by Professor Eshaghian,m.m. during the Fall '09 term at UCLA.

Ask a homework question - tutors are online