Efficient Floating-Point Implementation of the Probit Function on FPGAs - Archive ouverte HAL Access content directly
Conference Papers Year : 2020

Efficient Floating-Point Implementation of the Probit Function on FPGAs

Abstract

Non-uniform random number generators are key components in Monte Carlo simulations. The inverse cumulative distribution function (ICDF) technique provides a viable solution for generating random variables from various distributions. Thus, the ICDF of the standard normal distribution, or probit function for short, is of particular interest. The goal of this article is to revisit and improve a floating-point (FP) implementation of probit, from the perspective of modern hardware resources available on FPGAs. Beside reexamining the classical Wichura's algorithm, we propose: (1) a single-precision implementation using the embedded FP DSP Blocks available in recent FPGA families; (2) generic custom-precision architectures that scale up to double-precision. These present a user-selectable trade-off between tail accuracy and resource utilization. Our proposed cores out-perform existing single-precision FPGA implementations in area, la-tency and accuracy, and also set benchmarks for new custom and double-precision FP implementations.
Fichier principal
Vignette du fichier
quantile.pdf (342.44 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02875528 , version 1 (19-06-2020)

Identifiers

Cite

Mioara Joldes, Bogdan Pasca. Efficient Floating-Point Implementation of the Probit Function on FPGAs. 31st IEEE International Conference on Application-specific Systems, Architectures and Processors, ASAP 2020, Jul 2020, Manchester, United Kingdom. ⟨10.1109/ASAP49362.2020.00036⟩. ⟨hal-02875528⟩
117 View
26 Download

Altmetric

Share

Gmail Facebook X LinkedIn More