HW #1

 

Home
Publications
CV

Problems 1-6 are from Chapter 2 of textbook (pages 81-83).

Due Tuesday, Feb 6 at 2:00 PM.  Please submit on paper or by email.

  1. 2-1(b) [5 points]

  2. 2-6(b) [20 points]

  3. 2-11(a, d, e)  [25 points]

  4. 2-13(a) [5 points] Note that it says to draw the exact equation

  5. Code function E of problem 2-11(d) in structural Verilog [8 points]

  6. Code the function of problem 2-13(a) in dataflow Verilog [7 points]

  7. Prove or disprove the following statement [30 points]:

    "Given an arbitrary Boolean sum-of-products expression f, it is always possible to implement it using only XOR and XNOR gates."

    HINT:
    bulletIt is sufficient to consider only the NAND function for f to prove or disprove the above statement, since we know from class that any sum-of-products expression can be built using only NAND gates.
    bulletThere are several possible ways to answer this question.  By far the easiest is to think in terms of parity.