Skip to main content

Abstract

In this book, algorithms and methodologies for the approximate computing paradigm have been proposed. Approximate computing hinges on cleverly using controlled inaccuracies (errors) in the operation for performance improvement. The key idea is to trade off correct computation against energy or performance. Approximate computing can address the growing demands of computational power for the current and future systems. Applications such as multi-media processing and compressing, voice recognition, web search, or deep learning are just a few examples where this novel computational paradigm provides huge benefits. However, this technology is still in its infancy and not widely adopted to mainstream. This is because of the lack of efficient design automation tools needed for approximate computing. This book provides several novel algorithms for the design automation of the approximation circuits. Our methodologies are efficient, scalable and significantly advance the current state-of-the-art of the approximate hardware design. We have addressed the important facets of approximate computing—from formal verification and error guarantees to synthesis and test of approximation systems.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 54.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. K.H. Chang, I.L. Markov, V. Bertacco, Fixing design errors with counterexamples and resynthesis. IEEE Trans. Comput. Aided Des. Circuits Syst. 27, 184–188 (2008)

    Article  Google Scholar 

  2. H. Hoffmann, S. Sidiroglou, M. Carbin, S. Misailovic, A. Agarwal, M. Rinard, Dynamic knobs for responsive power-aware computing. ACM SIGPLAN Not. 46, 199–212 (2011)

    Article  Google Scholar 

  3. Z. Istvan, G. Alonso, M. Blott, K. Vissers, A hash table for line-rate data processing. ACM Trans. Reconfig. Technol. Syst. 8, 13:1–13:15 (2015)

    Article  Google Scholar 

  4. H. Riener, R. Ehlers, G. Fey, CEGAR-based EF synthesis of boolean functions with an application to circuit rectification, in ASP Design Automation Conference, pp. 251–256 (2017)

    Google Scholar 

  5. A. Smith, A. Veneris, M.F. Ali, A. Viglas, Fault diagnosis and logic debugging using boolean satisfiability, in IEEE Transactions on Computer Aided Design of Circuits and Systems, vol. 24, pp. 1606–1621 (2006)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Chandrasekharan, A., Große, D., Drechsler, R. (2019). Conclusions and Outlook. In: Design Automation Techniques for Approximation Circuits. Springer, Cham. https://doi.org/10.1007/978-3-319-98965-5_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-98965-5_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-98964-8

  • Online ISBN: 978-3-319-98965-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics