Bounding variable values and round-off effects using handelman representations

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 30, Issue 11, 2011, Pages 1691-1704

  Boland, David ^a   Constantinides, George A ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

Algorithms implemented in hardware; numerical analysis; optimization; performance analysis and design aids

Indexed keywords

ALGEBRAIC OPERATIONS; ALGORITHMS IMPLEMENTED-IN-HARDWARE; CONJUGATE GRADIENT ALGORITHMS; EXECUTION TIME; HARDWARE DESIGN; MEMORY USAGE; PERFORMANCE ANALYSIS AND DESIGN AIDS; WORD LENGTH;

ALGEBRA; CONJUGATE GRADIENT METHOD; NUMERICAL ANALYSIS; NUMERICAL METHODS;

ALGORITHMS;

EID: 80054822116     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCAD.2011.2161307     Document Type: Article

References (38)

1. J. Langou, P. Luszczek, J. Kurzak, A. Buttari, and J. Dongarra, "Exploiting the performance of 32 bit floating point arithmetic in obtaining 64 bit accuracy (revisiting iterative refinement for linear systems)," in Proc. ACM/IEEE Conf. Supercomput., 2006, p. 113.
2. NVIDIA Corporation. (2009, Jan.). Tesla c1060 Computing Processor Board [Online]. Available: http://www.nvidia.com/docs/IO/43395/BD-04111-001-v05.pdf
3. J. A. Kahle, M. N. Day,H. P. Hofstee, C. R. Johns, T. R. Maeurer, and D. Shippy, "Introduction to the cell multiprocessor," IBM J. Res. Dev., vol. 49, nos. 4-5, pp. 589-604, 2005.
4. G. Constantinides, P. Cheung, andW. Luk, "Wordlength optimization for linear digital signal processing," IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst., vol. 22, no. 10, pp. 1432-1442, Oct. 2003.
5. K.-I. Kum and W. Sung, "Combined word-length optimization and highlevel synthesis of digital signal processing systems," IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst., vol. 20, no. 8, pp. 921-930, Aug. 2001.
6. A. R. Lopes, A. Shahzad, G. Constantinides, and E. Kerrigan, "More FLOPS or more precision? Accuracy parameterizable linear equations solvers for modelpredictive control," in Proc. IEEE Int. Symp. Field-Program. Custom Comput. Mach., Apr. 2009, pp. 209-216.
7. K. Underwood, "FPGAs vs. CPUs: Trends in peak floating-point performance," in Proc. Int. Symp. Field-Program. Gate Arrays, 2004, pp. 171-180.
8. D. Boland and G. Constantinides, "An FPGA-based implementation of the MINRES algorithm," in Proc. Int. Conf. Field Program. Logic Applicat., 2008, pp. 379-384.
9. A. Lopes and G. Constantinides, "Ahigh throughput FPGA-based floating point conjugate gradient implementation," in Proc. Reconfig. Comput.: Architect., Tools Applicat., 2008, pp. 75-86.
10. D. Boland and G. A. Constantinides, "Automated precision analysis: A polynomial algebraic approach," in Proc. IEEE Symp. Field-Program. Custom Comput. Mach., May 2010, pp. 157-164.
11. A. B. Kinsman and N. Nicolici, "Finite precision bit-width allocation using SAT-modulo theory," in Proc. Int. Conf. DATE, 2009, pp. 1106-1111.
12. A. B. Kinsman and N. Nicolici, "Bit-width allocation for hardware accelerators for scientific computing using SAT-modulo theory," IEEE Trans. Comp.-Aided Des. Integr. Ciruits Sys., vol. 29, no. 3, pp. 405-413, Mar. 2010.
13. A. B. Kinsman and N. Nicolici, "Robust design methods for hardware accelerators for iterative algorithms in scientific computing," in Proc. Des. Automat. Conf., 2010, pp. 254-257.
14. G. Constantinides, P. Cheung, and W. Luk, "Optimum wordlength allocation," in Proc. IEEE Symp. Field-Program. Custom Comput. Mach., Apr. 2002, pp. 219-228.
15. D.-U. Lee, A. Gaffar, R. Cheung, O. Mencer, W. Luk, and G. Constantinides, "Accuracy-guaranteed bit-width optimization," IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst., vol. 25, no. 10, pp. 1990-2000, Oct. 2006.
16. M. L. Chang and S. Hauck, "Pŕecis: A design-time precision analysis tool," in Proc. IEEE Symp. Field-Program. Custom Comput. Mach., Apr. 2002, pp. 229-238.
17. H. Choi and W. Burleson, "Search-based wordlength optimization for VLSI/DSP synthesis," in Proc. Workshop VLSI Signal Process. VII, 1994, pp. 198-207.
18. Z. Zhao and M. Leeser, "Precision modeling and bit-width optimization of floating-point applications," in Proc. High Performance Embedded Comput., Sep. 2003, pp. 141-142.
19. D. Priest, "Algorithms for arbitrary precision floating point arithmetic," in Proc. IEEE. Symp. Comput. Arithmet., Jun. 1991, pp. 132-143.
20. R. E. Moore, Interval Analysis. Englewood Cliff, NJ: Prentice-Hall, 1966.
21. R. E. Moore and F. Bierbaum, Methods and Applications of Interval Analysis. Philadelphia, PA: Society for Industrial and Applied Math, 1979.
22. B. Einarsson, Handbook on Accuracy and Reliability in Scientific Computation. Philadelphia, PA: Society for Industrial and Applied Math, 2005, ch. 10, pp. 195-240.
23. M. Berz and G. Hoffstätter, "Computation and application of Taylor polynomials with interval remainder bounds," Reliable Comput., vol. 4, pp. 83-97, Jul. 1998.
24. U. Abel, "On the Lagrange remainder of the Taylor formula," Am. Math. Monthly, vol. 110, no. 7, pp. 627-633, 2003.
25. M. Daumas and G. Melquiond, "Certification of bounds on expressions involving rounded operators," ACM Trans. Math. Softw., vol. 37, no. 1, pp. 1-20, 2010.
26. J. de Figueiredo and L. H. Stolfi, "Affine arithmetic: Concepts and applications," Numeric. Algorithms, vol. 37, no. 1, pp. 147-158, 2004.
27. W. Z. L. Zhang and Y. Zhang, "Tradeoff between approximation accuracy and complexity for range analysis using affine arithmetic," J. Signal Process. Syst., vol. 61, pp. 279-291, Apr. 2010.
28. C. Herde, A. Eggers, M. Franzle, and T. Teige, "Analysis of hybrid systems using HySAT," in Proc. 3rd Int. Conf. ICONS, 2008, pp. 196-201.
29. E. Hansen and G. W. Walster, Global Optimization Using Interval Analysis (Series Monographs and Textbooks in Pure and Applied Mathematics), vol. 264. New York: Marcel Dekker, 2004.
30. W.W. Adams and P. Loustaunau, An Introduction to Grobner Bases. Ann Arbor, MI: American Mathematical Society, 1994.
31. N. J. Higham, Accuracy and Stability of Numerical Algorithms, 2nd ed. Philadelphia, PA: Society for Industrial and Applied Math, 2002.
32. J. Garloff and A. P. Smith, "Rigorous affine lower bound functions for multivariate polynomials and their use in global optimisation," in Proc. Int. Conf. Appl. Oper. Res., vol. 1, no. 1. Sep. 2008, pp. 199-211.
33. D. Handelman, "Representing polynomials by positive linear functions on compact convex polyhedra," Pacific J. Math, vol. 132, no. 1, pp. 35-62, 1988.
34. J. B. Lasserre, "Polynomial programming: LP-relaxations also converge," SIAM J. Optimiz., vol. 15, no. 2, pp. 383-393, 2005.
35. M. R. Hestenes and E. Stiefel, "Methods of conjugate gradients for solving linear systems," J. Res. Nat. Bureau Standards, vol. 49, pp. 409-436, Dec. 1952.
36. L. Fousse, G. Hanrot, V. Lefévre, P. Pélissier, and P. Zimmermann, "MPFR: A multiple-precision binary floating-point library with correct rounding," ACM Trans. Math. Softw., vol. 33, no. 2, pp. 1-14, Jun. 2007.
37. Xilinx Corporation. (2010, Sep.). Core Generator Overview [Online]. Available: http://www.xilinx.com/itp/xilinx6/books/docs/cgn/cgn.pdf
38. P. A. Parrilo, "Semidefinite programming relaxations for semialgebraic problems," Math. Program. Ser. B, vol. 96, nos. 2-3, pp. 293-320, 2003.