A survey of approximate arithmetic circuits and blocks
| dc.contributor.author | Chen, Ke | |
| dc.contributor.author | Yin, Peipei | |
| dc.contributor.author | Liu, Weiqiang | |
| dc.contributor.author | Lombardi, Fabrizio | |
| dc.date.accessioned | 2022-11-22T09:53:17Z | |
| dc.date.available | 2022-11-22T09:53:17Z | |
| dc.date.issued | 2022 | |
| dc.description.abstract | Approximate computing has become an emerging research topic for energy-efficient design of circuits and systems. Many approximate arithmetic circuits have been proposed, therefore it is critical to summarize the available approximation techniques to improve performance and energy efficiency at a acceptable accuracy loss. This paper presents an overview of circuit-level techniques used for approximate arithmetic. This paper provides a detailed review of circuit-level approximation techniques for the arithmetic data path. Its focus is on identifying critical circuit-level approximation techniques that apply to computational units and blocks. Approximate adders, multipliers, dividers, and squarer are introduced and classified according to their approximation methods. FFT and MAC are discussed as computational blocks that employ an approximate algorithm for implementation. | en |
| dc.identifier.doi | 10.1515/itit-2021-0055 | |
| dc.identifier.pissn | 2196-7032 | |
| dc.identifier.uri | https://dl.gi.de/handle/20.500.12116/39757 | |
| dc.language.iso | en | |
| dc.publisher | De Gruyter | |
| dc.relation.ispartof | it - Information Technology: Vol. 64, No. 3 | |
| dc.subject | Approximate Arithmetic Circuit | |
| dc.subject | Adders | |
| dc.subject | Multipliers | |
| dc.subject | Dividers | |
| dc.subject | Squarer | |
| dc.subject | FFT | |
| dc.subject | MAC | |
| dc.title | A survey of approximate arithmetic circuits and blocks | en |
| dc.type | Text/Journal Article | |
| gi.citation.endPage | 87 | |
| gi.citation.publisherPlace | Berlin | |
| gi.citation.startPage | 79 | |
| gi.conference.sessiontitle | Article |