Catalog Description

Introduction to information representation and number systems. Boolean algebra and switching theory. Manipulation and minimization of completely and incompletely specified Boolean functions. Propagation delay, timing diagrams. Combinational circuit design using multiplexers, decoders, comparators, and adders. Sequential circuit analysis and design, basic flip-flops, clocking and timing diagrams. Registers, counters, ROMs, PALs, PLAs, and FPGAs. Introduction to Verilog.

Prerequisite: PHYS 102

Course Learning Outcomes

1. Ability to represent numbers and perform arithmetic operations in various number systems.

2. Understand basic identities of Boolean algebra and perform algebraic maninpulations and simplifications of Boolean expressions.

3. Simplify functions using the K-map method including the use of don't care conditions.

4. Design efficient combinational circuits utitlizing basic functional blocks such as adders, compartors, multiplexors, encoders, and decoders.

5. Analyze and design efficient sequential circuits using Mealy and Moore models.

6. Design registers and counters and understand their applications.

7. Model simple combinational and sequential circuits using Verilog HDL and use tools to simulate and verify correctness of design.