Dynamic memristor-based reservoir computing for high-efficiency temporal signal processing
Reservoir computing is a highly efficient network for processing temporal signals due to its low training cost compared to standard recurrent neural networks, and generating rich reservoir states is critical in the hardware implementation. In this work, we report a parallel dynamic memristor-based r...
Gespeichert in:
Veröffentlicht in: | Nature communications 2021-01, Vol.12 (1), p.408-408, Article 408 |
---|---|
Hauptverfasser: | , , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Reservoir computing is a highly efficient network for processing temporal signals due to its low training cost compared to standard recurrent neural networks, and generating rich reservoir states is critical in the hardware implementation. In this work, we report a parallel dynamic memristor-based reservoir computing system by applying a controllable mask process, in which the critical parameters, including state richness, feedback strength and input scaling, can be tuned by changing the mask length and the range of input signal. Our system achieves a low word error rate of 0.4% in the spoken-digit recognition and low normalized root mean square error of 0.046 in the time-series prediction of the Hénon map, which outperforms most existing hardware-based reservoir computing systems and also software-based one in the Hénon map prediction task. Our work could pave the road towards high-efficiency memristor-based reservoir computing systems to handle more complex temporal tasks in the future.
Designing efficient neuromorphic systems for complex temporal tasks remains a challenge. Zhong et al. develop a parallel memristor-based reservoir computing system capable of tuning critical parameters, achieving classification accuracy of 99.6% in spoken-digit recognition and time-series prediction error of 0.046 in the Hénon map. |
---|---|
ISSN: | 2041-1723 2041-1723 |
DOI: | 10.1038/s41467-020-20692-1 |