Individual Homework 4 -- EECS 270, Spring '23

Due Wednesday. May 31st @9pm, 5% off if turned in by 11pm


This assignment is worth about 1% of your grade in the class and is graded out of 30 points. Remember you may drop one individual homework assignment.

  1. 6.3 [2]
  2. Consider the function Σ(a,b,c,d)=0, 3, 4, 6, 7, 9, 12, 14.
    1. List all the essential ones (as minterms) [1]
    2. List all the prime implicants (as product terms)[1]
    3. Use a K-map to find the minimum sum-of-products[2]
  3. 6.40 [3] -- Note the second colum of gates (figure 6.99) should have two inputs, not three!
  4. Draw a state diagram for a clocked, synchronous state machine with two inputs, INIT and X, and one Moore-type output "Z". As long as INIT is asserted, Z is to be continuously 0. Once INIT is generated, Z should remain 0 until X has been 0 for two successive ticks and 1 for two successive ticks, regardless of the order of occurance (so 001011 or 10110100 would both meet that criteria only on the last input). Your state diagram should be neatly drawn and planar (no crossed lines). This can be done in 10 states (or less?). [6]
  5. 6.18 [5]
  6. 5.1 [4]
  7. Consider problem 5.16.
    1. For each component (i, +1, etc.) explain what it is/does (register, incrementer, etc.) and what each input is. Be sure to notice that some of the components have a clock. [3]
    2. Briefly explain how the datapath could be used to solve the problem. [3]