Unformatted text preview: and two outputs ( , ) out Sum C . a) [10 points] Please write the Boolean expression of out C in minimum sum-of-products. b) [15 points] Please write the minterm expansion of (?) Sum m = ∑ . Suppose that X is the most significant bit and C in is the least significant bit. That means: ( , , ) (1,0,0) in X Y C = represents 4 m . ( , , ) (0,0,1) in X Y C = represents 1 m . 5. [10 points] Suppose that ( , , , ) (0,2,3,4,5,10,11,12,13,15) F A B C D M = ∏ . Please show ' F in minterm expansion....
View Full Document
- Spring '07
- 6 bits, minimum sum-of-products expression, minimum sum-of-products, minterm expansion