Now, let us continue with another example, assume that you are trying to design something and this
is that you are stable.
You have assumed that you have three inputs and you have one output.
And these combinations is what you are looking for.
If input two is one, you want your output to be one.
Also, when your input one is one, you want the output to be one.
Again, when all the inputs are one, you want the output to be one, so you have three cases where
you output is conducting and resulting in one.
So you have your table and you wrote your logic.
Now all you need to do is fill up with all the possibilities.
So these represent all the combinations for three inputs, right?
I mean, you have three and you have three inputs.
So in order to get all the combinations in binary, you need to say to the power three, meaning two
to the power, a number of inputs and you will get the number of combinations.
So two to the power of three is eight.
So here we have one, two, three, four, five, six, seven, eight.
And this is the possibilities you have.
And then you have figured out that, OK, you have three of these cases where output is one.
So what do you do?
You create an or gate with the number of cases where you have an output of one.
So this is my.
All right here.
And I have three cases.
Right?
Right.
So I will have Aldgate with one, two, three inputs.
See, we starting from the end and we're going to build up to the beginning where the inputs are next.
See these inputs?
One, two, three.
All of these are and gates.
All right.
Because you're saying here that you have three options on each of them is going to give you a one.
And when you say the word any of them, you're talking about an object right now.
When you take the combination, you're saying, I want input one and input two and input three to be
at a certain state.
This is why you need an end gates right here.
You need three of them, right?
One for this one.
One for this one and one for this case.
Next, you're going to identify where you need not gates.
Now, whenever you see a zero, you're just going to put another gate, right?
So in our case right here, we have to not get in the second case, so this is one this is due in the
second case, we also have to not get to because we have two zeros.
So we have one here and one here.
In the last case, we have not zero.
So we have no nut case, none of them.
So let us start wiring the first case.
I want input zero to be zero and but want to be one and input three to be zero.
Now what we're going to do is we're going to have input.
One, two, three.
Just put like that vertically and then we're going to distribute this three inputs to all these gates
because all we have is the three inputs and then they are distributing to these gates.
So first, we are distributing this to the first case, zero one zero.
So this input is going to this not great input one, because it's a zero input, two is one.
So we are taking it directly to the gate.
Input three is zero.
So we are taking it to the Senate gate right now.
Let us continue the second case.
The second case is saying that one is one.
So let us take this is input one.
We are going down all the way to this and Gate C. It's connected directly to the input of the gate.
Now, input two is zero, so we need to connect it to another gate.
Right.
So this is input to we are going all the way down and then it's distributing here at the north gate.
That's great.
And then input three is zero.
This is input three.
You'll follow it along.
You got your input right here.
It's going to distribute another gate and that's it.
Next, we have input.
One, two, three.
All of them are what's right.
So we have no gates here.
So this is input.
One, two, three.
As you can see, they are going directly to this gate.
Now we complete we can connect the not gates directly to the end gates like that.
And then the outputs of all of this and gates will go to the gates, and this is our logic.
So to sum it up one more time, really quickly, first you identify where all your once at the output.
We have three ones, meaning we have three options.
Either of them would give me a one.
Either of them means and Aldgate next.
We check what kind of combination is going to give each of these ones, these kind of combinations are
engaged.
So I have one option, two or three options or three.
And now we check case by case.
We have whenever we see zero, we are going to put a Newdegate at the input.
So we have one, two for the first case, one, two for the next case and the last case, we have nothing.
Then we just interconnect them all together and that's it.
And like that, we have designed a circuit that can conduct this logic.
Now, there are more techniques in order to reduce the number of logic.
But right now we're keeping stuff simple.
And I just want you to get an intuition on how logic can be designed with circuits.
Now, of course, if you wanted to, you can change all of these knots and adds to switches.
Right.
If you change them to switches, as we have learned before, well, you will have the same logic.
It is as simple as that.