**TIA**

*Here's the given:*

Design a circuit which will yield the product of two binary numbers

**n**and

**m**, where 00

**n**

**m**

**n**= 10 and

**m**= 001, then the product is

**n**x

**m**= 10 x 001 = 0010.

Let the variables

**A**and

**B**represent the first and second digits of

**n**,respectively (i.e., in the above example

**A**= 1 and

**B**= 0). Let the variables

**C**,

**D**, and

**E**represent the first, second, and third digits of

**m**, respectively (in the above example

**C**= 0,

**D**= 0, and

**E**= 1). Also let the variables

**W**,

**X**,

**Y**, and

**Z**represent the first, second, third, and fourth digits of the product. (In the above example

**W**= 0,

**X**= 0,

**Y**= 1, and

**Z**= 0.) Assume that

**m**> 101 never occurs as a network input.

Design the network using only 2- and 3-input NOR gates and inverters. Try to minimize the total number of gates and inverters required. The variables

**A, B, C, D**, and

**E**will be available from toggle switches. Any solution that uses 16 or fewer gates and inverters (not counting the 5 inverters for the inputs) is acceptable.

here the original given scanned file from the book: http://i155.photobucket.com/albums/s318/jdimpas/logic1.jpg