Computational logic with square rings of nanomagnets

Nanomagnets are a promising low-power alternative to traditional computing. However, the successful implementation of nanomagnets in logic gates has been hindered so far by a lack of reliability. Here, we present a novel design with dipolar-coupled nanomagnets arranged on a square lattice to (i) sup...

Full description

Saved in:
Bibliographic Details
Published inNanotechnology Vol. 29; no. 26; p. 265205
Main Authors Arava, Hanu, Derlet, Peter M, Vijayakumar, Jaianth, Cui, Jizhai, Bingham, Nicholas S, Kleibert, Armin, Heyderman, Laura J
Format Journal Article
LanguageEnglish
Published England IOP Publishing 29.06.2018
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:Nanomagnets are a promising low-power alternative to traditional computing. However, the successful implementation of nanomagnets in logic gates has been hindered so far by a lack of reliability. Here, we present a novel design with dipolar-coupled nanomagnets arranged on a square lattice to (i) support transfer of information and (ii) perform logic operations. We introduce a thermal protocol, using thermally active nanomagnets as a means to perform computation. Within this scheme, the nanomagnets are initialized by a global magnetic field and thermally relax on raising the temperature with a resistive heater. We demonstrate error-free transfer of information in chains of up to 19 square rings and we show a high level of reliability with successful gate operations of ∼94% across more than 2000 logic gates. Finally, we present a functionally complete prototype NAND/NOR logic gate that could be implemented for advanced logic operations. Here we support our experiments with simulations of the thermally averaged output and determine the optimal gate parameters. Our approach provides a new pathway to a long standing problem concerning reliability in the use of nanomagnets for computation.
Bibliography:NANO-116116.R1
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0957-4484
1361-6528
DOI:10.1088/1361-6528/aabbc3