% IMPORTANT: The following is UTF-8 encoded. This means that in the presence
% of non-ASCII characters, it will not work with BibTeX 0.99 or older.
% Instead, you should use an up-to-date BibTeX implementation like “bibtex8” or
% “biber”.
@ARTICLE{Bhattacharjee:860103,
author = {Bhattacharjee, Debjyoti and Siemon, Anne and Linn, Eike and
Menzel, Stephan and Chattopadhyay, Anupam},
title = {{K}ogge-{S}tone {A}dder {R}ealization using 1{S}1{R}
{R}esistive {S}witching {C}rossbar {A}rrays},
journal = {ACM journal on emerging technologies in computing systems},
volume = {14},
number = {2},
issn = {1550-4832},
address = {New York, NY},
publisher = {Association for Computing Machinery},
reportid = {FZJ-2019-00889},
pages = {Article No. 30},
year = {2018},
abstract = {Low operating voltage, high storage density, non-volatile
storage capabilities, and relative low access latencies have
popularized memristive devices as storage devices.
Memristors can be ideally used for in-memory computing in
the form of hybrid CMOS nano-crossbar arrays. In-memory
serial adders have been theoretically and experimentally
proven for crossbar arrays. To harness the parallelism of
memristive arrays, parallel-prefix adders can be effective.
In this work, a novel mapping scheme for in-memory
Kogge-Stone adder has been presented. The number of cycles
increases logarithmically with the bit width N of the
operands, i.e., O(log2N), and the device count is 5N. We
verify the correctness of the proposed scheme by means of
TaO× device model-based memristive simulations. We compare
the proposed scheme with other proposed schemes in terms of
number of cycle and number of devices},
cin = {PGI-7 / JARA-FIT},
ddc = {004},
cid = {I:(DE-Juel1)PGI-7-20110106 / $I:(DE-82)080009_20140620$},
pnm = {521 - Controlling Electron Charge-Based Phenomena
(POF3-521)},
pid = {G:(DE-HGF)POF3-521},
typ = {PUB:(DE-HGF)16},
UT = {WOS:000449159400017},
doi = {10.1145/3183352},
url = {https://juser.fz-juelich.de/record/860103},
}