Elementary Functions: Algorithms and Implementation

TL;DR: The paper surveys algorithms to implement such sampling efficiently, with particular focus on the case of constrained devices with small on-board storage and without access to large numbers of external random bits.

TL;DR: This paper presents an unified view of most previous table-lookup-and-addition methods: bipartite tables, SBTM, STAM and multipartite methods, with a new definition that allows a more accurate computation of the error entailed by these methods.

TL;DR: The architecture is based on the lookup table (LUT) cascade, which results in a significant reduction in circuit complexity compared to traditional approaches, suitable for automatic synthesis and a synthesis method that converts a Matlab-like specification into an LUT cascade design is shown.

TL;DR: This tutorial looks into the theoretical peak performance of a CPU in FLOPS for recent fully featured Intel CPUs and other hardware, taking into account not only the simple absolute peak, but also the relevant instruction sets, encoding and the frequency scaling behaviour of modern hardware.