Skip to content

Optimized 64-Bit Double-Precision FMA with Robust Exception Handling

Aug 2026 · International Journal of Computing Algorithm · Vol 15, pp. 21 · 0 citations · 2 references

TL;DR

An optimized 64-bit fused multiply-add architecture that combines multiplication and addition into one operation, which cuts down on rounding errors and overall error and is a strong and flexible solution for high-performance computing applications is proposed.

Abstract

As scientific computing moves closer to exascale performance, it has become more and more important to get high numerical accuracy and computational efficiency in floating-point op-erations. For big simulations, data analysis, and scientific modelling, high-precision arithmetic is necessary because small rounding errors can spread and make results less reliable. This work pre-sents an optimized 64-bit fused multiply-add (FMA) architecture that combines multiplication and addition into one operation, which cuts down on rounding errors and overall error. The design in-cludes fast exponent processing, precise operand alignment, and simplified normalization to make sure that double-precision calculations are accurate and faster. The architecture not only improves performance, but it also handles all kinds of unusual floating-point conditions, such as nan, infini-ty, zero, overflow, underflow, and subnormal numbers, before doing the main arithmetic opera-tion. To make the system more energy efficient, an operand isolation technique is built into the design to cut down on unnecessary switching activity. This lowers dynamic power use without affecting numerical accuracy. Verilog HDL is used to describe the architecture, and functional software simulations are used to check that it follows IEEE-754 double-precision rules and han-dles exceptions correctly. The evaluation results show that the fused implementation increases nu-merical accuracy and computational efficiency while using less power than traditional non-fused designs. In general, the proposed FMA unit is a strong and flexible solution for high-performance computing applications.

View source

Similar papers

Aug 2026

Branch-Free Binary128 Multiplication: SRMA Implementation with SSE2 Instructions and Kintex-7 Validation

This research presents an optimized, reduced-clock-cycle approach for performing 128-bit floating-point calculations on Field-Programmable Gate Arrays (FPGAs) using the SRMA architecture, which not only reduces execution time but also decreases energy consumption on Kintex-7 FPGA boards.

N. P, Thirumalaiswamy V., H. S. et al. · 0 citations
Preprint Sep 2026

A performance enhancement of the Payne-Hanek range reduction algorithm

Range reduction plays a crucial role in the accuracy and performance of evaluating trigonometric functions, and is often the primary bottleneck for large floating-point inputs. While fast algorithms such as Cody--Waite work efficiently over narrow intervals, the Payne--Hanek algorithm remains the standard technique for...

Tue Ly · 1 citation
Preprint Sep 2026

High-frequency Multispeculative Multiply-Accumulation Unit for Fused Posit Arithmetic

Posit arithmetic offers a compelling alternative to the IEEE 754 floating-point standard, providing enhanced accuracy. Its fused multiply-accumulate operations avoid intermediate rounding, ensuring exact numerical reproducibility through the quire, a wide fixed-point accumulator spanning the format's full dynamic range...

Mario Alonso, Miguel A. Sacristán, G. Botella et al. · 0 citations
Preprint Oct 2026

TOMOS: Eliminating Data Duplication in Mixed-Precision Matrix Computations

Mixed-precision algorithms exploit reduced-precision hardware, however computing with the same matrix at distinct precisions typically requires duplicate storage, repeated conversions, or operation-emulation. We introduce TOMOS, a composite-precision matrix format that provides implicit 32-bit and 16-bit access from a...

V. Georgiou, P. Drineas · 0 citations
Open access Aug 2026

Fast and accurate algorithms for matrix multiplication using fused multiply-add and their rounding error analysis

We propose a numerical algorithm for accurate matrix multiplication. When standard floating-point arithmetic fails to deliver sufficient accuracy, high-precision techniques such as pair arithmetic and double-word arithmetic are typically employed, although at the expense of considerable computational cost. The proposed...

Katsuhisa Ozaki, Toru Koizumi · 0 citations
Preprint Oct 2026

When Double Rounding is Correct

Number libraries, which implement number formats and their arithmetic in software, are used to simulate hardware, making hardware behavior reproducible and thus verifiable and easier to design. However, modern machine learning accelerators are difficult to simulate, as they increasingly use specialized number formats t...

Brett Saiki, Bill Zorn, C. Richey et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.