A little electronics question about logical gates

[Femme_physics]

A little electronics question about logical gates...

Basically I want to see if I got it right?

http://img853.imageshack.us/img853/7681/laster.jpg

 

[ehild]

Basically I want to see if I got it right?

http://img853.imageshack.us/img853/7681/laster.jpg

No. What does an OR gate do with the inputs?

ehild

 

[Femme_physics]

It multiplies them. Hence:

http://img818.imageshack.us/img818/171/image201112310002.jpg

 

[ehild]

Well, OR adds the inputs. But the symbol for an OR gate is not what you drew. It is spiky. Do you mean an OR or an AND gate?

Spoiler

http://t3.gstatic.com/images?q=tbn:ANd9GcTDQvJSd5YnvIHkMqyVIQkHA4Dyro5omM0DxyfnYDcrAVSe6Zec

ehild

 

[Femme_physics]

Oh, I mean an AND gate, then. sorry.

 

[ehild]

In that case, erase that "OR".
And then the output is correct, but can be simplified.

ehild

 

[Femme_physics]

You're right, I got the wrong gate name.

Now I'm trying to see how to simplify it, I'm starting with a truth chart but I'm not 100% sure I got it right:..

http://img13.imageshack.us/img13/6718/image201112310003.jpg

 

[ehild]

Let's start with the basic things. How are the logical addition, multiplication and negation defined?

ehild

 

[I like Serena]

Hi Fp!

Perhaps you would like to try to fill out the following table?

$$
\begin{array}{|c|c|c|c|c|c|c|c|}
a & b & c & ab & \overline{ab} & \overline{ab} c & cc & \overline{ab} c + cc \\
\hline \\
0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 \\
0 & 0 & 1 & 0 & 1 & & & \\
0 & 1 & 0 & 0 & 1 & & & \\
0 & 1 & 1 & 0 & & & & \\
1 & 0 & 0 & 0 & & & & \\
1 & 0 & 1 & 0 & & & & \\
1 & 1 & 0 & 1 & & & & \\
1 & 1 & 1 & & & & & \\
\hline \end{array}
$$

 

[I like Serena]

Good point, edited.
I don't like how Latex shows it though.

 

[I like Serena]

Just found it myself too ;) Fixed it.

 

[Femme_physics]

Let's start with the basic things. How are the logical addition, multiplication and negation defined?

ehild

Well, it depends on the scenario. What bridge are we talking about? What function do we have?

Perhaps you would like to try to fill out the following table?

I did my own, similar one, a while ago... except I didn't include AC(capped)
http://img684.imageshack.us/img684/4424/chart3u.jpg

And this is how I got F

http://img402.imageshack.us/img402/7498/chart1ar.jpg
I presume 1+1 reboots the thing and makes it 0?

 

[Curious3141]

Basically I want to see if I got it right?

http://img853.imageshack.us/img853/7681/laster.jpg

A truth table is the most basic way to do it, but it is tedious. This is very easy to simplify using the basic laws of Boolean algebra (BA).

Let's review some basic rules of BA. Let x be a binary variable.

How would you simplify xx?

What is (x + 1)? (1 + x)?

What is x.1? 1.x?

 

[Curious3141]

Well, it depends on the scenario. What bridge are we talking about? What function do we have?



I did my own, similar one, a while ago... except I didn't include AC(capped)
http://img684.imageshack.us/img684/4424/chart3u.jpg

And this is how I got F

http://img402.imageshack.us/img402/7498/chart1ar.jpg
I presume 1+1 reboots the thing and makes it 0?

Some entries are wrong. For instance 1 + 1 is not 0, but 1. Remember that '+' here signifies the OR function.

 

[Femme_physics]

A truth table is the most basic way to do it, but it is tedious. This is very easy to simplify using the basic laws of Boolean algebra (BA).

Well, we were told to always do truth tables since we're just beginners.

Let's review some basic rules of BA. Let x be a binary variable.

How would you simplify xx?

X^2

What is (x + 1)? (1 + x)?

2X + X^2 +1

What is x.1? 1.x?

That would be 1 times x? that's X.

Some entries are wrong. For instance 1 + 1 is not 0, but 1. Remember that '+' here signifies the OR function.

Did not know that! So,

http://img225.imageshack.us/img225/5489/fscan.jpg

 

[I like Serena]

X^2

"xx" represents "x AND x".
Do you know what that is?

2X + X^2 +1

"x+1" represents "x OR 1", which is?

That would be 1 times x? that's X.

"1x" represents "1 AND x".
But yes, that would be the same as x.

Did not know that! So,

http://img225.imageshack.us/img225/5489/fscan.jpg

Yes!

Can you see which columns are identical to F?

 

[Femme_physics]

"xx" represents "x AND x".
Do you know what that is?

Multiplication.

"x+1" represents "x OR 1", which is?

Addition.

"1x" represents "1 AND x".
But yes, that would be the same as x.

Also multiplication!

Can you see which columns are identical to F?

Yes, CC. But, we only know how to simplify using Karno Map (translating the name from Hebrew).

So,

http://img576.imageshack.us/img576/92/image201201010014.jpg

 

[Curious3141]

http://img225.imageshack.us/img225/5489/fscan.jpg

OK, so the above Truth Table is now correct. Do you see that the output is exactly $c$? The output is 0 when $c=0$ and 1 when $c=1$. So the simplified final answer is just $c$.

Here's how to see that by doing the Boolean Algebra. I'm going to answer my own post here:

$xx$ (can also be written $x.x$) $= (x AND x) = x$. This is because when x = 0, 0 AND 0 = 0, and when x = 1, 1 AND 1 = 1.

$(x+1) = (x OR 1) = (1+x) = (1 OR x) = 1$. A '1' OR anything (or vice versa) is still '1'. This line also demonstrates commutativity of addition (the OR function).

$(1.x) = (1 AND x) = (x.1) = (x AND 1) = x$. A '1' AND anything (or vice versa) depends wholly on x, as you can see from the truth table for AND. This line also demonstrates commutativity of multiplication (the AND function).

OK, so back to the problem. The first line uses the distributive law over multiplication (AND), which you already seem to know. It is used again in regrouping terms.

$$(\bar{ab}+c).c = \bar{ab}c + c.c = \bar{ab}c + c = (\bar{ab}+1).c = 1.c = c$$

See how easy that was?

As a final note, please don't get confused between binary number addition and the Boolean OR, and binary number multplication and the Boolean AND. As an exercise you may want to work out the other simple rules in Boolean Algebra, (the ones for 0.x, 0 + x, and maybe inspect the slight complexities of the XOR function, and culminating in doing your own proof of De Morgan's Laws).

 

[Femme_physics]

Thanks Curious! We actually only studied Boolean Algebra yesterday! I know how to tackle it all now :) if I'll run into any problems I'll post back. Thanks everyone :)

 

[Femme_physics]

This is the original problem I was trying to minimize its function...did I get it right?

http://img221.imageshack.us/img221/4978/solutionmpa.jpg

 

[cupid.callin]

This might help:

OR is like a parallel connection in circuit (where 1 means key closed and 0 means key open)... Thus for x+1 whatever be x, current always flow and thus its 1

and for AND ... its like series, thus 1ANDx means only x because even if 1 is always closed, current flow depends on x

 

[cupid.callin]

This is the original problem I was trying to minimize its function...did I get it right?

http://img221.imageshack.us/img221/4978/solutionmpa.jpg

Check 6) line

 

[Curious3141]

This is the original problem I was trying to minimize its function...did I get it right?

http://img221.imageshack.us/img221/4978/solutionmpa.jpg

Your final answer is $\overline{c}$? Afraid that's not right.

I get the final answer as $\overline{c}(\overline{a} + \overline{b})$ with no further reduction possible, since the output is equally dependent on the three inputs. The reduction involved one application of De Morgan's Law.

In the output of the inverter (NOT gate) Z, the double-negation of (ab) simply gives ab. So just write $ab$ as one of the inputs to the NOR gate P rather than $\overline{\overline{ab}}$, which is unnecessarily cumbersome.

Also, check the way you wrote down the output of the NOR gate P. The unsimplified output (I'm leaving your double-negation notation intact here) will look like:

$$\overline{\overline{\overline{ab}}+(\overline{ab}c+cc)}$$

which is *not* the same as what you wrote. Remember that, in general, $\overline{a + b} \neq \overline{a} + \overline{b}$. Negation does not distribute that way over OR or AND. In fact, this is why you need De Morgan's Law to "break up" this sort of "whole negation".

Please *carefully* recheck your truth table as well. It's wrong in quite a few rows.

 

[cupid.callin]

I get the final answer as $\overline{c}(\overline{a} + \overline{b})$

You got this as equivalent for F_out
But I'm getting $\overline{abc}$

 

[ehild]

You got this as equivalent for F_out
But I'm getting $\overline{abc}$

It is wrong, remember de Morgan's Laws. Curious' result is right. ehild

 

[Femme_physics]

Check 6) line

I still don't get what is wrong about my truthtable.

The way I understand,

0 + 0 + 0 = 0
0 + 0 + 1 = 1
0 + 1 + 1 = 1
1 + 1 + 1 = 1

Where is my mistake exactly?

 

[I like Serena]

I still don't get what is wrong about my truthtable.

The way I understand,

0 + 0 + 0 = 0
0 + 0 + 1 = 1
0 + 1 + 1 = 1
1 + 1 + 1 = 1

Where is my mistake exactly?

What you write here are correct equations.

If we zoom in on your line 6, you have for instance:

a=1, b=1, c=0

In your table you should have:
$$\overline {\overline {ab}c} = \overline {\overline {11}0} = \overline {00} = 1$$
but this is not the result you have in your table.

Anyway, the actual complete expression should be:

$$\overline{\overline{\overline{ab}}+(\overline{ab}c + cc)}
= \overline{\overline{\overline{11}}+(\overline{11}0 + 00)}
= \overline{1+(00+0)}
= \overline{1}
= 0$$


Btw, best wishes for 2012!

 

[Femme_physics]

Well, fine, I redid 6 and also got "1". However, now everything in my Karnaugh Map equals 1 which means the result is 0 because they all cancel each other out!

http://img831.imageshack.us/img831/9793/abceh.jpg Best wishes for 2012, Klass

 

[I like Serena]

How did you get $\overline { \overline{ab}c } = \overline{ab} \cdot \overline{abc}$?

 

[Femme_physics]

How did you get $\overline { \overline{ab}c } = \overline{ab} \cdot \overline{abc}$?

Isn't that the definition of $\overline { \overline{ab}c }$ ?