Reliable arithmetic circuits using less reliable (sub-digital) logic
The frequent static failure of CMOS logic gates at ultra-low voltages has historically been perceived as a strict barrier to extreme voltage scaling: this paper introduces a statistical circuit law proving this intuition wrong. We discovered a universal power law connecting gate and circuit static failure probabilities, revealing that circuit failure requires the simultaneous breakdown of an entire gate cluster rather than a single component. Because the required cluster size increases rapidly as voltage drops, low-voltage \textit{sub-digital} logic exhibits surprising inherent resilience to static failure. This insight stems from new theoretical tools we developed to quantify static failure, extending well beyond conventional voltage-margin analysis. Consequently, sub-digital processors could potentially offer a viable, near-term solution to drastically reduce the energy demands of AI.
Authors
- Neil Gershenfeld (ORCID: https://orcid.org/0000-0001-8470-5777)
- Ila Fiete (ORCID: https://orcid.org/0000-0003-4738-2539)
- Trevor McCourt (ORCID: https://orcid.org/0000-0002-5807-2600)
- Isaac L. Chuang (ORCID: https://orcid.org/0000-0001-7296-523X)
Publication Details
- Journal
- arXiv (Cornell University)
- Published
- 2026-11-18
- DOI
- https://doi.org/10.48550/arxiv.2611.24591
- Primary Topic
- Low-power high-performance VLSI design
- Type
- preprint