跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.19944 · v1

Exhaustive Evaluation of Fixed-Point Reciprocal Architectures for FPGAs

首次提交 2026-11-15 19:32
版本更新 2026-11-15 19:32
雷达观测 2026-11-17 12:06
arXiv ↗PDF ↗

摘要

Fixed-point reciprocals are used in normalization and division on field-programmable gate arrays (FPGAs). Designs that share an output format can differ in worst-case error and in their need for memory and multipliers. The effect of table width, internal precision and refinement was evaluated for reciprocal computation in the Q16.16 and Q8.24 formats. Every representable input in the interval from 0.5 to 2.5 was tested against an exact integer reference. Five arithmetic paths were reconstructed from register-transfer-level source. Guarded interpolation, Newton-Raphson refinement and residual correction were then evaluated alongside polynomial and digit-recurrence baselines. Correct rounding was verified for all 131,073 Q16.16 and 33,554,433 Q8.24 inputs by adding one residual check to a guarded interpolated seed and one refinement step. An implementation with product reuse was verified at one input per cycle with a latency of 10 cycles in both formats. The Q8.24 implementation used nine digital signal processing slices in 7 series synthesis. The exact radix-2 control used no such slices and had a latency of 28 cycles. The reconstructed refined paths reduced the maximum relative error by factors of 205 to 223 when eight fractional bits were added. The evaluated designs provide reproducible choices for fixed accuracy budgets. In particular, correct rounding can be obtained on the tested interval by using a compact seed and checking the integer residual before the result is returned.

作者备注:27 pages, 11 figures

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-15 19:32 · 最新观测版本

Exhaustive Evaluation of Fixed-Point Reciprocal Architectures for FPGAs

Fixed-point reciprocals are used in normalization and division on field-programmable gate arrays (FPGAs). Designs that share an output format can differ in worst-case error and in their need for memory and multipliers. The effect of table width, internal precision and refinement was evaluated for reciprocal computation in the Q16.16 and Q8.24 formats. Every representable input in the interval from 0.5 to 2.5 was tested against an exact integer reference. Five arithmetic paths were reconstructed from register-transfer-level source. Guarded interpolation, Newton-Raphson refinement and residual correction were then evaluated alongside polynomial and digit-recurrence baselines. Correct rounding was verified for all 131,073 Q16.16 and 33,554,433 Q8.24 inputs by adding one residual check to a guarded interpolated seed and one refinement step. An implementation with product reuse was verified at one input per cycle with a latency of 10 cycles in both formats. The Q8.24 implementation used nine digital signal processing slices in 7 series synthesis. The exact radix-2 control used no such slices and had a latency of 28 cycles. The reconstructed refined paths reduced the maximum relative error by factors of 205 to 223 when eight fractional bits were added. The evaluated designs provide reproducible choices for fixed accuracy budgets. In particular, correct rounding can be obtained on the tested interval by using a compact seed and checking the integer residual before the result is returned.

查看此版本解读 →查看此版本原文 ↗