This course offers an introduction to the fundamentals of logic circuits and digital systems. Students will learn key concepts such as Boolean algebra, combinational and sequential logic, logic simplification techniques, and finite state machines. By the end of the course, they will also explore programmable logic devices and other advanced digital circuits for practical applications.
Tuesday, 1:30-3:00 PM (Room B473, Engineering Bldg. or Virtual)
Thursday, 12:00-13:00 PM (Recorded)
Tuesday 3:00-4:00 PM, or by appointment (Room C383-1, Engineering Bldg.)
| Week | Overview | Lecture Contents | Remark |
|---|---|---|---|
| 1 | Introduction | Digital and Logic Concepts | |
| 2 | Boolean Algebra | Boolean Algebra, Logical Expression, Axioms and Theorems | |
| 3 | Combinational Logic | Logic Gates and Canonical Forms (Minterm and Maxterm Expansions) | Quiz 1, HW 1 |
| 4 | Logic Simplification I | 2-Level Logic Simplification Using Boolean Cubes and Karnaugh Maps | |
| 5 | Logic Simplification II & Time Response | NAND-NAND/NOR-NOR Simplification, Hazard Detection and Elimination | Quiz 2, HW 2 |
| 6 | Combinational Logic Technology | Logic Design Using Multiplexers, PLAs and PALs | |
| 7 | Arithmetic Circuits | Number Systems and Binary Adders | Quiz 3, HW 3 |
| 8 | Midterm Exam | ||
| 9 | Sequential Logic | Synchronization Concepts, Latches and Flip-Flops | |
| 10 | Timing Concepts | Setup time, Hold time and Timing Constraints | |
| 11 | Finite State Machine I | Registers, Counters and State Concpets | Quiz 4, HW 4 |
| 12 | Finite State Machine II | Logic Design Using Moore and Mealy Machines | |
| 13 | State Optimization | State Minimization Techniques | Quiz 5, HW 5 |
| 14 | Digital System Applications | Case Studies of Combinational and Sequential Logic Design | |
| 15 | Course Review | Digital and Logic Concpet Reivew | Quiz 6, HW 6 |
| 16 | Final Exam |