| Week |
Monday |
Wednesday |
Friday |
|
1
Lab 1
Reading: pp.1-27, Appendex A, pp.33-46
|
3/27 |
Introduction
Homework 1 distributed |
3/29 |
Binary Number Systems
Binary Number Systems (annotated) |
3/31 |
Boolean Algebra
Boolean Algebra (annotated)
Homework 1 due
Homework 2 distributed |
|
2
Lab 2
Reading: pp.47-84
|
4/3 |
Logic Gates
Logc Gates (annotated) |
4/5 |
Canonical Forms
Canonical Forms (annotated) |
4/7 |
Boolean Cubes and Karnaugh Maps
Boolean Cubes and Karnaugh Maps (annotated)
Homework 2 due
Homework 3 distributed |
|
3
Lab 3
Reading: pp. 93-114, 139-145, Verilog Reference
|
4/10 |
Karnaugh Maps/Logic minimization
Karnaugh maps/Logic minimization (annotated) |
4/12 |
Introduction to Verilog |
4/13 |
Multi-level Logic
Homework 3 due
Homework 4 distributed |
|
4
Lab 4
Reading:pp. 115-138, Chapter 4
|
4/17 |
Multiplexers and Demultiplexers
Multiplexers and Demultiplexers (annotated) |
4/19 |
Structured Logic Implementations: PLAs and PALs
Structured Logic Implementations: PLAs and PALs (annotated) |
4/21 |
Adders
Homework 4 due
Homework 5 distributed |
|
5
Lab 5
Reading: Chapter 5, pp. 259-278
|
4/24 |
Sequential Logic |
4/26 |
Latches, Flip-flops, and Clocks
Latches, Flip-flogs, and Clocks (annotated) |
4/28 |
Sequential Verilog
Homework 5 due
Homework 6 distributed |
|
6
Lab 6
Reading: Finish Chapter 6, pp. 307-326
|
5/1 |
Clock Skew, Asynchronous Inputs, Registers |
5/3 |
Introduction to Finite State Machines
Introduction to Finite State Machines (annotated) |
5/5 |
Moore and Mealy Machines
Homework 6 due
Homework 7 distributed |
|
7
Lab 7
Reading: Finish Chapter 7, pp. 355-367
|
5/8 |
More Moore and Mealy Machines
More Moore and Mealy Machines (annotated) |
5/10 |
Sequential Technologies
Sequential Technologies (annotated) |
5/12 |
Ant FSM
Homework 7 due
Homework 8 distributed |
|
8
Lab 8
Reading: Finish Chapter 8, Chapter 9
|
5/15 |
State Minimziation
State Minimization (annotated) |
5/17 |
Finite State Machine Design |
5/19 |
No Class: Undergraduate Research Symposium |
|
9
Lab 9
Reading: Chapter 10
|
5/22 |
Finite State Machine Examples
Homework 8 due |
5/24 |
Computer Organization I |
5/26 |
Computer Organization II |
|
10
Lab 9
Reading: NA
|
5/29 |
No Class: Holiday! |
5/31 |
Field Programmable Gate Arrays |
6/2 |
Course Review
Course Evaluations
Homework 9 due |
|
11
Finals Week
|
6/5 |
Final Exam 8:30-10:20 a.m. |
|
|
|
|
