<![CDATA[ IEEE Transactions on Computers - new TOC ]]>
http://ieeexplore.ieee.org
TOC Alert for Publication# 12 2017November 23<![CDATA[Introduction to the Special Issue on Computer Arithmetic]]>661219911993214<![CDATA[High Performance Parallel Decimal Multipliers Using Hybrid BCD Codes]]>6612199420041324<![CDATA[Arithmetical Improvement of the Round-Off for Cryptosystems in High-Dimensional Lattices]]>661220052018842<![CDATA[Fast Modular Arithmetic on the Kalray MPPA-256 Processor for an Energy-Efficient Implementation of ECM]]>661220192030536<![CDATA[Single Precision Logarithm and Exponential Architectures for Hard Floating-Point Enabled FPGAs]]>$log (x)$ and $exp (x)$, two of the most commonly required functions for emerging datacenter and computing FPGA targets. We explain why the combination of new FPGA technology, and at the same time, a massive increase in computing performance requirement, fuels the need for this work. We show a comprehensive error analysis, and discuss various implementation trade-offs that demonstrate that the hard FP (HFP) Blocks, in conjunction with the traditional flexibility and connectivity of the FPGA, can provide a robust and high performance solution. The architectures presented in this work meet OpenCL accuracy requirements. Our methods map extensively to embedded structures, and therefore result in significant reduction in logic resources and routing stress compared to current methods. The methods allow leveraging the routing architectures introduced in the Stratix 10 device which results in high-function performance.]]>661220312043894<![CDATA[Exponential Sums and Correctly-Rounded Functions]]>CRlibm, a library which offers correctly rounded evaluation in binary64 of some functions of the usual libm. It evaluates functions using a two step strategy, which relies on a folklore heuristic that is well spread in the community of mathematical functions designers. Under this heuristic, one can compute the distribution of the lengths of runs of zeros/ones after the rounding bit of the value of the function at a given floating-point number. The goal of this paper is to change, whenever possible, this heuristic into a rigorous statement. The underlying mathematical problem amounts to counting integer points in the neighborhood of a curve, which we tackle using so-called exponential sums techniques, a tool from analytic number theory.]]>661220442057344<![CDATA[Exact Lookup Tables for the Evaluation of Trigonometric and Hyperbolic Functions]]>661220582071524<![CDATA[Optimization of Constant Matrix Multiplication with Low Power and High Throughput]]>661220722080537<![CDATA[Efficient Multibyte Floating Point Data Formats Using Vectorization]]>6612208120961428<![CDATA[Hardware Division by Small Integer Constants]]>661220972110918<![CDATA[Correctly Rounded Arbitrary-Precision Floating-Point Summation]]>661221112124756