Table of Contents
Our goal: Logic-function simplification
Boolean cubes
Mapping truth tables onto Boolean cubes
Logic minimization using Boolean cubes
M-dimensional cubes in an n-dimensional space
Karnaugh maps
Karnaugh maps (continued)
Adjacencies in Karnaugh maps
Karnaugh map examples
Karnaugh map examples (cont'd)
More Karnaugh map examples
Karnaugh map: 4-variable example
Karnaugh map: 4-variable example (cont)
Karnaugh maps and don't cares
Karnaugh maps and don't cares (cont'd)
Design example: two-bit comparator
Design example: two-bit comparator (cont)
Design example: two-bit comparator (cont)
Design example: two-bit comparator (cont)
Design example: two-bit by two-bit multiplier
Design example: two-bit by two-bit multiplier
Design example: two-bit by two-bit multiplier
Design example: BCD increment by 1
Design example: BCD increment by 1 (cont)
Design example: BCD increment by 1 (cont)
Definitions for two-level simplification
Notation examples
Algorithm for two-level simplification
Example: Algorithm for two-level simplification
|
Author: Carl Ebeling
Email: cse-webmaster@cs.washington.edu
Home Page: http://www.cs.washington.edu//education/courses//370/CurrentQtr
|