threshold-restoring-divider

4-bit by 2-bit restoring divider. Computes quotient and remainder.

Circuit

Inputs: N[3:0] (dividend), D[1:0] (divisor)
Outputs: Q[3:0] (quotient), R[1:0] (remainder)

N = Q × D + R, where 0 ≤ R < D

Restoring Algorithm

1. Shift dividend left, subtract divisor
2. If result negative: quotient bit = 0, restore (add back)
3. If result non-negative: quotient bit = 1
4. Repeat for each quotient bit

Parameters

Inputs	6
Outputs	6
Neurons	12
Layers	4
Parameters	84
Magnitude	96

License

MIT