Views
No views yet
A[3:0] ──┐
├──► Sat Add ──┬──► S[3:0] (result)
B[3:0] ──┘ └──► saturated (overflow flag)| A + B | Result | Saturated |
|---|---|---|
| ≤ 15 | A + B | 0 |
| > 15 | 15 | 1 |
7 + 5 = 12, saturated=0
10 + 10 = 15, saturated=1 (true sum: 20)
15 + 15 = 15, saturated=1 (true sum: 30)
8 + 7 = 15, saturated=0
8 + 8 = 15, saturated=1 (true sum: 16)Wrapping: 15 + 1 = 0 (modulo 16)
Saturating: 15 + 1 = 15 (clamped)| Component | Count | Neurons |
|---|---|---|
| Full Adders | 4 | 28 |
| Saturation MUXes | 4 | 12 |
1. Compute A + B with standard 4-bit adder
2. If carry out = 1:
- Output 1111 (15)
- Set saturated = 1
3. Else:
- Output sum bits
- Set saturated = 01from safetensors.torch import load_file
2
3w = load_file('model.safetensors')
4
5# All 256 test cases verified
6# Saturates 120 cases (where A+B > 15)threshold-saturating-adder/
├── model.safetensors
├── create_safetensors.py
├── config.json
└── README.md