Evaluating Monotonic Functions using Binary Search
ACM Transactions on Reconfigurable Technology and Systems · 19.08.2026
DOI: 10.1145/3838192 ↗Kurz gefasst
Fachartikel in der Zeitschrift ACM Transactions on Reconfigurable Technology and Systems, online erschienen am 19.08.2026. Verfasst von Pierrick Joseph und 2 weiteren Autor:innen. Die Arbeit nennt 44 Literaturangaben.
Abstract (Originalsprache)
This work addresses the accurate (correctly rounded) evaluation of arbitrary functions. The simplest solution is to use a Look-Up Table (LUT), with a storage requirement (hence area) that grows linearly with the output word size, but exponentially with the input word size. This limits its applicability to small input word sizes. For monotonic functions, a binary search in the output domain enables implementations whose area scales linearly with the input word size and exponentially with the output word size. This article introduces several novel architectures exploiting this idea, investigates their efficient mapping to FPGA micro-architecture using features such as \(k\) -input LUT and fast carry logic, compares them to the LUT approach in area and delay, and demonstrates an application to a Gaussian pseudo-random number generator.
Zitieren
APA
Joseph, P., Kumm, M., & Dinechin, F. D. (2026). Evaluating Monotonic Functions using Binary Search. ACM Transactions on Reconfigurable Technology and Systems. https://doi.org/10.1145/3838192
Vancouver
Joseph P, Kumm M, Dinechin FD. Evaluating Monotonic Functions using Binary Search. ACM Transactions on Reconfigurable Technology and Systems. 2026. doi:10.1145/3838192
BibTeX
@article{Joseph2026,
author = {Joseph, Pierrick and Kumm, Martin and Dinechin, Florent de},
title = {Evaluating Monotonic Functions using Binary Search},
journal = {ACM Transactions on Reconfigurable Technology and Systems},
year = {2026},
doi = {10.1145/3838192}
}
EUVIMED