Binary Logic, Gates, and Boolean Algebra

Tom Kelliher, CS 220

Sept. 10, 2001

Administrivia

Announcements

Assignment

Read 2.3--4.

From Last Time

Radix conversions, characters codes, parity.

Outline

1. Binary logic and Gates.

2. Boolean Algebra.

Coming Up

Standard forms, maps, and minimization.

Binary Logic and Gates

1. Fundamental operators and their symbols:
   1. AND

   2. OR

   3. NOT

2. NAND is complete.

3. Gate fan-in and fan-out. Electrical significance.

4. Timing diagram.
   1. Frequency and period.

   2. Timing diagrams. Show AND, OR, NOT waveforms for input: A: 0011, B: 0101.

   3. What do the waveforms really look like: propagation delay, noise, under- and over-shoot.

Boolean Algebra

1. Boolean functions can be represented by equations, truth tables, or logic circuits.

   How do you convert from one form to another?

   How many rows in the truth table of an n-input Boolean function?

2. Why would we want to simplify a Boolean equation?

3. Basic Identities:

   

Exercises

Example simplification. Use Boolean manipulation to show:

1. Use truth tables to verify each of the following:
   1. DeMorgan's theorem for three variables: .

   2. Identity 15.

   3. 

2. Use Boolean manipulation to verify each of the following:
   1. 

   2. 

   3. 

   4.