(C) David Vajda Klassisches Schaltwerk - binär und unär kodiert 2024-11-30 b a x b a y 0 0 0 0 1 1 0 1 0 0 1 1 0 0 2 0 1 0 0 0 0 3 0 1 1 1 1 1 4 1 0 0 0 0 1 5 1 0 1 1 0 0 6 1 1 0 1 1 1 7 1 1 1 0 0 1 b a x b 0 0 0 0 1 1 0 0 1 1 2 0 1 0 0 3 0 1 1 1 4 1 0 0 0 5 1 0 1 1 6 1 1 0 1 7 1 1 1 0 b a x a 0 0 0 0 1 1 0 0 1 0 2 0 1 0 0 3 0 1 1 1 4 1 0 0 0 5 1 0 1 0 6 1 1 0 1 7 1 1 1 0 b a x y 0 0 0 0 0 1 0 0 1 0 2 0 1 0 0 3 0 1 1 1 4 1 0 0 1 5 1 0 1 0 6 1 1 0 1 7 1 1 1 1 b a x b 0 0 0 0 1 1 0 0 1 1 3 0 1 1 1 5 1 0 1 1 6 1 1 0 1 b a x a 0 0 0 0 1 3 0 1 1 1 6 1 1 0 1 b a x y 3 0 1 1 1 4 1 0 0 1 6 1 1 0 1 7 1 1 1 1 b a x b Gruppe 0: 0 0 0 0 1 Gruppe 1: 1 0 0 1 1 Gruppe 2: 3 0 1 1 1 5 1 0 1 1 6 1 1 0 1 b a x a Gruppe 0: 0 0 0 0 1 Gruppe 2: 3 0 1 1 1 6 1 1 0 1 b a x y Gruppe 1: 4 1 0 0 1 Gruppe 2: 3 0 1 1 1 6 1 1 0 1 Gruppe 3: 7 1 1 1 1 b a x b Gruppe 0: 0 0 0 0 1 Gruppe 1: 1 0 0 1 1 Gruppe 2: 3 0 1 1 1 5 1 0 1 1 6 1 1 0 1 0:1 0 0 - 1:3 0 - 1 1:5 - 0 1 6 1 1 0 b <= (not b and not a) or (not b and x) or (not a and x) or (b and a and x); b a x a Gruppe 0: 0 0 0 0 1 Gruppe 2: 3 0 1 1 1 6 1 1 0 1 a <= (not b and not a and not x) or (not b and a and x) or (b and a and not x); b a x y Gruppe 1: 4 1 0 0 1 Gruppe 2: 3 0 1 1 1 6 1 1 0 1 Gruppe 3: 7 1 1 1 1 4:6 1 - 0 3:7 - 1 1 6:7 1 1 - 3 4 6 7 4:6 + + 3:7 + + 6:7 + + 4:6 1 - 0 3:7 - 1 1 y <= (b and not x) or (a and x); b <= (not b and not a) or (not b and x) or (not a and x) or (b and a and x); a <= (not b and not a and not x) or (not b and a and x) or (b and a and not x); y <= (b and not x) or (a and x); b a x b a y 0 0 0 0 1 1 0 1 0 0 1 1 0 0 2 0 1 0 0 0 0 3 0 1 1 1 1 1 4 1 0 0 0 0 1 5 1 0 1 1 0 0 6 1 1 0 1 1 1 7 1 1 1 0 0 1 unär kodiert Zustand Eingabe Ausgabe Folgezustand CodeFolgezustand z3+ z2+ z1+ z0+ z0 0 0 z3 1 0 0 0 z0 1 0 z2 0 1 0 0 z1 0 0 z0 0 0 0 1 z1 1 1 z3 1 0 0 0 z2 0 1 z0 0 0 0 1 z2 1 0 z2 0 1 0 0 z3 0 1 z3 1 0 0 0 z3 1 1 z3 1 0 0 0 z0+ <= z0 and not x or z1 and x or z3 z1+ <= z1 and not x or z2 not x z2+ <= z0 and x or z2 and x y <= (z1 and x) or (z2 and not x) or z3