A scalable approach for automated precision analysis

作者: David Boland , George A. Constantinides

DOI: 10.1145/2145694.2145726

关键词:

摘要: The freedom over the choice of numerical precision is one key factors that can only be exploited throughout datapath an FPGA accelerator, providing ability to trade accuracy final computational result with silicon area, power, operating frequency, and latency. However, in order tune used hardware accelerators automatically, a tool required verify will meet error or range specification for given precision. Existing tools perform this task typically suffer either from lack tightness bounds require large execution time when applied scale algorithms; work, we propose approach both larger examples obtain tighter bounds, within smaller time, than existing methods. describe also provides user quality procedure, making it suitable word-length optimization framework small large-scale algorithms.We demonstrate use our on instances iterative algorithms solve system linear equations. We show because track how relative decreases increasing precision, unlike methods, create guaranteed properties. This results saving 25% area comparison optimizing using competing analytical techniques, whilst requiring these almost 80% adopting IEEE double arithmetic.

参考文章(24)
Arnold Neumaier, Taylor Forms—Use and Limits Reliable Computing. ,vol. 9, pp. 43- 79 ,(2003) , 10.1023/A:1023061927787
Antonio Roldao Lopes, George A. Constantinides, A fused hybrid floating-point and fixed-point dot-product for FPGAs applied reconfigurable computing. ,vol. 5992, pp. 157- 168 ,(2010) , 10.1007/978-3-642-12133-3_16
Nicolas Courtois, Alexander Klimov, Jacques Patarin, Adi Shamir, Efficient algorithms for solving overdefined systems of multivariate polynomial equations theory and application of cryptographic techniques. pp. 392- 407 ,(2000) , 10.1007/3-540-45539-6_27
M.L. Chang, S. Hauck, Automated least-significant bit datapath optimization for FPGAs field-programmable custom computing machines. pp. 59- 67 ,(2004) , 10.1109/FCCM.2004.18
Florent de Dinechin, Christoph Quirin Lauter, Guillaume Melquiond, Assisted verification of elementary functions using Gappa acm symposium on applied computing. pp. 1318- 1322 ,(2006) , 10.1145/1141277.1141584
W. S. Brown, A Simple but Realistic Model of Floating-Point Computation ACM Transactions on Mathematical Software. ,vol. 7, pp. 445- 480 ,(1981) , 10.1145/355972.355975
Yu Pang, Kartazyna Radecka, Zeljko Zilic, Optimization of Imprecise Circuits Represented by Taylor Series and Real-Valued Polynomials IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. ,vol. 29, pp. 1177- 1190 ,(2010) , 10.1109/TCAD.2010.2049154