Table of Contents
Review
Number systems
Sign and magnitude
Ones complement
Twos complement
Twos complement (con’t)
Overflow
The basics? binary numbers
Next subject: Combinational logic
Switches can compute simple functions!
Logic functions and truth tables
Logic functions and truth tables (con’t)
Minimal set of logic gates
Minimal set of logic gates
Mapping Boolean expressions to logic gates
What is the optimal gate realization?
Exploring different circuit implementations
Some notation
The mathematics: Boolean algebra
Digital (binary) logic is a Boolean algebra
Logic functions in Boolean algebra
Logic simplification using Boolean axioms
Useful laws and theorems
Useful laws and theorems (con’t)
Proving theorems
Proving theorems
Simplifying Boolean expressions
Simplifying Boolean expressions
de Morgan’s theorem
de Morgan’s theorem
Sum-of-products canonical form
Minterms
Product-of-sums canonical form
Maxterms
Canonical implementations of F = AB + C
SOP, POS, and de Morgan's theorem
Conversion between canonical forms
Incompletely specified functions
Truth table for a BCD-increment function
Notation
|
Author: Carl Ebeling
Email: cse-webmaster@cs.washington.edu
Home Page: http://www.cs.washington.edu//education/courses//370/CurrentQtr
|