Threshold Logic Circuits
Collection
Boolean gates, voting functions, modular arithmetic, and adders as threshold networks.
•
248 items
•
Updated
•
1
threshold-srt-divider
4-bit by 2-bit SRT divider. Uses redundant quotient digits.
Circuit
Inputs: N[3:0] (dividend), D[1:0] (divisor)
Outputs: Q[3:0] (quotient), R[1:0] (remainder)
SRT Algorithm
SRT (Sweeney, Robertson, Tocher) uses redundant digit set {-1, 0, +1}:
- Allows imprecise comparisons (simpler hardware)
- Quotient converted to standard form at end
- Used in high-performance FPUs (including Pentium FDIV bug)
Parameters
| Inputs | 6 |
| Outputs | 6 |
| Neurons | 12 |
| Layers | 4 |
| Parameters | 84 |
| Magnitude | 96 |
License
MIT
- Downloads last month
- 9
Inference Providers
NEW
This model isn't deployed by any Inference Provider.
🙋
Ask for provider support