355Hm9-06 - (36 pts.) b) Use the methods you have learned...

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

View Full Document Right Arrow Icon
ECE 3550 DIGITAL DESIGN FALL 2006 Homework Assignment #9 Total: 90 pts. Due 11:30am, Wednesday, December 6, 2006 An asynchronous sequential logic circuit is given on Page 2 by its primitive flow map (i.e., initial state table) where X1 and X2 are inputs and Z is the circuit output. a) Reduce the number of states using the method you have learned in class (Implication Table, compatible states, Cover Table). In addition, check to see whether the closure criteria is met using a Closure Table. Try to make the classes of compatible states disjoint. Give the reduced state table.
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: (36 pts.) b) Use the methods you have learned in class to a make critical-race free state assignment. Show your assigned state table. (16 pts.) c) Check for essential hazards. Give the path for each (if any). Eliminate them (if any) and explain how it can be done. (20 pts.) d) Assume the circuit will be implemented as combinational logic with feedback. Minimize the next state equations and the output function using K-maps. Make sure that potential static hazards are eliminated. Give your Boolean functions in SOP (or in POS) form. (18 pts.)...
View Full Document

Ask a homework question - tutors are online