Electrical – How to simply this 2 to 1 mux boolean expression

boolean-algebramux

I am going through this tutorial for a 2 to 1 mux.
They create this circuit:

They then derive this boolean algebra expression and simplification:

I'm confused how they made the simplification though. I see that the expression can be simplified to \$I_0*I_1 * (\overline{A} + A)\$ by simplifying the double negatives, but I don't see how they got any farther than that

Best Answer

I use a slightly different notation/symbols to denote it easier:

a = not A
A = A
b = not I1
B = I1
c = not I0
C = I0

Q = aBc + aBC + AbC + ABC   
  = aB(c + C) + AC(b + B)     // c + C = true, aB(true) = aB
                              // b + B = true, AC(true) = AC
  = aB        + AC

Written back in original symbols:

Q = aB + AC = not(A) * I1 + A * I0

Related Solutions

Boolean expression to NOR gate (MUX)

A=input 1, B=input 2, S=switch
from A create A' (nor port with 2 times A as input)
from B create B' (nor port with 2 times B as input)
from S create S' (nor port with 2 times S as input)
create X=(S+A')' (nor port with A' as input and S as input)
create Y=(S'+B')' (nor port with B' as input and S' as input)
create Z=(X+Y)'=((S+A')'+(S'+B')')'
create W=Z' (nor port with 2 times Z as input)
then W=(((S+A')'+(S'+B')')')'=((S'.A)+(S.B))''=S'.A+S.B

Electronic – Build AND logic gate with 74’00 ICs (NAND) in negative logic

In positive true logic, an AND can be described by "all ones make a one".

The same circuit, in negative true logic, can be described by "any zero makes a zero.", which is an OR.

So, a positive true AND is exactly equivalent to a negative true OR.

In the same vein, a positive true NAND (all ones make a zero) becomes "any zero makes a one", a positive true OR (any one makes a one) becomes "all zeroes make a zero" and a positive true NOR (any one makes a zero) becomes "all zeroes make a one"

UPDATE:

The difference between positive true and negative true logic is in their different symbologies and in the way logic circuits are thought about, used, and presented.

The following graphic shows the four basic logic gates: the AND, the NAND, the OR, and the NOR in both their conventional and negative true garb, along with the truth table for each gate. It's important to note that the truth table is the same for the positive and negative true symbols, and that both symbols represent the same thing in hardware. For example, the AND pair could be for an HC08, the NAND pair for an HC00, the OR pair for an HC32, and the NOR pair for an HC02.

Now for the cool part... :)

Take a look at the positive true AND symbol and you'll notice that its inputs, A and B terminate into a straight line and that its output, Y, comes out of a semicircle. The semicircle doesn't mean much of anything, but the straight line means that the output will only go true when both inputs (since neither is a bubble) are ones, which is when A \$ \style{color:red;font-size:100%}{AND}\$ B are both ones.

But what about when A and B aren't both ones,?

Then we have a situation where if one, or the other, or both of the inputs are low, the output will also be low, which is a logical OR when looked at from the point of view of lows on the inputs.

Voila! negative true logic is born!.

The symbol to the right of the positive true AND has a curvy input, which indicates "any", so if any of its inputs is low its output will be low as well.

The bubbles indicate logical zeroes.

So why should we muck about with this when its just as easy to use positive true logic symbology?

Strangely enough, to reduce confusion.

My favorite example is an RS NAND latch where the gates are depicted as positive true and yet need low-going signals to switch.

Befuddling to many a cadet, I think.

Best Answer

Related Solutions

Boolean expression to NOR gate (MUX)

Electronic – Build AND logic gate with 74’00 ICs (NAND) in negative logic

Related Topic