E21 Digital Logic Design Weekly Homework

Week 1

Due Thursday, 10 September, 1998.
  1. Problem A.9 on the handout sheet: do parts (a)-(d) for Z1 and Z2.
  2. Problem A.9 on the handout sheet: do part (a), a Karnaugh map, and a circuit diagram for Z3 and Z7.
  3. Prove that a 2's complement number can be multiplied by 2 by shifting it one bit position to the left, with a carry of 0 into the least significant bit position and disregarding any carry out of the most significant bit position, assuming no overflow. State the rule for detecting overflow.
  4. As a function of n, how many "bad" boundaries are there in a mechanical encoding disc that uses an n-bit binary code?

Week 2

Due Thursday, 17 September, 1998
  1. Use the Quine-McCluskey tabular method to find all of the possible minimal cover expressions for a truth table with 1's in the following positions: 0000, 0001, 0101, 0111, 1111, 1110, 1010. Stop by Dr. Maxwell's office if you would like a copy of the example we did in class.
  2. The expression:

    c4 = g3 + p3g2 + p3p2g1 + p3p2p1g0 + p3p2p1p0c0

    is a very useful one in digital design (can you figure out what it is?).

    1. Draw a logic diagram for this expression directly from the expression above.
    2. Decompose this expression into 3-input AND and OR gates.
    3. Transform your diagram into a combination of NAND gates and inverters.
    4. If 3-input NAND gates take 1.8ns to pass the signal through, 2-input NAND gates take 1.4ns, and inverters take 1ns, what is the maximum delay through your circuit?
    5. Can you modify your design to reduce the delay? (Hint: you may want to try making the changes in the decomposed design (AND-OR) and then transforming it to NAND gates again.)

Week 3

Due Tuesday, 29 September, 1998
  1. Problem 6-4 from Mano.
  2. Using D flip-flops, construct (on paper) a state machine and associated logic diagram for recognizing the sequence 101 in a bit stream with no overlaps.
  3. Do the same thing using JK flip flops. Show the state transition table and the necessary JK inputs.

Week 4

Due Thursday, 1 October, 1998
  1. Design a security system circuit as described in class with 3 inputs--door, enable, and timer-- and two outputs--alarm and reset/count--that has a wait state when the system is turned on. Design your circuit so that when the alarm goes off it continues to go off until the enable input goes to 0.

Week 5

No Homwework (Exam & October Break)

Week 6

Due Thursday, 29 October, 1998
  1. Problem 7-16 from Mano.
  2. Problem 7-35 from Mano, but answer using a total memory capacity of 4096 bytes.
  3. Problem 8-4 from Mano (think about how this might apply to a security system).

Week 7

Due Thursday, 5 November, 1998
  1. Find 2 products we could use for putting together a security system for the lab (310). Possibilities include motion sensors, laser/infrared sensors, locking mechanisms, vibration sensors, etc..

Week 8

No homework

Week 9

No homework

Week 10

No homework

Week 11

Due Friday, 4 December, 1998

On the microcontroller data-flow worksheets please outline the function of each of the following instructions:

  1. ADDWF
  2. CALL
  3. RETLW
  4. BTFSIC

Please show both the fetch and execute cycle for each command. When you are showing the data flow on the worksheets, please show how the different parts of the instruction would affect the data flow. Consider all possible address modes and all possible destinations for the data. Include a separate sheet of paper if you want to provide additional graphics or textual explanation (strongly suggested).

Week 12

Due Friday, 10 December, 1998

VHDL exercises

Week 13

No homework (last week of classes).