A Hybrid Residue Floating Numerical Architecture with Formal Error Bounds for High Throughput FPGA Computation
Mostafa Darvishi

TL;DR
The paper introduces HRFNA, a novel hybrid residue floating point architecture for FPGAs that offers high throughput, predictable error bounds, and improved efficiency over traditional IEEE 754 FP32, suitable for scientific computing.
Contribution
It presents a formally defined hybrid residue floating point system with a complete FPGA microarchitecture, demonstrating significant performance and efficiency gains with bounded numerical errors.
Findings
Up to 2.4x higher throughput compared to FP32
38-55% LUT reduction
Up to 1.9x energy efficiency improvement
Abstract
Floating point arithmetic is costly on FPGA platforms due to wide datapaths, normalization, and carry propagation, motivating alternative numerical representations that improve throughput and efficiency. This paper presents the Hybrid Residue Floating Numerical Architecture (HRFNA), a fully specified numerical system that combines carry-free residue arithmetic with lightweight exponent-based scaling to achieve wide dynamic range, predictable error behavior, and efficient FPGA implementation. HRFNA is developed with a rigorous mathematical foundation: the hybrid number space is formally defined, correctness of arithmetic and normalization is proven, and explicit absolute and relative error bounds are derived, confining rounding to infrequent normalization events. A complete FPGA microarchitecture is presented, featuring deeply pipelined modular arithmetic, exponent management, and a…
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
