Computer Science 37 HW 1
Uploaded by
Alexander TaylorComputer Science 37 HW 1
Uploaded by
Alexander TaylorCS37 Summer 2002, Homework 1
Due on Friday, July 5th, at the beginning of class. Note that each problem herein must be turned in as a separate deliverable, each one clearly labeled with your name.
LogicWorks Practice
You are not required to use LogicWorks for this assignment, however, you are highly encouraged to use it and check the correctness of your solutions. Since Homework 2 will require you to implement and test your circuits, it doesnt hurt to get some practice right now. Before you do anything serious with LogicWorks, allow yourself time to play around with different devices and options. At this point, the devices youll be interested in can be found in libraries Simulation Gates (logic gates such as NOT, AND, OR, etc) and Simulation IO (the binary probe lets you see the bit-value of a signal and the binary switch allows you to provide input to your circuits: double-clicking on the switch toggles the value it produces). Make sure you know how to draw, rotate, select, move and delete devices and wires. Use the pencil tool (Edit->Name) and click on the wire you want to name, double-click on the textbox that appears, type a string and press enter: this will label a signal and allow you to identify it in the timing window. These labels can also be used to connect components far away from each other, what can greatly decrease the visual clutter when your circuits get complex.
PROBLEM I (40 points)
1) Apply DeMorgans theorem to the following equations: (10 points) a. F = A + B + C b. F = A + B + C + D 2) Simplify the following equations using only algebraic reductions (show intermediate steps one-by-one): (16 points) a. F = AB + CD + EBA b. F = ABC + CD + D c. F = A A B d. F = ( AB + C + DE ) ED 3) Transform the following equations as required and draw the circuits that implement them: (14 points) a. F = AB + CDE using only NAND gates. b. F = A B + C D E using only NOR gates.
PROBLEM II (60 points)
1) The Gray code is a binary representation for integer numbers. As weve seen in class, in this encoding, only one bit changes between the representation for two successive values. Using the truth table below as a starting point, design a circuit to convert from binary to Gray code. (20 points) Binary code 000 001 010 011 100 101 110 111 Gray code 000 001 011 010 110 111 101 100
2) A four-bit comparator is a component that takes X and Y, two four-bit values, as inputs and produces a single bit of output. When X=Y, the output is 0, otherwise the output is 1. Design a four-bit comparator using any of the logic gates weve seen in class. Hint: It pays off to understand well how each kind of logic gate that you have at your disposal works. If you dont heed this advice, youll do a lot more work than you need: you can think of a four-bit comparator as four one-bit comparators combined in some fashion. (10 points)
3) Consider a word made of four bits. A 4-bit parity function takes a 4-bit word as input and produces one bit as a result, which equals 1 if the number of 1-digits in the input is odd and 0 otherwise. (30 points) a. b. c. d. Construct the truth table for P, the 4-bit parity function. Derive the sum-of-products canonical form of P. Derive the product-of-sums canonical form of P. Using the expression youve derived for (b) above and a Karnaugh map, produce the minimal sum-of-products form for P. e. Draw the circuit that implements the minimal sum-of-products for P, which youve found in (d), using only NAND gates.
