The issue is I don't know how to do that, then it would be easy,
in really basic Boolean algebra I guess it would be something like:
ab+ac+ad+ae+af+bc+bd....
until you have every combination until it would literally mean any combo of two makes x = 1.
I thought it might be easier to make a series of gates which become true/false in certain conditions until I have a unique combinations of 1's and 0's which I can use to make x = 1.
Isaiah Price
1. make a table with the inputs on one side and the desired outputs on the outer side 2. figure out the gate(s) that produce the desired outputs.
This is why I was wondering if its possible to make a circuit with gates that output 1's or 0's based on certain conditions, for example:
get a 1 or 0 depending on if all or on/off get a 1 or 0 depending on if there is an even or odd number get a 1 or 0 dependent if there is one witch left one or off
basically create condition where the series of outputs narrow down the properties of the number 2.
Alexander Edwards
good luck op i'm not autistic enough to finish this.
You can see the obvious pattern here where you use the same amount of NOTs to the amount of switches you want.
Caleb Bell
just need to express this using universal gates now, not basics.
Nolan Smith
>XORing for orange You're doing it wrong. XOR gives you parity/oddness, not "all but one".
>what's an efficient way to do this? Eyeballing it would be easier than K-maps. Let *=And, +=Or, ⊕=Xor
Red = F1*F2*F3*F4*F5*F6
Orange = F1*F2*F3*F4*(F5⊕F6) + F1*F2*(F3⊕F4)*F5*F6 + (F1⊕F2)*F3*F4*F5*F6 The missing one must be 5 xor 6 or 3 xor 4 or 1 xor 2
Yellow=F1*F2*((F3⊕F4)*(F5⊕F6) + (F3⊕F5)*(F4⊕F6)) + (F1⊕F2)*(F3*F4*(F5⊕F6) + (F3⊕F4)*F5*F6) + Not(F1)*Not(F2)*F3*F4*F5*F6 You have both F1 and F2 and you want 2 of the others OR you have but one of them and you need 3 of the others OR you have neither of them and all the others. Still better than the 15 terms needed to brute force it.
White=(F1⊕F2)*(F3⊕F4)*(F5⊕F6) + (F1⊕F3)*(F2⊕F4)*(F5⊕F6) + (F1⊕F5)*(F3⊕F4)*(F2⊕F6) + (F1⊕F2)*(F5⊕F4)*(F3⊕F6) You could add more terms but they're redundant. Vastly better than the 20 terms needed to brute force it.
Or just add them with 2 1bit adders (with carry in's) and then to a 2bit adder
Then go look up a Boolean algebra course. There'll be something you can do for free or watch some YouTube vids. If you care about getting good at this be vigorous. Learn it properly.
Jordan Ortiz
They claim to be white.
Logan Murphy
Make a truth table and then a kmap
Ryan Perez
CpE
Juan Carter
>Hey guys I'm trying to get good at using gates without using basic gates (AND, OR, NOT). Might as well go down to transistors. You are building AND,OR,NOT anyway.
Brandon White
What's the best free software for circuit simulation?
Camden Collins
lmao dude just use if else if else if else if else if
Dylan Garcia
depends on the complexity of the circuit and the level of depth you need. I used some free *spice program for simple circuits, I don't remember which one, and I used microwind if I had to go deeper and design the ports themselves or other components at a physical level.
Caleb Turner
VHDL H D L
Cameron Morgan
Kmaps suck for "exactly n out of m bits", you will end up with the OR of all n choose m combinations containing all the variables or their negation ANDed together.