The Sibacus datapath eliminates every transcendental function from the inference pipeline. exp(), erf(), sigmoid(), tanh(), and division are all replaced by shifts, adds, and comparisons — hardware that maps to any CMOS node.
The GELU curve is split into P = 16 linear segments. For each input x, a comparator selects the matching segment, then the output is computed as:
GELU(x) ≈ slope_r × x + offset_k
The key insight: each slope_r is constrained to be a power of two during training, so the multiplication becomes a single BSA shift.
Unlike LUT-based approaches that store thousands of entries, PwL needs only 16 slope + 16 offset values — stored in tiny registers. The computation is a shift, an add, and a comparator. Nothing else.
| Range | Slope | Shift | Offset |
|---|
The entire Sibacus inference datapath is built from barrel shifters, integer adders, and comparators — primitive logic that maps cleanly to any CMOS process node. This is not a simplification. It's the complete datapath. CRI softmax and PwL activations together guarantee that no transcendental function evaluation hardware exists anywhere in the chip.