threshold-nonrestoring-divider

4-bit by 2-bit non-restoring divider. Avoids restore step.

Circuit

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

Non-Restoring Algorithm

1. If partial remainder positive: subtract divisor, Q bit = 1
2. If partial remainder negative: add divisor, Q bit = 0
3. Final correction if remainder negative

Faster than restoring division (no conditional restore).

Parameters

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

License

MIT