2011 IEEE 20th Symposium on Computer Arithmetic最新文献_第2页

A Prescale-Lookup-Postscale Additive Procedure for Obtaining a Single Precision Ulp Accurate Reciprocal 获得单精度Ulp精确倒数的尺度前-查找-尺度后加性方法

2011 IEEE 20th Symposium on Computer Arithmetic Pub Date : 2011-07-25 DOI: 10.1109/ARITH.2011.31

D. Matula, Mihai T. Panu

引用次数: 2

Latency Sensitive FMA Design 延迟敏感FMA设计

2011 IEEE 20th Symposium on Computer Arithmetic Pub Date : 2011-07-25 DOI: 10.1109/ARITH.2011.26

Sameh Galal, M. Horowitz

引用次数: 12

Self Checking in Current Floating-Point Units 当前浮点单位的自检

2011 IEEE 20th Symposium on Computer Arithmetic Pub Date : 2011-07-25 DOI: 10.1109/ARITH.2011.18

Daniel Lipetz, E. Schwarz

引用次数: 26

The IBM zEnterprise-196 Decimal Floating-Point Accelerator IBM zEnterprise-196十进制浮点加速器

2011 IEEE 20th Symposium on Computer Arithmetic Pub Date : 2011-07-25 DOI: 10.1109/ARITH.2011.27

S. Carlough, Adam Collura, S. M. Müller, M. Kroener

引用次数: 47

On the Fixed-Point Accuracy Analysis and Optimization of FFT Units with CORDIC Multipliers 带CORDIC乘法器的FFT单元不动点精度分析与优化

2011 IEEE 20th Symposium on Computer Arithmetic Pub Date : 2011-07-25 DOI: 10.1109/ARITH.2011.17

O. Sarbishei, K. Radecka

引用次数: 12

Accelerating Computations on FPGA Carry Chains by Operand Compaction 通过操作数压缩加速FPGA进位链的计算

2011 IEEE 20th Symposium on Computer Arithmetic Pub Date : 2011-07-25 DOI: 10.1109/ARITH.2011.22

Thomas B. Preußer, M. Zabel, R. Spallek

{"title":"Accelerating Computations on FPGA Carry Chains by Operand Compaction","authors":"Thomas B. Preußer, M. Zabel, R. Spallek","doi":"10.1109/ARITH.2011.22","DOIUrl":"https://doi.org/10.1109/ARITH.2011.22","url":null,"abstract":"This work describes the carry-compact addition (CCA), a novel addition scheme that allows the acceleration of carry-chain computations on contemporary FPGA devices. While based on concepts known from the carry-look ahead addition and from parallel prefix adders, their adaptation by the CCA takes the context of an FPGA as implementation environment into account. These typically provide carry-chain structures to accelerate the simple ripple-carry addition (RCA). Rather than contrasting this scheme with the hierarchical addition approaches favored in hard-core VLSI designs, the CCA combines the benefits of both and uses hierarchical structures to shorten the critical path, which is still left on a core carry chain. In contrast to previous studies examining the asymptotically superior parallel prefix adders on FPGAs, the CCA is shown to outperform the standard RCA already for operand widths starting at 50~bits. Wider adders such as used in extended-precision floating-point units and in cryptographic applications even benefit from increasing speedups. The concrete mapping of the CCA as achieved for current Xilinx and Altera architectures is described and shown to be very favorable so as to yield a high speedup for a very modest investment of additional LUT resources.","PeriodicalId":272151,"journal":{"name":"2011 IEEE 20th Symposium on Computer Arithmetic","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127989783","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}

引用次数: 17

Efficient SIMD Arithmetic Modulo a Mersenne Number 高效SIMD算术模梅森数

2011 IEEE 20th Symposium on Computer Arithmetic Pub Date : 2011-07-25 DOI: 10.1109/ARITH.2011.37

Joppe W. Bos, T. Kleinjung, A. Lenstra, P. L. Montgomery

引用次数: 23

Teraflop FPGA Design Teraflop FPGA设计

2011 IEEE 20th Symposium on Computer Arithmetic Pub Date : 2011-07-25 DOI: 10.1109/ARITH.2011.32

M. Langhammer

引用次数: 1

Automatic Generation of Code for the Evaluation of Constant Expressions at Any Precision with a Guaranteed Error Bound 具有保证误差范围的任意精度常数表达式求值代码的自动生成

2011 IEEE 20th Symposium on Computer Arithmetic Pub Date : 2011-07-25 DOI: 10.1109/ARITH.2011.38

S. Chevillard

{"title":"Automatic Generation of Code for the Evaluation of Constant Expressions at Any Precision with a Guaranteed Error Bound","authors":"S. Chevillard","doi":"10.1109/ARITH.2011.38","DOIUrl":"https://doi.org/10.1109/ARITH.2011.38","url":null,"abstract":"The evaluation of special functions often involves the evaluation of numerical constants. When the precision of the evaluation is known in advance (e.g., when developing libms) these constants are simply precomputed once and for all. In contrast, when the precision is dynamically chosen by the user (e.g., in multiple precision libraries), the constants must be evaluated on the fly at the required precision and with a rigorous error bound. Often, such constants are easily obtained by means of formulas involving simple numbers and functions. In principle, it is not a difficult work to write multiple precision code for evaluating such formulas with a rigorous round off analysis: one only has to study how round off errors propagate through sub expressions. However, this work is painful and error-prone and it is difficult for a human being to be perfectly rigorous in this process. Moreover, the task quickly becomes impractical when the size of the formula grows. In this article, we present an algorithm that takes as input a constant formula and that automatically produces code for evaluating it in arbitrary precision with a rigorous error bound. It has been implemented in the Solly a free software tool and its behavior is illustrated on several examples.","PeriodicalId":272151,"journal":{"name":"2011 IEEE 20th Symposium on Computer Arithmetic","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130159002","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}

引用次数: 0

Accelerating Large-Scale HPC Applications Using FPGAs 使用fpga加速大规模HPC应用

2011 IEEE 20th Symposium on Computer Arithmetic Pub Date : 2011-07-25 DOI: 10.1109/ARITH.2011.34

R. Dimond, S. Racanière, O. Pell

引用次数: 26