2015 IEEE 22nd Symposium on Computer Arithmetic最新文献_第3页

A General-Purpose Method for Faithfully Rounded Floating-Point Function Approximation in FPGAs fpga中忠实舍入浮点函数逼近的通用方法

2015 IEEE 22nd Symposium on Computer Arithmetic Pub Date : 2015-06-22 DOI: 10.1109/ARITH.2015.27

David B. Thomas

{"title":"A General-Purpose Method for Faithfully Rounded Floating-Point Function Approximation in FPGAs","authors":"David B. Thomas","doi":"10.1109/ARITH.2015.27","DOIUrl":"https://doi.org/10.1109/ARITH.2015.27","url":null,"abstract":"A barrier to wide-spread use of Field Programmable Gate Arrays (FPGAs) has been the complexity of programming, but recent advances in High-Level Synthesis (HLS) have made it possible for non-experts to easily create floating-point numerical accelerators from C-like code. However, HLS users are limited to the set of numerical primitives provided by HLS vendors and designers of floating-point IP cores, and cannot easily implement new fast or accurate numerical primitives. This paper presents a method for automatically creating high-performance pipelined floating-point function approximations, which can be integrated as IP cores into numerical accelerators, whether derived from HLS or traditional design methods. Both input and output are floating-point, but internally the function approximator uses fixed-point polynomial segments, guaranteeing a faithfully rounded output. A robust and automated non-uniform segmentation scheme is used to segment any twice-differentiable input function and produce platform-independent VHDL. The approach is demonstrated across ten functions, which are automatically generated then placed and routed in Xilinx devices. The method provides a 1.1x-3x improvement in area over composite numerical approximations, while providing similar performance and significantly better relative error.","PeriodicalId":6526,"journal":{"name":"2015 IEEE 22nd Symposium on Computer Arithmetic","volume":"13 1","pages":"42-49"},"PeriodicalIF":0.0,"publicationDate":"2015-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88001808","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 15

Faster FFTs in Medium Precision 在中等精度下更快的fft

2015 IEEE 22nd Symposium on Computer Arithmetic Pub Date : 2015-06-22 DOI: 10.1109/ARITH.2015.10

J. Hoeven, Grégoire Lecerf

引用次数: 6

Hardware Implementations of Fixed-Point Atan2 定点Atan2的硬件实现

2015 IEEE 22nd Symposium on Computer Arithmetic Pub Date : 2015-06-22 DOI: 10.1109/ARITH.2015.23

F. D. Dinechin, Matei Iştoan

引用次数: 27

Numerical challenges in long term integrations of the solar system 太阳系长期整合中的数值挑战

2015 IEEE 22nd Symposium on Computer Arithmetic Pub Date : 2015-06-22 DOI: 10.1109/ARITH.2015.35

J. Laskar

{"title":"Numerical challenges in long term integrations of the solar system","authors":"J. Laskar","doi":"10.1109/ARITH.2015.35","DOIUrl":"https://doi.org/10.1109/ARITH.2015.35","url":null,"abstract":"Summary form only given, as follows. The full paper was not made available as part of this conference proceedings. Long time integrations of the planetary motion in the Solar System has been a challenging work in the past decades. The progress have followed the improvements of computer technology, but also the improvements in the integration algorithms. This quest has led to the development of high order dedicated symplectic integrators that have a stable behavior over long time scales. As important in the increase of the computing performances is the use of parallel algorithms that have divided the computing times by an order of magnitude. A specific aspect of these long term computation is also a careful monitoring of the accumulation of the roundoff error in the numerical algorithms, where all bias should be avoided. It should also be noted that for these computations, not only compensated summation is required, but also 80 bits extended precision floating point arithmetics. Integrating the equation of motion is only a part of the work. One needs also to determine precise initial conditions in order to ensure that the long time integration represent actually the motion of the real Solar System. Once these steps are fulfilled, the main limitation in the obtention of a precise solution of the planetary motion will be given by the chaotic nature of the Solar system that will strictly limit the possibility of precise prediction for the motion of the planets to about 60 Myr.","PeriodicalId":6526,"journal":{"name":"2015 IEEE 22nd Symposium on Computer Arithmetic","volume":"63 1","pages":"104"},"PeriodicalIF":0.0,"publicationDate":"2015-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87061054","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

Minimizing Energy by Achieving Optimal Sparseness in Parallel Adders 通过实现并行加法器的最优稀疏性来最小化能量

2015 IEEE 22nd Symposium on Computer Arithmetic Pub Date : 2015-06-22 DOI: 10.1109/ARITH.2015.13

M. Aktan, D. Baran, V. Oklobdzija

引用次数: 7

Efficient Implementation of Elementary Functions in the Medium-Precision Range 中等精度范围内初等函数的高效实现

2015 IEEE 22nd Symposium on Computer Arithmetic Pub Date : 2014-10-27 DOI: 10.1109/ARITH.2015.16

Fredrik Johansson

引用次数: 14

High-precision computation: Applications and challenges [Keynote I] 高精度计算:应用与挑战[主题演讲一]

2015 IEEE 22nd Symposium on Computer Arithmetic Pub Date : 2013-04-07 DOI: 10.1109/ARITH.2013.39

D. Bailey

{"title":"High-precision computation: Applications and challenges [Keynote I]","authors":"D. Bailey","doi":"10.1109/ARITH.2013.39","DOIUrl":"https://doi.org/10.1109/ARITH.2013.39","url":null,"abstract":"Summary form only given, as follows. High-precision floating-point arithmetic software, ranging from \"double-double\" or \"quad\" precision to arbitrarily high-precision (hundreds or thousands of digits), has been available for years. Such facilities are standard features of Mathematica and Maple, and software packages such as MPFR, QD and ARPREC are available on the Internet. Some of these packages include high-level language interface modules that make conversion of standard-precision programs a relatively simple task. However, until recently such facilities were widely considered as novelty items - why would anyone need such exalted levels of numeric precision in \"practical\" research or engineering? In fact, during the past decade or two, numerous applications have arisen for high-precision floatingpoint arithmetic. This presentation will briefly describe some of these applications, which mostly arise in mathematical physics, applied physics and mathematics. Many heretofore unknown identities and relationships have been discovered, and features have been identified in computed data that were not \"visible\" with ordinary 64-bit precision. Applications of double-double (31 digits) or quad-double precision (62 digits) are particularly common, but there are also some interesting applications for as high as 50,000 digits. The speaker will also outline what is needed in improved facilities for high-precision computation to address challenges that lie ahead.","PeriodicalId":6526,"journal":{"name":"2015 IEEE 22nd Symposium on Computer Arithmetic","volume":"526 1","pages":"3"},"PeriodicalIF":0.0,"publicationDate":"2013-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77692565","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 10

The Antikythera Mechanism and the early history of mechanical computing 安提基西拉机械和机械计算的早期历史

2015 IEEE 22nd Symposium on Computer Arithmetic Pub Date : 2013-04-07 DOI: 10.1109/ARITH.2013.40

M. Edmunds

引用次数: 1

Modular Multiplication and Division Algorithms Based on Continued Fraction Expansion 基于连分式展开的模乘除算法

2015 IEEE 22nd Symposium on Computer Arithmetic Pub Date : 2013-03-14 DOI: 10.1109/ARITH.2015.21

Mourad Gouicem

引用次数: 0

Arithmetic Interactions: From Hardware to Applications 算术交互:从硬件到应用

2015 IEEE 22nd Symposium on Computer Arithmetic Pub Date : 2005-06-27 DOI: 10.1109/ARITH.2005.10

David G. Hough, Bill Hay, J. Kidder, E. J. Riedy, G. Steele, James J. Thomas

引用次数: 0