Catalog Description
Introduction to switching algebra and its applications. Combinational logic and combinational circuit components. Sequential logic and sequential circuit components. Asynchronous sequential circuits.
Prerequisite: 202 and 215 each with a grade of C or better.
Objectives
This course presents the basic concepts used in the design and analysis of
digital systems and introduces the principles of digital systems design. Boolean
algebra and truth tables are used for the analysis and design of combinational
circuits and state transition techniques for the analysis and design of
sequential circuits.
| Course Outline |
Lectures | |
| 1. | Introduction to switching algebra and its applications: fundamental postulates, switching expressions and their manipulation, De Morgan's theorems, canonical forms of switching functions, Boolean algebra, minimization of switching functions. |
5 |
| 2. | Combinational Logic: design procedure, analysis procedure, code conversion, multilevel NAND circuits, multilevel NOR circuits |
8 |
| 3. | Combinational Circuit Components: adders and subtractors, decoders and encoders, read-only memory (ROM), programmable logic array (PLA) |
8 |
| 4. | Sequential Logic: flip-flops, triggering of flip-flops, sequential and finite state machines, state assignment problems, design procedure, analysis procedure, races |
6 |
| 5. | Sequential Circuit Components: registers, counters, random access memory (RAM), algorithmic state machines, implementation of control, Mealy and Moore systems |
8 |
| 6. | Asynchronous Sequential Circuits: design procedure, analysis procedure, reduction of state tables, race-free state assignment, hazards |
5 |
|
Total Lectures |
40 | |