Logo des Repositoriums
 

Unlocking approximation for in-memory computing with Cartesian genetic programming and computer algebra for arithmetic circuits

dc.contributor.authorFroehlich, Saman
dc.contributor.authorDrechsler, Rolf
dc.date.accessioned2022-11-22T09:53:17Z
dc.date.available2022-11-22T09:53:17Z
dc.date.issued2022
dc.description.abstractWith ReRAM being a non-volative memory technology, which features low power consumption, high scalability and allows for in-memory computing, it is a promising candidate for future computer architectures. Approximate computing is a design paradigm, which aims at reducing the complexity of hardware by trading off accuracy for area and/or delay. In this article, we introduce approximate computing techniques to in-memory computing. We extend existing compilation techniques for the Programmable Logic in-Memory (PLiM) computer architecture, by adapting state-of-the-art approximate computing techniques for arithmetic circuits. We use Cartesian Genetic Programming for the generation of approximate circuits and evaluate them using a Symbolic Computer Algebra-based technique with respect to error-metrics. In our experiments, we show that we can outperform state-of-the-art handcrafted approximate adder designs.en
dc.identifier.doi10.1515/itit-2021-0042
dc.identifier.pissn2196-7032
dc.identifier.urihttps://dl.gi.de/handle/20.500.12116/39759
dc.language.isoen
dc.publisherDe Gruyter
dc.relation.ispartofit - Information Technology: Vol. 64, No. 3
dc.subjectApproximate Computing
dc.subjectIn-Memory Computing
dc.subjectReRAM
dc.subjectRRAM
dc.subjectSymbolic Computer Algebra
dc.subjectSCA
dc.subjectPLiM
dc.subjectCGP
dc.subjectEA
dc.subjectCartesian Genetic Programming
dc.titleUnlocking approximation for in-memory computing with Cartesian genetic programming and computer algebra for arithmetic circuitsen
dc.typeText/Journal Article
gi.citation.endPage107
gi.citation.publisherPlaceBerlin
gi.citation.startPage99
gi.conference.sessiontitleArticle

Dateien