AXELRAM: Quantize Once, Never Dequantize

We propose AXELRAM, a smart SRAM macro architecture that computes attention scores directly from quantized KV cache indices without dequantization. The key enabler is a design-time fixed codebook: orthogonal-transform-based quantization concentrates each coordinate's distribution to N(0,1/d), so the optimal quantizer depends only on dimension d and bit-width b, not on input data. The asymmetric path design -- transform on write, table-lookup on read with no inverse transform -- reduces per-query multiplications by 102.4x (a mathematical identity). Through multi-seed evaluation (10 seeds x 3 models), we discover that sign pattern sensitivity causes catastrophic PPL spikes (Delta>50) on certain models (Qwen2.5-3B), while others (LLaMA-3.1-8B) are fully stable. This phenomenon extends SpinQuant's observation of rotation variance in weight quantization to the KV cache domain, where the effect is qualitatively more severe. We trace the root cause to layer-wise norm heterogeneity and propose a gradient-free sign pattern selection (200 candidates, 8 calibration samples, one-time) that eliminates catastrophic spikes with zero additional hardware cost. All source code is available at https://github.com/Axelidea/AXELRAM.

Paper

References (19)

10, a smart SRAM macro with an asymmetric write/read path that reduces multiplications by 102 . 4 × (Section III)
11We discover sign pattern sensitivity in rotation-based KV cache quantization through 10-seed evaluation across 3 models, finding catastrophic spikes ( ∆ > 50 )prior work (Section IV)
12Pre-compute table: P [ i ][ j ] = q rot ,i × c j for i =0 , . . . , d − 1 , j =0 , . . . , 2 b − 1 ( d × 2 b multiplications, once per query)

Scroll for more · 7 remaining

Similar papers

© 2026 NYSGPT2525 LLC