## CSE370 Assignment 3

### Distributed: 11 April 2007

Due: 18 April 2007

Reading:

- Katz/Borriello,
Contemporary Logic Design 2e, remainder of Chapter 2
- Katz/Borriello,
Contemporary Logic Design 2e, Chapter 3, sections 3.1 and 3.2 (pp. 93-114)

#### Exercises:

- CLD-II, Chapter 2, problem
2.31, parts a and b
- CLD-II, Chapter 2, problem
2.35.
- CLD-II, Chapter 2, problem
2.44.
- CLD-II, Chapter 3, problem
3.3, part a,b,c.
- CLD-II, Chapter 3, problem
3.4, part b.

a) Translate this circuit
directly to a Boolean expression that computes the same function.

b) Express this function as a canonical Sum of Products.

c) Express this function as a canonical Product of Sums.

d) Using a K-map, find the minimal Sum of Products
expression for this function.

e) Using a K-map, find the minimal Product of Sums
expression for this function.

f) Draw the circuit corresponding to the minimal Sum of
Products representation.

7.

a) Redraw this circuit using the
deMorgan equivalent for gates where appropriate, so
that the function computed can be read directly from the circuit diagram. (Meaning
you shouldn’t have negated inputs or outputs on your gates, but you can
feed inverted signals to the circuit.)

b) Find the minimal Sum of Products form for this function.

c) Draw the circuit for this minimal Sum of Products using
only NAND gates (and inverters).

#### Rationale:

- To apply minimization
techniques using Karnaugh maps.
- To gain experience minimizing
circuits

Comments to: cse370-webmaster@cs.washington.edu