This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: the minimal machine. Also, make the compatibility graph for this machine. 6) The machines M1, M2 and M3 are connected as shown below. Derive the state table for the composite machine M. 7) Figure 1 is a transition graph for a synchronous machine and figure 2 presents its state assignment. a) Derive the state table for the machine. b) Calculate the Y matrix. c) Calculate the J-K flip flop excitation Karnaugh Maps. d) By inspection (not by Quine-McClusky minimization algorithm), indicate a minimal prime implicant (PI) cover by circling the appropriate PI's on the Karnaugh Maps. e) Calculate the D flip-flop excitation maps. f) By inspection, indicate a minimal PI cover on these Karnaugh Maps. g) Derive logic designs for the machine from 'd' and 'f' .(AND , OR , NOT logic)...
View Full Document
This note was uploaded on 02/27/2010 for the course ECE Ramin taught by Professor Roosta during the Spring '10 term at CSU Northridge.
- Spring '10