I can make the expression using nand gates but how can I rewrite as products of sum because of making with nor gates. $$F=S'X+SY$$
I try to take not of not but I can't.
How can I make the circuit just using nor gates.
I get it
I can make the expression using nand gates but how can I rewrite as products of sum because of making with nor gates. $$F=S'X+SY$$
I try to take not of not but I can't.
How can I make the circuit just using nor gates.
I get it
s'x+sy=[s'x+sy]''=[(s'x)'(sy)']'=[(x'+s)(s'+y')]'=[x's'+x'y'+ss'+sy']'= [(x+s)'+(x+y)'+(s'+y)']'= [(x+s)'+(x+y)'+((0+s)'+y)']'= it's-ok :)
There is the DeMorgan's law. (A' + B') = (AB)'. Use it wisely.
Demorgan Law can be applied in following steps :
1) Change all And's to Or's and vice versa. Be sure to give preference to AND while conversion when situation in not clear.
So F = S'X + SY becomes (S'+ X).(S + Y)
2) Next compliment each individual variable or group of variables which you assumed as a single entity in step 1.
For eg: (A+B)' would be a single entity, so compliment entire thing. But A + B' would be 2 entities and you would do A' + B to them.
So F = (S + X').(S' + Y')
3) Finally compliment the entire function.
So F = [(S + X').(S' + Y')] '
Now in order to implement your function as a POS or SOP, you could use NOR or NAND respectively. Also you can use single input gates (with both inputs shorted) in order to get them to function as a NOT gate.