- 1 Simplify The Following Boolean Function By Using K Map Method F D C B A 0 2 4 11 14 15 D 6 7 Where D Denotes D 1 (366.62 KiB) Viewed 33 times
1) Simplify the following Boolean function by using K-map method f(D,C,B,A)= (0,2,4,11,14,15)+d(6,7), where d denotes 'd
-
answerhappygod
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am
1) Simplify the following Boolean function by using K-map method f(D,C,B,A)= (0,2,4,11,14,15)+d(6,7), where d denotes 'd
1) Simplify the following Boolean function by using K-map method f(D,C,B,A)= (0,2,4,11,14,15)+d(6,7), where d denotes 'don't care’. Plot the simplified function using logic gates. 2) Given the following Boolean function fi(w,x, y, z)=xy'z + x'y'z+w'xy+wx'y+wxy Draw a corresponding Karnaugh map of the function fi. Simplify the function and implement it by using NAND gates only.