CS 150 Homework #8
Due October 31st

(1) There are 2 simple 4 input functions which aren't reducible in either sum of products or product of sums form. What are the karnaugh maps whith these properties? What are these functions

(2) Using the minimal number of NOR gates for each output individually, build a BCD incrementer.

(3) You can subtract a binary number B from a number A by producing the 2's complement version of B then add normally. What is the truth table for a subtractor which subtracts a 3 bit two's complement number (B) from anther 3 bit 2's complement number? Using Karnaugh maps, what is the minimal sum of products representation for the 3 outputs? Also, construct a reasonably good multi-level representation of this function.

(4) Construct a 3 bit adder with carry-in, using multilevel logic. Xors are allowed and encouraged.

This page is maintained by Nick Weaver (nweaver@cs.berkeley.edu)