Numerical model for 32-bit magnonic ripple carry adder

Autor(en)

Umberto Garlando, Qi Wang, Oleksandr Dobrovolskiy, Andrii Chumak, Fabrizio Riente

Abstrakt

In CMOS-based electronics, the most straightforward way to implement a summation operation is to use the ripple carry adder (RCA). Magnonics, the field of science concerned with data processing by spin waves and their quanta magnons, recently proposed a magnonic half-adder that can be considered as the simplest magnonic integrated circuit. Here, we develop a computation model for the magnonic basic blocks to enable the design and simulation of magnonic gates and magnonic circuits of arbitrary complexity and demonstrate its functionality on the example of a 32-bit integrated RCA. It is shown that the RCA requires the utilization of additional regenerators based on magnonic directional couplers with embedded amplifiers to normalize the magnon signals in-between the half-adders. The benchmarking of large-scale magnonic integrated circuits is performed. The energy consumption of 30 nm-based magnonic 32-bit adder can be as low as 961 aJ per operation with taking into account all required amplifiers.

Organisation(en)

Nanomagnetismus und Magnonik

Externe Organisation(en)

Politecnico di Torino

Journal

IEEE Transactions on Emerging Topics in Computing

Band

11

Seiten

679-688

Anzahl der Seiten

10

DOI

https://doi.org/10.1109/TETC.2023.3238581

Publikationsdatum

11-2021

Peer-reviewed

Ja

ÖFOS 2012

103017 Magnetismus

Schlagwörter

ASJC Scopus Sachgebiete

Computer Science (miscellaneous), Information systems, Human-computer interaction, Computer Science Applications

Link zum Portal

https://ucrisportal.univie.ac.at/de/publications/91eb4725-4b4e-4f02-9877-4af58101e79e