Threshold Logic Circuits
Collection
Boolean gates, voting functions, modular arithmetic, and adders as threshold networks. • 269 items • Updated • 2
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
- Shift dividend left, subtract divisor
- If result negative: quotient bit = 0, restore (add back)
- If result non-negative: quotient bit = 1
- Repeat for each quotient bit
Parameters
| Inputs | 6 |
| Outputs | 6 |
| Neurons | 12 |
| Layers | 4 |
| Parameters | 84 |
| Magnitude | 96 |
License
MIT
- Downloads last month
- 3
Inference Providers NEW
This model isn't deployed by any Inference Provider. 🙋 Ask for provider support