Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1109/ASPDAC.2017.7858354guideproceedingsArticle/Chapter ViewAbstractPublication PagesConference Proceedingsacm-pubtype
research-article

A novel data format for approximate arithmetic computing

Published: 16 January 2017 Publication History

Abstract

Approximate computing has become one of the most popular computing paradigms in the era of the Internet of things and big data. It takes advantages of the error-tolerable feature of many applications, such as machine learning and image/signal processing, to reduce the resource required to deliver certain level of computation quality. In this paper, we propose an approximate integer format (AIF) and its associated arithmetic operations for energy minimization with controllable computation accuracy. In AIF, operands are segmented at run time such that the computation is performed only on part of operands by computing units (such as adders and multipliers) of smaller bit-width. The proposed AIF can be used for any arithmetic operation and can be extended to fixed point numbers. It can also be incorporated into higher level design such as architectural and programming language to give user the control of approximate computing. Experimental results show that our AIF based approximation computing approach can achieve high accuracy, incurs very little additional overhead, and save considerable energy.

References

[1]
S. Hua, G. Qu, and S.S. Bhattacharyya, “Energy Reduction Techniques for Multimedia Applications with Tolerance to Deadline Misses”, DAC, 2003.
[2]
S. Hua, G. Qu, and S.S. Bhattacharyya, “Probabilisitc Design of Multimedia Embedded Systems”, ACM TECS, Vol. 6, No. 3, pp. 1–15, 2007.
[3]
Q. Xu, T. Mytkowicz, N. S. Kim, “Approximate Computing: A Survey”. IEEE Design and Test, pp. 8–22, Jan./Feb. 2016.
[4]
Y. Kim, Y. Zhang, and P. Li, “Energy Efficient Approximate Arithmetic for Error Resilient Neuromorphic Computing,” Very Large Scale Integr. Syst. IEEE Trans., vol. 23, no. 11, pp. 2733–2737, 2015.
[5]
S. Hashemi, R. Bahar, and S. Reda, “DRUM: A Dynamic Range Unbiased Multiplier for Approximate Applications,” in Proceedings of ICCAD, 2015, pp. 418–425.
[6]
H. R. Mahdiani, A. Ahmadi, S. M. Fakhraie, and C. Lucas, “Bio-inspired imprecise computational blocks for efficient VLSI implementation of soft-computing applications,” Circuits Syst. I Regul. Pap. IEEE Trans., vol. 57, no. 4, pp. 850–862, 2010.
[7]
R. Ye, T. Wang, F. Yuan, R. Kumar, and Q. Xu, “On reconfiguration-oriented approximate adder design and its application,” in Proceedings of ICCAD, 2013, pp. 48–54.
[8]
N. Zhu, W. L. Goh, W. Zhang, K. S. Yeo, and Z. H. Kong, “Design of low-power high-speed truncation-error-tolerant adder and its application in digital signal processing,” Very Large Scale Integr. Syst. IEEE Trans., vol. 18, no. 8, pp. 1225–1229, 2010.
[9]
N. Zhu, W. L. Goh, and K. S. Yeo, “An enhanced low-power high-speed adder for error-tolerant application,” in Integrated Circuits, ISIC ‘09. Proceedings of the 12th International Symposium on, 2009, pp. 69–72.
[10]
J. Hu and W. Qian, “A new approximate adder with low relative error and correct sign calculation,” in Proceedings of the 2015 Design, Automation & Test in Europe Conference & Exhibition, 2015, pp. 1449–1454.
[11]
Y. Tian, Q. Zhang, T. Wang, F. Yuan, and Q. Xu, “ApproxMA: Approximate Memory Access for Dynamic Precision Scaling,” in Proceedings of h Great Lakes Symposium on VLSI, 2015, pp. 337–342.
[12]
A. Yazdanbakhsh, D. Mahajan, B. Thwaites et al., “Axilog: Language support for approximate hardware design,” in Design, Automation & Test in Europe Conference & Exhibition, 2015, pp. 812–817.
[13]
H. Esmaeilzadeh, A. Sampson, L. Ceze, and D. Burger, “Neural acceleration for general-purpose approximate programs,” in Proceedings of the 2012 45th Annual IEEE/ACM International Symposium on Microarchitecture, 2012, pp. 449–460.
[14]
O. Gupta, A. Agrawal, K. Gopalakrishnan, and P. Narayanan, “Deep learning with limited numerical precision,” arXiv Prepr. arXiv1502.02551, 2015.
[15]
D. D. Lin, S. S. Talathi, and V. S. Annapureddy, “Fixed Point Quantization of Deep Convolutional Networks,” arXiv Prepr. arXiv1511.06393, 2015.

Cited By

View all
  • (2021)Security Enhancements for Approximate Machine LearningProceedings of the 2021 Great Lakes Symposium on VLSI10.1145/3453688.3461753(461-466)Online publication date: 22-Jun-2021
  • (2019)Information Hiding behind Approximate ComputationProceedings of the 2019 Great Lakes Symposium on VLSI10.1145/3299874.3319456(405-410)Online publication date: 13-May-2019

Index Terms

  1. A novel data format for approximate arithmetic computing
    Index terms have been assigned to the content through auto-classification.

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image Guide Proceedings
    2017 22nd Asia and South Pacific Design Automation Conference (ASP-DAC)
    Jan 2017
    786 pages

    Publisher

    IEEE Press

    Publication History

    Published: 16 January 2017

    Qualifiers

    • Research-article

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)0
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 16 Oct 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2021)Security Enhancements for Approximate Machine LearningProceedings of the 2021 Great Lakes Symposium on VLSI10.1145/3453688.3461753(461-466)Online publication date: 22-Jun-2021
    • (2019)Information Hiding behind Approximate ComputationProceedings of the 2019 Great Lakes Symposium on VLSI10.1145/3299874.3319456(405-410)Online publication date: 13-May-2019

    View Options

    View options

    Get Access

    Login options

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media