The following are key logic microoperations that can be performed on two binary variables (x and y):
| x | y | F0 | F1 | F2 | F3 | F4 | F5 | F6 | F7 | F8 | F9 | F10 | F11 | F12 | F13 | F14 | F15 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
| 0 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 1 |
| 1 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 1 | 0 | 0 | 1 | 1 |
| 1 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 1 |
Logic microoperations are implemented using logic gates combined with multiplexers. A one-stage logic circuit can generate four basic operations using a 4x1 multiplexer.
Sets bits in register A to '1' where corresponding bits in register B are '1'.
Formula: A ← A ∨ B
Clears bits in register A where corresponding bits in register B are '1'.
Formula: A ← A ∧ B
Complements bits in register A where corresponding bits in register B are '1'.
Formula: A ← A ⊕ B
Clears bits in register A where corresponding bits in register B are '0', isolating specific bit groups.
Formula: A ← A ∧ B
Inserts a new value into specific bit positions using a two-step process: mask to clear, then OR to insert.
Compares two numbers and produces all '0's if they are equal using XOR operation.
Formula: A ← A ⊕ B