El E 335 Spring 2001

Catalog description. El E 335, Principles of Digital Systems. Binary numbers, number system conversion, coding schemes; Boolean algebra, axioms, theorems, Karnaugh map; logic design, Boolean functions, minimization; implementation of transform methods; asynchronous systems. Prerequisite: CSCI 251 or 111. Corequisite: EL E 336. (3)

Instructor. Dr. Mark Tew, Associate Professor of Electrical Engineering

310 Anderson eemdt@olemiss.edu Office hours TBA

Meetings. 8:00 - 8:50 Monday, Wednesday, Friday. Anderson 231

Textbook. Fundamentals of Logic Design, Fourth Edition, by Charles H. Roth, Jr., PWS Publishing Co., 1995.

Reference. Digital Design Fundamentals, by Kenneth J. Breeding, Prentice Hall. LogicWorks4, by Capilano Computing Systems.

Resources.

The course web page is http://www.olemiss.edu/courses/EE/ELE_335/Spring2001/. Notes for each lecture presented will be posted here shortly after class. This page will also have links to the syllabus, contact information for Dr. Tew, answers to test questions posted after the test, etc.

http://www.olemiss.edu/courses/EE/ELE_335/ has links to notes given in Spring 1999, Fall 1999, Spring 2000, and Fall 2000, including tests and answers to tests, homework assignments and answers to homework assignments.

A listserver, named ee_335", will be used as the primary means of out-of class communication. All notices regarding homework, tests, review sessions, etc. will be posted to this listserver. Students may use the listserver to post questions, or to answer questions posted by other students. At least once a day, M-F, Dr. Tew will monitor questions and comments posted to the list.

To subscribe to the mailing list:

send an e-mail message to

md@listserv.olemiss.edu with the line:

subscribe ee_335

in the message body. Leave the subject field blank.

Once you are subscribed, you will receive copies of all messages that are posted to the mailing list.

To send an e-mail to everyone who has subscribed to the listerserver:

send an e-mail to ee_335@listserv.olemiss.edu

Communications. Notices regarding room changes, tests, homework assignments, etc., that occur between classes will be delivered via the ee_335 listserver. It is each student's responsibility to check his or her e-mail at least once a day to receive these notices. Printed copies of some notices will be posted outside Dr. Tew's office door and in the Anderson Hall elevator.

Laboratory. EL E 336, Digital Systems Laboratory, is a corequisite for this class. If you drop EL E 335, you must also drop EL E 336. If you drop EL E 336, you must also drop EL E 335.

Homework.

Homework is due on or before 8 AM on the "due date". On-time homework which exhibits a good-faith effort to work the problem(s) will receive credit ranging from 50% to 100% for each problem. Because homework solutions will be posted on the web, late homework submissions will receive 0% credit. Quizzes will be treated as in-class homework.

Honor Code. Unless specifically designated as an "Honor Code Homework", you may consult with Dr. Tew and other students in working the homework problem. It is a violation of the Honor Code to copy another person's work, however.

Attendance. Attendance is recorded and will be used only for a student who lies near the boundary between two letter grades.

Grading. Semester Points will be determined by the following formula

Sem_Pts=Homework*0.10 + Weighted_Test_Average*0.65 + Final_Exam*0.25

Weighted_Test_Average=(Lowest_Score + Middle_Score*2 +Highest_Score*2)/5

Homework=100*Your_Homework_Points/Highest_Homework_Points_Awarded

90 <= Semester points <= 100 A*

80 <= Semester points <= 89 B*

70 <= Semester points <= 79 C*

60 <= Semester points <= 69 D*

Semester points <= 59 F*

* Based on the range of points at the end of the semester, these scale points may be lowered—they will not be increased.

The final exam is comprehensive—that is, it covers material from the entire semester. If you pass the final exam you pass the course. That is, a student whose grade computes to an "F" based on the semester points equation above and who receives a grade of 60 or better on the final exam will receive a "D" in the class.

 

This grading system resulted in the following grade distribution:

ElE 335 Spring 1999 A's 9 B's 5 C's 4 D's 5 F's 3

ElE 335 Fall 1999 A's 5 B's 5 C's 7 D's 5 F's 4

ElE 335 Spring 2000 A's 5 B's 6 C's 4 D's 1 F's 3

ElE 335 Fall 2000 A's 4 B's 5 C's 2 D's 4 F's 3

"I" grades will not be awarded except in the case of personal or family emergency.

 

Goals. A student who successfully completes El E 335 will have an understanding of the principles of digital systems. He or she will be able to analyze and design a combinational logic circuit and a sequential state machine.

Core Topics:

1) Operation of simple gates.

2) Evaluation of truth tables.

3) Understanding of logic systems and the relation between logic values and voltages.

4) Minimized functions for 4-variable expressions using a Karnaugh map.

5) Understanding simple MSI circuits such as multiplexers, demultiplexers, adders, decoders, Read-Only Memory.

6) Analysis of a circuit. From a circuit generate the Boolean function expression and the truth table.

7) Synthesis of a circuit. From a truth table or Boolean function, generate the circuit.

8) Design of a circuit. From a word description of a problem, generate a truth table that solves the problem

9) Operation of S-R, D, J-K, and T flip-flops.

10) Analysis of a sequential state machine. From a circuit generate the state transition table and state transition diagram.

11) Synthesis of a sequential state machine. From a state transition table or state transition diagram, generate the sequential circuit.

12) Design of a sequential state machine. From a word description of a problem, generate the state transition table or state transition diagram that solves the problem.

13) Use the circuit simulation program LogicWorks to model and analyze digital circuits.

Supporting topics:

a) Axioms and theorems of Boolean Algebra.

b) Representation of integers and fractions in the binary number system. Conversion between binary, octal, decimal, and hexadecimal.

c) Minimization using the Quine-McCluskey method

d) Use of timing diagrams to detect glitches in combinational circuits

e) Understanding of the fundamental model of sequential circuits.

f) Intelligent assignment of states.

g) Reduction of states.

h) Differences between Moore and Mealy machines.

i) Conversion between Moore and Mealy machines.

Grading Guidelines.

Grades are assigned based on the grading formula given "Grading". Referring to the 13 "core topics" and 9 "supporting topics", the grading formula relationship to understanding often reflects the following:

"A": Has a good understanding of the core topics and supporting topics. Almost always can successfully solve problems from these areas.

"B": Has a general understanding of most of the core topics. May be less strong in the supporting topics. Would be expected to be unable to solve a few problems from these areas.

"C": Lacks understanding of several core topics. Can successfully solve some problems in the core topics, and fewer in the supporting topics.

"D": Limited understanding of most of the core topics and supporting topics. May have a few areas of understanding, but lacks breadth.

"F": Lack of understanding of the core topics. Unlikely to successfully solve a problem in the core topic area.