Results 21 to 30 of about 95,300 (209)

JGMP: Java bindings and wrappers for the GMP library

open access: yesSoftwareX, 2023
The GNU Multiple Precision Arithmetic Library (GMP) is a widely used library for computing with arbitrary precision arithmetic. The library has functionally complete bindings for many programming languages, including .NET, C++, OCaml, Python, Ruby, and ...
Gianluca Amato, Francesca Scozzari
doaj   +1 more source

Effectiveness of Floating-Point Precision on the Numerical Approximation by Spectral Methods

open access: yesMathematical and Computational Applications, 2021
With the fast advances in computational sciences, there is a need for more accurate computations, especially in large-scale solutions of differential problems and long-term simulations. Amid the many numerical approaches to solving differential problems,
José A. O. Matos, Paulo B. Vasconcelos
doaj   +1 more source

Computing the Density of the Positivity Set for Linear Recurrence Sequences [PDF]

open access: yesLogical Methods in Computer Science, 2023
The set of indices that correspond to the positive entries of a sequence of numbers is called its positivity set. In this paper, we study the density of the positivity set of a given linear recurrence sequence, that is the question of how much more ...
Edon Kelmendi
doaj   +1 more source

Divisions and Square Roots with Tight Error Analysis from Newton–Raphson Iteration in Secure Fixed-Point Arithmetic

open access: yesCryptography, 2023
In this paper, we present new variants of Newton–Raphson-based protocols for the secure computation of the reciprocal and the (reciprocal) square root.
Stan Korzilius, Berry Schoenmakers
doaj   +1 more source

The Prime state and its quantum relatives [PDF]

open access: yesQuantum, 2020
The Prime state of $n$ qubits, ${|\mathbb{P}_n{\rangle}}$, is defined as the uniform superposition of all the computational-basis states corresponding to prime numbers smaller than $2^n$. This state encodes, quantum mechanically, arithmetic properties of
D. García-Martín   +4 more
doaj   +1 more source

High-Performance Computation in Residue Number System Using Floating-Point Arithmetic

open access: yesComputation, 2021
Residue number system (RNS) is known for its parallel arithmetic and has been used in recent decades in various important applications, from digital signal processing and deep neural networks to cryptography and high-precision computation.
Konstantin Isupov
doaj   +1 more source

DSP-Packing: Squeezing Low-precision Arithmetic into FPGA DSP Blocks [PDF]

open access: yesInternational Conference on Field-Programmable Logic and Applications, 2022
The number of Digital Signal Processor (DSP) resources available in Field Programmable Gate Arrays (FPGAs) is often quite limited. Therefore, full utilization of available DSP resources for the computationally intensive parts of an algorithm is paramount
J. Sommer   +3 more
semanticscholar   +1 more source

Privacy-Preserving Machine Learning With Fully Homomorphic Encryption for Deep Neural Network

open access: yesIEEE Access, 2022
Fully homomorphic encryption (FHE) is a prospective tool for privacy-preserving machine learning (PPML). Several PPML models have been proposed based on various FHE schemes and approaches.
Joon-Woo Lee   +10 more
doaj   +1 more source

Hardware acceleration of number theoretic transform for zk‐SNARK

open access: yesEngineering Reports, EarlyView., 2023
An FPGA‐based hardware accelerator with a multi‐level pipeline is designed to support the large‐bitwidth and large‐scale NTT tasks in zk‐SNARK. It can be flexibly scaled to different scales of FPGAs and has been equipped in the heterogeneous acceleration system with the help of HLS and OpenCL.
Haixu Zhao   +6 more
wiley   +1 more source

Fast Arbitrary Precision Floating Point on FPGA [PDF]

open access: yesIEEE Symposium on Field-Programmable Custom Computing Machines, 2022
Numerical codes that require arbitrary precision floating point (APFP) numbers for their core computation are dominated by elementary arithmetic operations due to the super-linear complexity of multiplication in the number of mantissa bits.
J. D. F. Licht   +4 more
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy