Closing the Gap Between Float and Posit Hardware Efficiency
Aditya Anirudh Jonnalagadda, Rishi Thotli, John L. Gustafson

TL;DR
This paper introduces b-posit, a simplified and hardware-efficient variant of the posit format, achieving better performance and scalability than standard posits and IEEE floats for high-precision computing.
Contribution
The paper presents a novel b-posit design that reduces complexity and power consumption while maintaining high dynamic range and accuracy, outperforming standard posit hardware at higher precisions.
Findings
79% less power consumption in 32-bit decoder
71% smaller area for 32-bit decoder
Superior scalability at higher bit widths
Abstract
The b-posit, or bounded posit, is a variation of the posit format designed for high performance computing (HPC) and AI applications. Unlike traditional floating-point formats (floats), posits use variable-length fields for exponent scaling and significand, providing better efficiency for the same bit width. However, this flexibility introduces high worst-case overhead in decode-encode logic, exceeding the cost of handling subnormals for floats. To address this, the b-posit restricts the regime field to a 6-bit limit, reducing variability in regime and fraction sizes. With an exponent size eS of 5 bits, the dynamic range is to (about to ) and the quire size is 800 bits, for any precision . This constraint improves numerical properties and simplifies hardware implementation by allowing decode-encode operations with basic multiplexers. Our…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNumerical Methods and Algorithms · Cryptography and Residue Arithmetic · Polynomial and algebraic computation
