This** preview**
has intentionally

**sections.**

*blurred***to view the full version.**

*Sign up*
**Unformatted text preview: **s , i.e., { co, s } , is the two-bit value that results from adding a , b , and ci (e.g., if a = 1, b = 0, and ci = 1 then s = 0 and co = 1.) Full adders are described in more detail in Chapter 10. (a) Write out the truth tables for the s and co outputs for the full adder. (b) Draw Karnaugh maps for the s and co outputs for the full adder. (c) Circle the prime implicants and write out the logic equations for the s and co outputs of the full adder. (d) How would the use of an XOR gate help in the half adder? How would it help in the full adder? Exercise ( Logisim ). Implement the logic function f ( x, y, z ) = ( xy ) + ( x z ) . Test the output of function f ( x, y, z ) using diﬀerent input combinations in Logisim and ﬁll the following truth table. 1 EE M16 Assignment 2 — Monday, October 19, 2015 Fall 2015 x y z f ( x , y , z ) 1 1 1 1 1 1 1 1 1 1 1 1 Verify the Logisim outputs using the results calculated from Boolean algebra. 2...

View
Full Document

- Fall '11
- cabriv
- Boolean Algebra, Half adder, Logical conjunction