Week 1
Due Monday, 11 September, 2000
Solutions for week 1
-
Wakerly: Drill problems 2.1, 2.5 (a-f), 2.7 (c,d), 2.10 (c,d)
-
Wakerly: Exercises 2.28, 2.30, 2.33
-
Write the code words of a Hamming code with 2 information bits.
Week 2
Due Monday, 18 September, 2000
Solutions for week 2
-
Wakerly: Drill problems: 4.9 (c, d only), 4.13 (b. f only),
-
Wakerly: Excercises 4.45, 4.46, 4.69 (b, e only), 4.72 (c only)
Week 3
Due Wednesday, 27 September, 2000
Solutions for week 3
-
The expression:
c4 = g3 +
p3g2 +
p3p2g1 +
p3p2p1g0 +
p3p2p1p0c0
is a very useful one in digital design (can you figure out what it is?).
-
Draw a logic diagram for this expression directly from the expression above.
-
Decompose this expression into 3-input AND and OR gates.
-
Transform your diagram into a combination of NAND gates and inverters.
-
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?
-
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.)
-
Using the Max+Plus II software, write, compile, and test a VHDL
program for the four-to-two priority encoder we went over in
class. Turn in the VHDL code and the simulator results for all
possible input combinations.
Week 4
Due Wednesday 4 October 2000
Solutions for week 4
-
Wakerly Drill Problems: 3.12, 3.16, 3.24, 5.5
-
Wakerly Exercises: 3.59, 4.83, 5.42
Week 5
No homework, exam week
Week 6
Due Wednesday 25 October, 2000
Solutions for week 6
-
Wakerly Drill Problems: 7.9, 7.14, 8.16
-
Wakerly Exercises: 8.27, 8.45
Week 7
No homework
Week 8
Due Monday 6 November 2000
Solutions for week 8
Design a Moore state machine that counts the number of 1010 strings in
a bit sequence.
-
Draw the Algorithmic State Machine Diagram for this circuit.
-
Design a one-hot (one F/F per state) state machine and draw the
logic diagram assuming a 74163 4-bit counter.
-
Build a MUX state machine table for this circuit.
-
Column 1 is current state.
-
Column 2 is next state.
-
Column 3 is the expression that must be true for the transition to take place.
-
Column 4 and on are the MUX expressions.
-
There should be one section of rows for each current state, and
one MUX expression for each current state section.
-
Draw the logic diagram for the MUX state machine, again assuming a
74163 4-bit counter.
Week 9
Due Monday, 13 November, 2000
Form a team of 2-4 people and develop a 1-page proposal for your final
project. The proposal should include a brief description of what you want
to do, a list of materials, and a timeline that breaks the project into
parts and specifies when each part will be completed.
Week 10
Due Wednesday 22 November 2000
-
Go to the US Patent
and Trademark Office web search page. Pick keywords related to
your final project topic and do a patent search. Use the full-text
database so you can read more detail about the patents you
find.
-
Pick out at least three patents related to your topic and summarize
them.
-
Is your final project idea patentable? Why, why not?
-
Does your idea/final project topic potentially infringe on any of
the patents you found? How?
Week 13
Due Friday 8 December 2000
Diagram the data flow for each of the following instructions:
- ADDLW k
- SUBWF f, 1
- BTFSC f, b
- RETLW k