simplify the boolean function F (ABCD ) = ∑m (1,3,7,11,15) +∑d(0,2,5),if dont care condition s are not taken care , what is the simplified boolean function . what are your comments on it ? implement both circuits
Answers
Answered by
6
Answer:
( ABCD) ={m (1,3,7,11,15) it's odd number
Answered by
3
Answer:
Diagram:
In part (a) of the diagram, don't-care minterms 0 and 2 are included with the 1's, resulting in the simplified function: F = yz + w'x'
In part (b) don' t-care minterm 5 is included with the 1's and the simplified function is now F = yz + w'z
Explanation:
The minterms of F are the variable combinations that make the function equal to 1. The minterms of d are the don't-care minterms which are marked as X.
To get the simplified expression in sum-of-products form, we must include all five 1's in the map, but we may or may not include any of the X's, depending on the way the function is simplified.
Attachments:
Similar questions