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)
For each of the following functions, find all the minimum SOP expressions using the Karnaugh map. f(a,b,c,d) = Σm(0,2,3,4,6,7,8,9,10,11,13,15) (4 solutions) g(a,b,c,d,e)= Σm(0,1,2,4,5,6,10,13,14,18,21,22,24,26,29,30) (1 solution) h(a,b,c,d) = Σm(1,3,4,6,10,12)+Σd(0,7,9,13,15) (3 solutions) f(w,x,y,z) = Σm(0,2,7,8,9,11,13)+Σd(3,10) (2 solutions)
Simplify the following functions using a K-map and obtain the minimal SOP and minimal POS equations for each function. a) ?(?, ?, ?, d) = ∑ ?(0,2,4,11,13,15) b) ?(?, ?, ?, ?) = ∑ ?(1,3,5,7,8,9,11,12,14) + ??(0,2,6,10)
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