Digital Logic Design

What you'll learn

• Explain why digital systems use two-valued signals, distinguish combinational from sequential circuits, and convert numbers between binary, octal, decimal and hexadecimal.
• Add and subtract in binary, represent signed numbers in two's complement, detect unsigned and signed overflow, and use BCD, Gray code, ASCII and parity.
• Apply the laws of Boolean algebra and De Morgan's theorems, build truth tables, and write functions in canonical sum-of-products and product-of-sums form.
• Draw and read gate symbols, implement any function with NAND or NOR gates alone, explain CMOS gate structure, and calculate noise margins and dynamic power.
• Minimize functions of up to four variables with Karnaugh maps, using prime and essential prime implicants and don't-care conditions, and describe the Quine-McCluskey method.
• Use multiplexers, decoders, encoders, priority encoders and seven-segment decoders, and implement logic functions with multiplexers and decoders.
• Design half adders, full adders, ripple-carry and carry-lookahead adders, adder-subtractors, comparators and a simple ALU, and estimate adder delay.
• Explain how latches and flip-flops store data, and use SR, D, JK and T devices with their characteristic and excitation tables and asynchronous inputs.
• Design registers, shift registers, ring and Johnson counters, synchronous binary and modulo-N counters, and apply counters to timing and frequency measurement.
• Specify, design and implement Moore and Mealy finite state machines, choose a state encoding, and make unused states safe.
• Analyze propagation and contamination delay, setup and hold constraints, clock skew and hazards, and synchronize asynchronous inputs and clock-domain crossings.
• Describe combinational and sequential circuits in Verilog, write a simple testbench, and explain how FPGAs and the synthesis flow implement a design.