.png){kind=icon}
.png){kind=icon}
Return
Editorial: Special issue on Advancing on Approximate Computing: Methodologies, Architectures and Algorithms
.png){kind=icon}
PRE
AI
DOI：10.1016/j.future.2021.05.027.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In the modern computing era, characterized by saturated performance and high production costs, Approximate Computing has been representing the most attractive breakthrough for efficient system design. Such an innovative paradigm leverages the intrinsic error resilience of applications to inaccuracy in their inner calculations, in order to trade output result quality, under a certain maximum acceptable error threshold, off for system performance gain, such as calculation time and power demanding. In particular, for audio, image and video processing, data mining and information retrieval, approximate results turn out hard to distinguish from perfect ones, while their computation is less expensive. In recent years, Approximate Computing applicability is broadening in many scientific areas since suitable solutions come from approximate arithmetic operators, implemented both at hardware and software level, but from unreliable memory architectures, integrated circuit test, compilers and many others too. This special issue is dedicated to original research results and achievements by researcher community working on challenges and issues related to Approximate Computing. (C) 2021 Published by Elsevier B.V.
Keywords:
Approximate computing
Approximate circuit
Inherent error resiliency
Error modeling and propagation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
F
IF:
6.1
Papers:
6.8K
Citations:
2.3W
View more organizations