Predefined-Time Synchronization of Coupled Memristive Competitive Neural Networks

In this paper, the predefined-time synchronization (PTS) problem of coupled memristive competitive neural net-works (CMCNNs) is studied. More precisely, by devising suitable bilayer controllers and Lyapunov functional, we derive a condition for achieving PTS of CMCNNs. In addition, the accuracy of the obtained conclusion has been confirmed through an example with simulation results.

Authors

Institutions

Publication Details

Published
2024-09-20
DOI
https://doi.org/10.1109/csis-iac63491.2024.10919352
Citations
1
Primary Topic
Advanced Memory and Neural Computing
Type
article
Field-Weighted Citation Impact
0.21
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Predefined-Time Synchronization of Coupled Memristive Competitive Neural Networks

Wenjing Duan, Tse Chiu Wong, Yanli Huang
1 citations
Advanced Memory and Neural Computing
0.21
article

Predefined-Time Synchronization of Coupled Memristive Competitive Neural Networks

Wenjing Duan, Tse Chiu Wong, Yanli Huang
article en
1 citations

Abstract

In this paper, the predefined-time synchronization (PTS) problem of coupled memristive competitive neural net-works (CMCNNs) is studied. More precisely, by devising suitable bilayer controllers and Lyapunov functional, we derive a condition for achieving PTS of CMCNNs. In addition, the accuracy of the obtained conclusion has been confirmed through an example with simulation results.

University of Strathclyde (GB), Tiangong University (CN)
Openalex Percentile: Top 43%
Advanced Memory and Neural Computing
0.21
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.