Skip to main content
Log in

Tradeoff between Approximation Accuracy and Complexity for Range Analysis using Affine Arithmetic

  • Published:
Journal of Signal Processing Systems Aims and scope Submit manuscript

Abstract

Digital signal processing algorithms are usually developed in floating-point arithmetic. After that floating-point to fixed-point transformation is performed to implement them on fixed-point devices, for higher speed, smaller area and lower power. During this transformation, range analysis is to find the minimum integer bit-widths for signals to prevent overflow. Existing state-of-the-art analytical methods for range analysis are generally based on Affine Arithmetic, which presents two approximation methods for non-affine operations. The Chebyshev approximation provides the best approximation with prohibitive computation expense. The trivial range estimation, which is very efficient for computation, over-estimates the range four times at the worst case. This paper presents a novel approach to let user decide tradeoff between approximation accuracy and complexity of Affine Arithmetic. Case studies and experiments are carried out to demonstrate its efficiency.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Figure 1
Figure 2
Figure 3
Figure 4

Similar content being viewed by others

References

  1. Constantinides, G., & Woeginger, G. (2001). The complexity of multiple wordlength assignment. Applied Mathematics Letters, 15(2), 137–140.

    Article  MathSciNet  Google Scholar 

  2. Lee, D.-U., Gaffar, A. A., Cheung, R. C. C., Mencer, O., Luk, W., & Constantinides, G. A. (2006). Accuracy-guaranteed bit-width optimization. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 25(10), 1990–2000.

    Article  Google Scholar 

  3. Sung, W., & Kum, K. I. (1995). Simulation-based word-length optimization method for fixed-point digital signal processing systems. IEEE Transactions on Signal Processing, 43(12), 3087–3090.

    Article  Google Scholar 

  4. Willems, M., Burgens, V., Keding, H., Grotker, T., & Meyr, H. (1997). System level fixed-point design based on an interpolative approach. In Proceedings of the 34th Design Automation Conference (pp. 293–298).

  5. Kum, K. I., & Sung, W. (2001). Combined word-length optimization and high-level synthesis of digital signal processing systems. IEEE Transactions on Computers, 20(8), 921–930.

    Google Scholar 

  6. Shi, C., & Brodersen, R. W. (2004). Automated fixed-point data-type optimization tool for signal processing and communication systems. In Proceedings of the 41th Design Automation Conference (pp. 478–483).

  7. Abdul Gaffar, A., Mencer, O., Luk, W., & Cheung, P. (2004). Unifying bit-width optimisation for fixed-point and floating-point designs. In Proceedings of the 12th IEEE Symposium on Field-Programmable Custom Computing Machines (pp. 79–88).

  8. Mallik, A., Sinha, D., Banerjee, P., & Zhou, H. (2007). Low-power optimization by smart bit-width allocation in a SystmC-based ASIC design environment. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 26(3), 447–455.

    Article  Google Scholar 

  9. Kramer, W. (1998). A priori worst case error bounds for floating-point computations. IEEE Transactions on Computers, 47(7), 750–756.

    Article  Google Scholar 

  10. Cmar, R., Rijnders, L., Schaumont, P., Vernalde S., & Bolsens, I. (1999). A methodology and design environment for DSP ASIC fixed point refinement. In Proceedings of Design, Automation and Test in Europe 1999 (pp. 271–276).

  11. Fang, C. F., Rutenbar, R., Puschel, M., & Chen, T. (2003). Toward efficient static analysis of finite-precision effects in DSP applications via affine arithmetic modeling. In Proceedings of the 40th Design Automation Conference (pp. 496–501).

  12. Fang, C. F., Rutenbar, R., & Chen, T. (2003). Fast, accurate static analysis for fixed-point finite-precision effects in DSP designs. In Proceedings of International Conference on Computer-Aided Design 2003 (pp. 275–282).

  13. Obsborne, W. G., Cheung, R. C. C., Coutinho, J. G. F., Luk, W., & Mencer, O. (2007). Automatic accuracy-guaranteed bit-width optimization for fixed and floating-point systems. In Proceedings of International Conference on Field Programmable Logic and Applications (pp. 617–620).

  14. López, J. A., Caffarena, G., Carreras, C., & Nieto-Taladriz, O. (2008). Fast and accurate computation of the roundoff noise of linear time-invariant systems. IET Circuits, Devices and Systems, 2(4), 393–408.

    Article  Google Scholar 

  15. Moore, R. E. (1962). Interval arithmetic and automatic error analysis in digital computing. Ph.D. thesis, Stanford University.

  16. Kearfott, R. B. (1996). Interval computations: Introduction, uses, and resources. Euromath Bulletin, 1(2), 95–112.

    MathSciNet  Google Scholar 

  17. Stolfi, J., & de Figueiredo, L. H. (1997). Self-validated numerical methods and applications. In Brazilian mathematics colloquium monograph, IMPA, Rio de Janeiro, Brazil.

  18. de Figueiredo, L. H., & Stolfi, J. (2003). Affine arithmetic: concepts and applications. Numerical Algorithms, 00, 1–13.

    Google Scholar 

  19. Walther, J. S. (2000). The story of unified CORDIC. Journal of VLSI Signal Processing, 25(2), 107–112.

    Article  MATH  Google Scholar 

  20. Kinsman, A. B., & Nicolici, N. (2009). Finite precision bit-width allocation using SAT-Modulo theory. In Proceedings of Design, Automation and Test in Europe 2009 (pp. 1106–1111).

  21. Shekhar, N., Kalla, P., & Enescu, F. (2006). Equivalence verification of arithmetic datapaths with multiple word-length operands. In Proceedings of Design, Automation and Test in Europe 2006 (pp. 824–829).

  22. Gopalakrishnan, S., Kalla, P., Meredith, M. B., & Enescu, F. (2007). Finding linear building-blocks for RTL synthesis of polynomial datapaths with fixed-size bit-vectors. In Proceedings of International Conference on Computer-Aided Design 2007 (pp. 143–148).

  23. Shou, H., Song, W., Shen, J., Martin, R., & Wang, G. (2006). A recursive taylor method for ray casting algebraic surfaces. In Proceedings of International Conference on Computer Graphics and Virtual Reality 2006 (pp. 196–204).

  24. Gay, O. (2006). Libaffa—C+ + affine arithmetic library for GNU/Linux. http://www.nongnu.org/libaffa.

  25. Jiang, J., Luk, W., & Rueckert, D. (2003). FPGA-based computation of free-form deformations in medical image registration. In Proceedings of IEEE International Conference on Field-Programmable Technology 2003 (pp. 234–241).

  26. Embree, P. M. (1995). C algorithms for real-time DSP. New Jersey: Prentice Hall.

    MATH  Google Scholar 

  27. Knuth, D. E. (1981). The art of computer programming: Seminumerical algorithms (Vol.2, 2nd Ed.). Reading: Addison-Wesley.

    MATH  Google Scholar 

Download references

Acknowledgements

The authors gratefully acknowledge the anonymous reviewers for their careful observations and insightful comments, which have helped us to improve the quality of this paper.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Linsheng Zhang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhang, L., Zhang, Y. & Zhou, W. Tradeoff between Approximation Accuracy and Complexity for Range Analysis using Affine Arithmetic. J Sign Process Syst 61, 279–291 (2010). https://doi.org/10.1007/s11265-010-0452-2

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11265-010-0452-2

Keywords

Navigation