Solution:
First of all let's do using DeMorgan's law,
So we have, A'B'C'D'+AB'C'D+ABCD+A'B'C'D+A'BC'D+AB'C'D'+ABCD'+A'BCD
Let's do souble complement
(A'B'C'D'+AB'C'D+ABCD+A'B'C'D+A'BC'D+AB'C'D'+ABCD'+A'BCD)''
Now DeMorgan's law says when the complement is there break the bar(complement) and change the sign
= ((A'B'C'D')'.(AB'C'D)'.(ABCD)'.(A'B'C'D)'.(A'BC'D)'.(AB'C'D')'.(ABCD')'.(A'BCD)')'
= ((A''+B''+C''+D'').(A'+B''+C''+D').(A'+B'+C'+D').(A''+B''+C''+D').(A''+B'+C''+D').(A'+'B''+C''+D'').(A'+B'+C'+D'').(A''+B'+C'+D'))'
= ((A+B+C+D).(A'+B+C+D').(A'+B'+C'+D').(A+B+C+D').(A+B'+C+D').(A'+B+C+D).(A'+B'+C'+D).(A+B'+C'+D'))'
After solving this final solution is
(A'+C).(A'+B+D').(A+B+C').
and using K-map is given below:I hope this helps. Don't forget to give a thumbs up if you like this
Express the following SOP expression a a POS expression using a Karnaugh map and DeMorgan's theorems...
(14)Use a Karnaugh map to find the minimum POS for [1 (A+B+C)(A+B+C)(A+B+C) Show the equivalent SOP expression. [10 pts]
Construct the Karnaugh maps and find the minimum SOP, and minimum POS expression for each of these logic functions: a.) ? = ?̅ ?̅?̅ + ?̅ ??̅ + ??̅? + ??? b.) ? = ?̅?̅?̅+ ??̅?̅+ ?̅?̅? + ??̅? + ?̅?? c.) ? = ?̅???̅ + ???̅?̅ + ???̅? + ???
Obtain the simplest SOP and POS for the following logical expression using K-MAP. 8. F(A,B,C,D) = ABD + ABCD
Question 2 1. Formulate the minimized SOP and POS Boolean expression for the following truth table using Karnaugh map techniques. Out of the SOP and POS implementations, which is cheaper in terms of number of transistors? You can assume two transistors per input for a gate. (10 points) A B C Output 0 0 0 1 1 0 0 1 0 1 0 0 0 1 0 1 1
Use a karnaugh map to minimize the following SOP expression; BCD + ABCD+ ABCD + ABCD + ABCD+ABCD + ABCD+ ABCD+ ABCD
(c) Use a Karnaugh map to reduce the following 4-variable expression to a minimum SOP form. CD(AB+AB)+CD(AB+AB)+CD(AB+ AB)+ ABCD+ABCD+ACD+ACD (5 marks)
simplify expression using theorems of boolean algebra Simplify expression using theorems of boolean algebra A middot B bar middot C bar + A bar B bar C bar + A bar BC bar + A bar B bar C
ELE 2213 Digital Circuits Assignments Question 10 Use a Karnaugh map to minimize the following SOP expression: BCDTBT ABCD ABCD + AB CD--7 BCD ABCD - ABCD Question 13 Make a combinational logic circuit using a decoder to implement the following two functions: Y1 = AB'C' + A'BC' Y2 = A'BC' + AB'C + A'BC Page 9
need also the minimun SOP and POS expressions with the K-map. Need to know how you got tis indetail because have zeroclue how to do it and what all this is Construct a Karnaugh map for the logic function. F ABC DABC D ABCD ABCDABCD+A BCD Drag the appropriate labels to their respective targets. Note: all targets should be filled in. Reset Help 1100B Previous Answers Correct
please answer #8 using #5, will give good rating 5) a. Fill in the Karnaugh map for function G described by G(A,B,C,D)= m(0,3,5,7,10,12,13,14,15) 10 00 * CD AB 00 010 11 10 01 11 * ) 11 O o 1 1 o b. place an asterisk in each box if it is an essential prime implicant c. simplify to find the minimum SOP, and write your answer here G= A B + 6 Dt Ä CD TACD'TA'B'C'D' d. terms 5...