Synthesis of arithmetic expressions for the fixed-point arithmetic: The Sardana approach

Conference on Design and Architectures for Signal and Image Processing, DASIP

Volumn , Issue , 2012, Pages 346-353

  Ioualalen, Arnault ^a,b   Martel, Matthieu ^a,b  

^a Architectures et Logiciels Informatiques ^*  (France)

^b LIRMM   (France)

Author keywords

Abstract Interpretation; Code Synthesis; Compilers; Fixed Point Formats

Indexed keywords

ABSTRACT INTERPRETATIONS; ARITHMETIC EXPRESSION; CODE SYNTHESIS; FIXED-POINT FORMATS; NUMERICAL ACCURACY; ROUND-OFF ERRORS; SOURCE CODES;

DIGITAL FILTERS; IMAGE PROCESSING; PROGRAM COMPILERS;

OPTIMIZATION;

EID: 84872414473     PISSN: 21649766     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. A. Ioualalen and M. Martel, "Sardana: an automatic tool for numerical accuracy optimization," Sep. 2012, accepted for publication at SCAN'12.
2. IEEE Standard for Binary Floating-point Arithmetic, Std 754-2008 ed., ANSI/IEEE, 2008.
3. A. Ioualalen and M. Martel, "A new abstract domain for the representation of mathematically equivalent expressions," in Static Analysis Symposium, SAS, ser. LNCS, no. 7460. Springer, 2012, pp. 75-93.
4. R. Yates, Fixed-Point Arithmetic: An Introduction, Digital Signal Labs, 2009.
5. P. Cousot and R. Cousot, "Abstract interpretation: A unified lattice model for static analysis of programs by construction of approximations of fixed points," in Principles of Programming Languages 4. ACM Press, 1977, pp. 238-252.
6. -, "Systematic design of program transformation frameworks by abstract interpretation," in Conference Record of the Twentyninth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2002, pp. 178-190.
7. R. Tate, M. Stepp, Z. Tatlock, and S. Lerner, "Equality saturation: A new approach to optimization," in POPL '09: Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of Programming Languages. ACM, 2009, pp. 264-276.
8. -, "Equality saturation: A new approach to optimization," Logical Methods in Computer Science, vol. 7, no. 1, 2011.
9. B. Boland and G. A. Constantinides, "A scalable approach for automated precision analysis," in FPGA, 2012, pp. 185-194.
10. H. Thibault and C. Philippe, "Sensitivity-based pole and inputoutput errors of linear filters as indicators of the implementation deterioration in fixed-point context," EURASIP Journal of Advanced Signal Processing, vol. 2011, 2011.
11. K. Parashar, R. Rocher, D. Menard, and O. Sentieys, "A hierarchical methodology for word-length optimization of signal processing systems," in VLSI Design, 2010, pp. 318-323.
12. M. Martel, "Enhancing the implementation of mathematical formulas for fixed-point and floating-point arithmetics," Journal of Formal Methods in System Design, vol. 35, 2009.
13. R. Rocher, D. Menard, N. Herve, and Sentieys, "Fixed-point configurable hardware components," EURASIP Journal on Embedded Systems (JES), vol. 2006, 2006.
14. R. Rocher, D. Menard, O. Sentieys, and P. Scalart, "Analytical accuracy evaluation of fixed-point systems," in EUSIPCO'07, 2007.
15. M. Martel, "Semantics of roundoff error propagation in finite precision calculations," Journal of Higher Order and Symbolic Computation, vol. 19, pp. 7-30, 2006.
16. R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck, "Efficiently computing static single assignment form and the control dependence graph," ACM Transactions on Programming Languages and Systems, vol. 13, no. 4, pp. 451-490, 1991.
17. S.-A.-A. Touati and D. Barthou, "On the decidability of phase ordering problem in optimizing compilation," in Proceedings of the 3rd conference on Computing frontiers, ser. CF '06. ACM, 2006, pp. 147-156.
18. C. Mouilleron, "Efficient computation with structured matrices and arithmetic expressions," Ph.D. dissertation, Universite de Lyon-ENS de Lyon, Nov. 2011.
19. F. S. Roberts and B. A. Tesman, Applied combinatorics (2. ed.). Prentice Hall, 2005.
20. P. Langlois, M. Martel, and L. Thevenoux, "Accuracy Versus Time: A Case Study with Summation Algorithms," in PASCO '10: Proceedings of the 4th International Workshop on Parallel and Symbolic Computation. ACM, 2010, pp. 121-130.
21. R. A. Ballance, A. B. Maccabe, and K. J. Ottenstein, "The program dependence web: a representation supporting control-, data-, and demand-driven interpretation of imperative languages," in Proceedings of the ACM SIGPLAN 1990 Conference on Programming Language Design and Implementation, 1990, pp. 257-271.
22. P. Tu and D. Padua, "Efficient building and placing of gating functions," in Proceedings of the ACM SIGPLAN 1995 Conference on Programming Language Design and Implementation, 1995, pp. 47-55.
23. J.-D. Choi, R. Cytron, and J. Ferrante, "Automatic construction of sparse data flow evaluation graphs," in Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, ser. POPL '91. ACM, 1991, pp. 55-66.
24. P. Briggs, K. D. Cooper, T. J. Harvey, and L. T. Simpson, "Practical improvements to the construction and destruction of static single assignment form," Software-Practice and Experience, vol. 28, no. 8, pp. 859-881, Jul 1998.
25. M. Martel, "Semantics-based transformation of arithmetic expressions," in Static Analysis Symposium, SAS'07, ser. Lecture Notes in Computer Science, no. 4634. Springer-Verlag, 2007.