![]() |
|
Instructor: Monica Nicolescu | ||||||||
|
||||||||
Teaching assistant: Amol Ambardekar | ||||||||
|
||||||||
Time and Place |
||||||||
| Lectures: Tuesday, Thursday: 11:00am - 12:15pm, SEM 234 Labs: Monday:6:00 - 9:00pm or Wednesday: 2:00 - 5:00pm or Wednesday 6:00 - 9:00pm |
||||||||
Required Textbook |
||||||||
| Digital Design, Third Edition, Prentice Hall, 2001. Authors: Morris Mano |
Course description |
| In this course you will learn the fundamentals of number bases binary arithmetic, Boolean logic and logic functions, minimization of logic functions as sums of products, combinational circuits, sequential (state) machines, registers and register transer, counters, memory and programmable logic devices. You will receive hands-on experience in laboratory experiments. |
Prerequisites |
| CS 135 with a "C" or better. (BS-EE students are exempt from the "C" requirement.) |
Syllabus |
| Following are the topics that will be discussed, listed in the approximate order in which they will be covered. |
|
Laboratory |
| Lab webpage |
Class schedule |
| The topics presented and the lecture notes for each class will gradually be posted below as we cover them in the class. The assignments and their due dates will also be posted in this table. Please check this web page regularly for updates. Here is a list of errors from the textbook (ignore the errors related to the lecture notes, as those refer to a different instructor. |
| Date | Topic | Readings | Assignments |
|
Aug 29 |
Introduction, digital systems, binary numbers | Chapter 1: Section 1-1 and lecture notes | --- |
|
Aug 31 |
Number conversions: octal, hexa, complement systems | Chapter 1: Sections 1-1 to 1-5 | --- |
|
Sep 5 |
Complement systems, operations with binary numbers | Chapter 1: Sections 1-5, 1-6 | Hw1 out |
|
Sep 7 |
Binary codes, storage, registers, binary logic, boolean algebra, basic definitions, axioms | Chapter 1: Sections 1-7, 1-8, 1-9 | --- |
|
Sep 12 |
Boolean Algebra, basic definitions, axioms, boolean functions | Chapter 2: Sections 2-1 to 2-3 | --- |
|
Sep 14 |
Canonical standard forms | Chapter 2: Sections 2-4, 2-5 | --- |
|
Sep 19 |
Canonical standard forms, digital circuit design | Chapter 2: Section 2-5 | Hw2 out |
|
Sep 21 |
Gate-level minimization, 2, 3, 4-variable map | Chapter 2: Sections 2-6, 2-7; Chapter 3: Sections 3-1, 3-2 |
--- |
|
Sep 26 |
Five variable map, products of sums, don't care conditions | Chapter 3: Sections 3-3, 3-4, 3-5 | --- |
|
Sep 28 |
Homework review (by Amol) - Instructor out of town | --- | --- |
|
Oct 3 |
No class. | --- | --- |
|
Oct 5 |
NAND and NOR gate implementations | Chapter 3: Sections 3-6, 3-7, 3-8 | --- |
|
Oct 10 |
Adder, subtractor, decimal adder, binary multiplier, magnitude comparator | Chapter 4: Sections 4-4, 4-5, 4-6, 4-7 | --- |
|
Oct 12 |
Decoders, encoders, multiplexers | Chapter 4: Sections 4-8, 4-9, 4-10 | Hw3 out |
|
Oct 17 |
MID-TERM | --- | --- |
|
Oct 19 |
Sequential circuits, latches | Chapter 5: Sections 5-1, 5-2 | --- |
|
Oct 24 |
Flip-flops | Chapter 5: Sections 5-2, 5-3 | Hw4 out |
|
Oct 26 |
Analysis of sequential circuits | Chapter 5: Section 5-4 | --- |
|
Oct 31 |
Synthesis of sequential circuits | Lecture notes | --- |
|
Nov 2 |
State reduction, synthesis of sequential circuits | Chapter 5: Sections 5-5, 5-7 | --- |
|
Nov 7 |
Registers, shift registers, rotate registers, register design | Chapter 6: Sections 6-1, 6-2 | --- |
|
Nov 9 |
Ripple counters, synchronous counters | Chapter 6: Sections 6-2, 6-3, 6-4 | Hw5 out |
|
Nov 14 |
No Class | --- | --- |
|
Nov 16 |
Other counters, Memory: RAM, decoding | Chapter 6: Section 6-5; Chapter 7: Sections 7-1, 7-2, 7-3 |
--- |
|
Nov 21 |
Error detection and correction, ROM | Chapter 7: Sections 7-3, 7-4, 7-5 | --- |
|
Nov 28 |
PLAs, PAL, sequential devices | Chapter 7: Sections 7-5, 7-6, 7-7, 7-8 Chapter 8: Section 8-1 |
--- |
|
Nov 30 |
Register transfer level design: ASM, examples | Chapter 8: Sections 8-3, 8-4 | Hw6 out |
|
Dec 5 |
Registr transfer level design: examples | Chapter 8: Sections 8-3, 8-4 | --- |
|
Dec 7 |
Review lecture | --- | --- |
|
Dec 12 |
Integrated circuits, Digital logic families | --- | --- |
|
Dec 14 |
Final Exam: comprehensive, with emphasis on material after mid-term | --- | --- |
Assignments and grading |
|||||||||||||||||||||||||||||||||
|
Homework assignments: There will be aproximately 5 homework assignments. The homeworks and their due dates will be posted on the course web page. Homeworks are due on their specified date at the beginning of the class. Some assignments will contain extra-credit problems and some may have a programming component. Please make sure that you have a CS department computer account - you will need it for the programming assignments. You can obtain a CS department account by filling out the account registration form at the CS department. Late policy: Each late homework will incur a 10% penalty for each day of delay, but no homework may be submitted later than 3 days after the deadline. Homework is due at the begining of class. No late lab reports will be accepted. Quizzes: There will be approximately 5 quizzes. The quizzes could be given witout prior announcement. Academic integrity: Students are encouraged to study together, however each student must individually prepare his/her solutions. Cheating or plagiarism are not permitted and will be sanctioned according with the UNR policy on Academic Standards. You should carefully read the section on Academic Dishonesty found in the UNR Student Handbook (copies of this section are on-line). Your continued enrollment in this course implies that you have read it, and that you subscribe to the principles stated therein. Exams: there will be one mid-term and one final exam. Both exams will be closed books, closed notes. Permission to take exams on other dates than scheduled will not be given, except for extreme medical emergencies.
Grading policy (tentative, subject to change):
Grading scheme (tentative, subject to change):
|
Announcements |
| Announcements regarding the assignments or other updates will be posted on the class web page and also sent by e-mail. Please check your UNR e-mail account, as this is the address I will use to contact you. If needed, implement e-mail forwarding. |
|
Created by: Monica NICOLESCU (e-mail:monica@cs.unr.edu) Last update: 01/19/2006 |