.png){kind=icon}
Return
Evaluating Monotonic Functions using Binary Search
.png){kind=icon}
PRE
AI
DOI：10.1145/3838192.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Arithmetic operations,evaluation of numerical functions
Journal
IF:
2.8
Papers:
598
Citations:
810
Organization
No organization information available
Cited Papers
No cited papers available