Professor Bonnie Heck
	Office: E288 Van Leer Phone: 4-3145 Email Address: bonnie.heck@ece.gatech.edu Office Hours:  Wed. 9-10:30,Tues. 11-12, Thurs. 1-2, anytime door is open TA is Nick Brown, office hours in VL 448 are Monday 1pm to 4pm Thursday 3pm to 5pm email: gtg111m@mail.gatech.edu The best way to reach Prof. Heck is via email.

Course Description: 

Computer system and digital design principles. Architectural concepts, software, Boolean algebra, number systems, combinational datapath elements, sequential logic, and storage elements. The objective on this course is to present students with the basic building blocks and techniques necessary for the design of digital electronic circuits and their application to the design and operation of basic datapaths.

Announcements/New Items:

• Announcement 1: My old exams can be downloaded here.
• Announcement 2: The Tutoring lab is open for this course. It is located in Room 448 of Van Leer. Please feel free to stop by there with questions.
• Announcement 3: Test dates are Test 1 (Feb 9), Test 2 (March 14), Test 3 (April 18)
• Announement 4: Test 1 solutions are available here.
• Announement 5: Test 2 solutions are available here and here.
• Announement 6: Test 3 solutions are available here.

Assignments:

The problems suggested below correspond to the material in class. Failure to work the problems will result in a poor test performance. Work these problems as we go through the material, do not wait until the night before the test. Attempt each problem on your own first before seeking help from others.

Assn. #	Description	Sample Problem Solutions
1	Practice: Problems 1-7 on switch design found here Sample Problems	available
2	Sample Problems Problems 3-6 on Boolean algebra found here	available
3	Sample Problems Practice: All problems on Mixed Logic found here	available
4	Sample Problems Practice: Problem 1, 3(parts A and B) on Simplication found here	available
5	Sample Problems Practice: Number systems: problem 1 found here. Exams 1 and parts of 2 from any of the old sections found here.	available
6	Practice: Building Blocks, Problems 1-7 found here
7
8	Arithmetic: Problems 1 and 2 found here
9	Practice: Latches and registers, Problems 1 parts A-C, H,I; 2, 3; 6 A-C; 7 B-C found here
10	State Machines: Problem 1, 2 (optional), 3, 4, 5,7 found here
11	Counters: Problems 1-5 found here
12	Memory: Problems 1-3 found here
13	Datapath Elements: Problems 1-4 found here Single Cyle Datapath: Problems 3-10 found here
14	Instructional Types: Problems 1-6 found here
	Quiz 12, due Thursday at noon SPIM can be obtained here Summary of MIPS code found here sample SPIM code: spim_ex0, spim_ex1, spim_ex3
15	Branching: Problems 1-4 found here

Grading Policy:

Grading: Test 1 20% (Feb 9), Test 2 25% (March 14), Test 3 25% (April 18), Final Exam 25%, Pop Quizes 5%. The exams are closed books and closed notes. There will be 12 pop quizes, each consisting of a relatively straightforward question or problem from the previous lecture. Prior to each class, review the notes from the previous lecture. The three lowest quiz grades will be dropped.

Grades can be accessed through WebCT.

The best way to do well in this course is to have good study habits. See the on-line reference on study habits for more details.

Familiarize yourselves with the Georgia Tech Academic Honor Code. It will be enforced in this class.

Course Schedule

Week 1

• Switches: AND, OR circuits
• CMOS circuits

  Text coverage: Class notes and Mano & Kime, Sections 2.7-2.8, pg. 70-77

Week 2

• Building circuits from Boolean algebra expressions
• Boolean algebra

Text coverage: finish last week's readings, Mano & Kime, Sections 2.1, 2.2, and 2.3, pg. 29-47,

Week 3

• Mixed Logic for Gate Design
• Simplifying expressions

  Text coverage: Class notes, Mano & Kime, Sections 2.4 and 2.5, pg. 47-65.

Week 4

• Simplifying expressions
• Binary, octal, hexadecimal number systems

  Text coverage: Mano & Kime, Sections 1.2, pg. 10-13,Sections 3.10, pg. 137-140, Sections 9.7, pg. 491-495.

Week 5

• Representations: unsigned, fixed point, two’s compliment, ASCII, floating point, powers of two

  Text coverage: (see last week's entry)

Week 6

• Arithmetic: addition and subtraction, errors and overflows, full adder and subtractor
• Encoders, Multiplexing, Decoders, Demultiplexers

  Text coverage: Mano & Kime, Sections 3.1, pg. 91-92; Sections 3.5, 3.6, and 3.7, pg. 111-124.

Week 7

• Sequential circuits
• Storage devices: latches, flip flops

Text coverage: Sections 4.1 and 4.2, pg. 183-191; Sections 5.1, 5.2, and 5.3, pg. 249-256.

Week 8

• Registers

  Text coverage: Sections 4.4, pg. 201-208.

Week 9

• State machines
• Counters

  Text coverage: pages Sections 5.5, pg. 263-273. Handout on State Machines

Week 10

• Memory

Text coverage: Handout on Memory

Week 11

• Memory

Text coverage: Handout on Memory

Week 12

• Datapath elements

Text coverage: Handout on Datapath Elements, Single Cycle Datapath

Week 13

• Single Cycle Datapath

Text coverage: Handout on Single Cycle Datapath

Week 14

• Instruction Types

Text coverage: Handout Instruction Types

Week 15

• Branching

Text coverage: Handout Branching

Resources and References

Required Software:

• Netscape Navigator (obtained from the Netscape home page) or Internet Explorer (obtained from the Microsoft IE home page) to view Web pages.

General ECE 2030 Link:

There is a general home page for ECE 2030 that contains old problems, old tests and handouts.