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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
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)
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)
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)
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)
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)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this chapter
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)