state machines , boolean equations , k-maps

Channel:
Subscribers:
146
Published on ● Video Link: https://www.youtube.com/watch?v=nU7SUzHvBdM



Duration: 1:01
182 views
0


Boolean equations compared to k-map simplifications
glitch\spike\hazards , how to avoid combinational logic spikes .

just ok I think . could be better .

to implement XOR , EOR , exclusive OR for a lamp .
we need 2 SPDT ( single pole double throw ) switches .
Called Switch A , switch B .
for SW A , label each Contact A .....NOT A
for SW B , label each Contact B .... NOT B .
place both switches on the Ground side of the lamp .
Both sets of contacts should face each other .
The Pole of SW A is to ground .
The Pole of B connects to the ground side of the Lamp .
Wire contact A to contact NOT B .
Wire contact NOT A to contact B

we manually toggle the switches to complete the functionality .

Draw it up on paper . should be obvious it implements the XOR function NOTA.B + A.NOTB .

a connective to Logic for using relays can be made too .

we can implement combinational logic with
mechanical switches and relays .







Tags:
k-map
state machine
boolean algebra
3 way switch
XOR
EOR
exclusive OR