## Digital I

Course No. 0909-241-01/02

Fall 2012

Instructor

Ying (Gina) Tang

Office

Row 230

Tel.

x 5339

Email

tang@rowan.edu

Office Hours

### Open door policy

Textbook:   M. Morris Mano and Charles R. Kime, Logic and Computer Design Fundamentals, 4rd Ed. Prentice-Hall: Upper Saddle River, NJ, 2008.

Course Description in Catalog:

The first course in digital systems covers Boolean algebra, switching theory, minimization, asynchronous and synchronous network design, hardware design using state equations in a simulation and development environment. The course also treats applications of digital system design.

### Meeting Times and Place:

 Monday & Wednesday 12:15-1:30 Auditorium (Lecture)

### Special Announcements:

·              NO class on Nov. 26th, please review Sequential Circuit Lecture, HW7 and HW8 to prepare for Test 3 scheduled on Nov. 28th

### Course Objectives

By the end of the course, you should be able to do the following:

·         Design combinational circuits. Distinguish Binary, Octal, Hexadecimal and decimal number systems; Convert a number in one base to another; List decimal codes; Explain primitive binary logic and their operations; Derive the truth table of a given Boolean function; Represent a given Boolean function in the sum-of-product term format; Simplify a given Boolean function using K-maps; Describe the design procedure of a combinational circuit; Explain the functionalities of decoder, encoder, and multiplexer; Design of a combinational circuit using decoders and/or multiplexers; and design, test, and implement a circuit using top-down method via FPGA Advantage and ISE tools.

·         Design sequential circuits. Distinguish Combinational circuits and Sequential Circuits; Explain the difference between latches and Flip-Flops, and Mealy-machine and Moore-machine; Describe the design procedure of a sequential circuit; Draw a state diagram of a given sequential circuit; Design a sequential circuit using D Flip-Flops; Explain the functionalities of two types of sequential circuits – Registers and Counter; and Design registers and counters using Flip-Flops.

·         Design digital circuits using VERILOG HDL. Distinguish between structural modeling and behavior modeling, task and function, blocking and non-blocking, initial statement and always statement, and primitive and module; convert pseudo conditional code into VERILOG using different loop statements or branching statements;

### Tentative Course Schedule (including notes and assignment):

 Weeks Topic Readings Assignments Reference 1-2 Chapter 1 2-4 Chapter 2 6-9 Chapters 3 and 4 10-13 Chapter 5 13-15 Chapter 7

Ø  Professionalism                       5%

Ø  Homework                               10%

Ø  Exams                                      30%

Ø  Labs                                         35%

Ø  Final                                        20%

 93% A 80% B- 67% D+ 90% A- 77% C+ 63% D 87% B+ 73% C 60% D 83% B 70% C- 59% and less F

·         WITHDRAWAL POLICY: Carefully monitor dates if you plan to exercise your option to withdraw from the course.

·         HOMEWORK POLICY: There will be several homework assignments. These assignments will be collected and graded on completion. The exams will be taken partially from the homework. If you have questions about these problems, you should ask during class. No late homework will be accepted.

·         EXAM PLICY:   There will be 3 exams and 1 final. Exams are closed book and closed notes unless explicitly stated otherwise. Examinations may be made up only due to illness on the day of the exam (a doctor’s note is required) or by advance arrangement (a written request one week in advance of the exam is required).  The instructor reserves the right to deny any advance request for a make-up exam.

·         ATTENDANCE POLICY: In keeping with published policy (see p. 28 of the 1998-2000 Rowan Undergraduate Catalog), attendance is required because substantial in-class material is presented and attendance is needed to develop teamwork and cooperative learning skills, and to accomplish project work. The instructor must be notified in advance of the class for an excused absence.

·         CLASSROOM RULES:

Ø  Please no eating /drinking in class

Ø  No cell phones in class (if you need to have a cell phone in class due to extenuating circumstances, please let me know ahead of time)

Ø  No web surfing and / or unrelated use of computers, when we use computers in class / labs.

Ø  In-class discussions are always welcome, and in fact encouraged, within the limits of mutual respect and courtesy.

Ø  You are responsible for checking the class web page often for announcements.

·         CHEATING POLICY:

Ø  Definition – Cheating is an action of which more than one student discusses or copy answers during an exam or share solutions or programs for an assignment

Ø  All involved offenders will get zeros for the involved assignments or course work.

Ø  For a repeated offense, the offender will get a grade of F.

·         ACCOMMODATION POLICY: