Next Article in Journal
On a Lyapunov-Type Inequality for Control of a ψ-Model Thermostat and the Existence of Its Solutions
Next Article in Special Issue
Memristor Cellular Nonlinear Networks
Previous Article in Journal
Trigonometric Polynomial Solutions of Bernoulli Trigonometric Polynomial Differential Equations
Previous Article in Special Issue
Bipartite Synchronization of Fractional-Order Memristor-Based Coupled Delayed Neural Networks with Pinning Control
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Convergence of Neural Networks with a Class of Real Memristors with Rectifying Characteristics

1
Dipartimento di Ingegneria dell’Informazione e Scienze Matematiche, Università di Siena, Via Roma 56, 53100 Siena, Italy
2
Dipartimento di Ingegneria dell’Informazione, Università degli Studi di Firenze, Via S. Marta 3, 50139 Firenze, Italy
*
Author to whom correspondence should be addressed.
Mathematics 2022, 10(21), 4024; https://doi.org/10.3390/math10214024
Submission received: 27 September 2022 / Revised: 21 October 2022 / Accepted: 24 October 2022 / Published: 29 October 2022
(This article belongs to the Special Issue Memristor Cellular Nonlinear Networks: Theory and Applications)

Abstract

:
The paper considers a neural network with a class of real extended memristors obtained via the parallel connection of an ideal memristor and a nonlinear resistor. The resistor has the same rectifying characteristic for the current as that used in relevant models in the literature to account for diode-like effects at the interface between the memristor metal and insulating material. The paper proves some fundamental results on the trajectory convergence of this class of real memristor neural networks under the assumption that the interconnection matrix satisfies some symmetry conditions. First of all, the paper shows that, while in the case of neural networks with ideal memristors, it is possible to explicitly find functions of the state variables that are invariants of motions, the same functions can be used as Lyapunov functions that decrease along the trajectories in the case of real memristors with rectifying characteristics. This fundamental property is then used to study convergence by means of a reduction-of-order technique in combination with a Lyapunov approach. The theoretical predictions are verified via numerical simulations, and the convergence results are illustrated via the applications of real memristor neural networks to the solution of some image processing tasks in real time.

1. Introduction

Nowadays, Von Neumann computing architectures are facing severe limitations in the handling of big data in the Internet of Things (IoT) and cloud computing systems in real time [1,2,3,4]. One of the main problems is the memory bottleneck that occurs because the central processing unit (CPU) and the memory (e.g., the RAM) have different physical locations. This implies that the time needed to handle the continuous transfer of data between the CPU and RAM may be excessively long, and the electronic power requirements may be demanding. The use of memristors and, more generally, emerging nanoscale memristive devices is a long-term vision with the aim of overcoming some of the limitations of Von Neumann computing architectures via the implementation of analog and parallel neuromorphic computing paradigms akin to some basic principles on which biological brains operate [5,6,7,8]. In particular, memristors enable the implementation of in-memory computing schemes in which the same device is used to compute as well as store the computational result, thus overcoming the Von Neumann memory bottleneck [9,10,11].
Memristors have been classified as ideal, generic, and extended memristors [12,13,14]. Ideal memristors, which were introduced in the seminal 1971 paper by Prof. Leon Chua [15], are defined by a nonlinear relation between the flux (the integral of voltage) and charge (the integral of current). In the voltage–current domain, an ideal voltage-controlled memristor satisfies a state-dependent Ohm’s law where the conductance (which is also called the memductance) is a function of the state, i.e., the flux. Ideal memristors continue to be of great interest in circuit theory. However, they are often inadequate for accurately modeling the switching behavior of real electronic memristive devices that are implemented in nanotechnology [16,17,18,19]. Currently, real devices need to be modeled using generic or extended memristors, which involve one or more state variables—not necessarily including the flux—and more general forms of the state-dependent Ohm’s law and state equations [13].
Convergence of trajectories toward equilibrium points (EPs) is one of the most relevant dynamical properties of a neural network (NN) from both a theoretical and an applied point of view. Convergent NNs may be used for the implementation of content-addressable memories (CAMs), where the information is stored in the stable EPs of the NN in order to solve combinatorial optimization problems in which the local minima of an associated energy function correspond to the optimal solutions of the problem and to solve several other signal processing tasks in real time [20,21,22,23,24,25]. Convergence of NNs has been widely investigated for traditional NNs without memristors by using various techniques, such as the Lyapunov method, the dichotomy of omega-limit sets for cooperative systems, the global consistency of the decision schemes implemented by competitive NNs, and the ojasiewicz inequality combined with the concept of trajectories with a finite length for NNs with analytic nonlinearities. The reader is referred to [20,22,26,27,28,29,30,31] and the references therein for an account of some of the main contributions on the convergence of NNs. On the other hand, only a few papers are available in the literature on the convergence of memristor neural networks (MNNs). The authors of [32,33,34] provided results on the convergence of MNNs with ideal memristors in the case of symmetric interconnections and in that of cooperative (non-negative) interconnections between neurons. There, convergence was studied by using the flux–charge analysis method (FCAM) and a reduction-of-order technique [14]. The authors of [35,36] established results on multistability for MNNs with ideal memristors while considering delays in the interconnections, and they also used FCAM. To the authors’ knowledge, so far, only very specific results have been obtained on the convergence of MNNs with real memristor devices. In this regard, we mention the paper [37], which established convergence for MNNs with a class of generic memristors obeying the VTEAM model, as well as [38], in which the convergence of a class of cellular MNNs with real memristors and second-order cells was analyzed.
In this paper, we consider MNNs with a class of extended memristors that were introduced in [39] and obtained via the parallel connection of an ideal voltage-controlled memristor and a voltage-controlled nonlinear resistor. These networks are named real memristor neural networks (RMNNs). The paper establishes some fundamental results on the trajectory convergence when the neuron interconnections are symmetric and the resistor nonlinearity satisfies some sector conditions. It is stressed that such a condition is met by relevant memristive device models that display rectifying properties for the current due to the diode-like behavior at the interface of the metal and the insulating material. The convergence of RMNNs was analyzed by using the Lyapunov approach in relation to equivalent systems written in the integral flux–charge domain. The main starting point was the property that, while MNNs with ideal memristors admit functions of the state variables that are invariants of motion, the same functions can be used as Lyapunov functions that decrease along the trajectories in the case of RMNNs with rectifying nonlinear resistors. Numerical simulations concerning RMNNs for image processing are presented in the paper to verify the theoretical results on convergence.
Notation: Given a column vector x R n , x refers to the transpose of x. We denote by B ( x , R ) = { y R n : y x < R } an open ball with radius R > 0 centered at x R n . If U R n , U ¯ is the closure of U, while U denotes the boundary of U.

2. Memristor Models

Let v M ( t ) (or i M ( t ) ) be the voltage (or current) of the memristor (Figure 1). In addition, consider the flux φ M ( t ) = t v M ( σ ) d σ and the charge q M ( t ) = t i M ( σ ) d σ . An ideal flux-controlled memristor is defined by the constitutive relation q M = q ^ M ( φ M ) , where q ^ M C 1 ( R ) is the nonlinear flux–charge characteristic. Differentiating in time, we find that an ideal memristor satisfies the state-dependent Ohm’s law:
i M = q ^ M ( φ M ) v M .
Note that the dot refers to the time derivative, while the prime is used to denote the derivative of a function with respect to its argument. The state variable is the flux φ M and q ^ M ( φ M ) is the state-dependent memristor conductance, which is also called the memductance.
The authors of [39] introduced a class of real extended memristors obtained through the parallel connection of an ideal flux-controlled memristor q M = q ^ M ( φ M ) and a nonlinear voltage-controlled resistor i R = i ^ R ( v R ) , where v R (or i R ) is the voltage (or the current) in the resistor, i ^ R is locally Lipschitz in R , and i ^ R ( 0 ) = 0 (Figure 1). Since i = i M + i R and v = v M = v R , the extended memristor satisfies
i = q ^ M ( φ ) v + i ^ R ( v )
where
φ ˙ = φ ˙ M = v .
In this paper, we consider one of the next hypotheses.
Assumption 1.
We have i ^ R ( v R ) 0 for any v R R .
Assumption 2.
There exists γ 0 such that the function i ^ R + ( v R ) i ^ R ( v R ) γ v R satisfies Assumption 1.
Clearly, Assumption 1 is more restrictive than Assumption 2. In addition, note that if i ^ R C 1 ( R ) , Assumption 2 is equivalent to i ^ R ( v ) i ^ R ( 0 ) v 0 for any v R .
Consider, for example, the diode-like piecewise-linear (PWL) function
i ^ R ( v R ) = 0 , v R < V th ζ v R , v R V th
where V th > 0 is the diode threshold voltage and ζ > 0 is the differential conductance when the diode is turned on (Figure 2a). The PWL characteristic (2), which satisfies Assumption 1, is used as an approximation of the Shockley model of a diode given by
i ^ R ( v R ) = I S exp v R η V T 1
where I S is the reverse bias saturation current, V T is the thermal voltage, and η is the ideality factor (Figure 2b). Note that the characteristic (3) satisfies Assumption 2 and i ^ R + ( v R ) = i R ( v R ) ( I S / η V T ) v R . Two more nonlinearities that satisfy Assumption 2 are depicted in Figure 2c,d.
Rectifying the resistor characteristics of the type introduced here is of importance in the modeling of real memristor devices. As a relevant example, the authors of [40] introduced a model with a parallel connection of a memristor and a diode, with the latter accounting for the rectification effect in the off-state due to the Schottky-like transport at one of the metal/oxide memristor interfaces. Several analogous models of barrier-type memristors in which a diode-like nonlinear resistor was introduced for better modeling of the experimentally observed pinched hysteresis loops in response to a zero-mean sinusoidal excitation were reviewed, for instance, in [41,42].
When subjected to a zero-mean sinusoidal input, an ideal memristor displays a hysteresis loop in the voltage–current plane that is symmetric about the origin. It was demonstrated in [39] that, through suitable massaging, the nonlinear resistor characteristic model (1) is capable of reproducing nonsymmetric hysteresis loops that can be observed for some classes of real memristor devices. On the other hand, it should be noted that model (1) has the memristor flux as the internal state variable, as it happens for a flux-controlled ideal memristor. Other types of memristors do not necessarily admit the flux as a state variable, or they may have additional state variables, such as the temperature or geometric quantities that characterize the insulating or conductive part. Finally, it is remarked that model (1) describes a nonvolatile memristor, while some classes of real memristors are volatile, such as thermistors [12].

3. Memristor Neural Network Models

3.1. Ideal Memristor Neural Network Model

The authors of [32,33,35,36,43] considered an array of n interconnected dynamical cells with a structure of an NN. The circuit schematic of a cell is depicted in Figure 3. The i-th cell is obtained via the parallel connection of an ideal capacitor C > 0 and an ideal flux-controlled memristor q i = q ^ M ( φ i ) , that is, the cell is obtained by replacing the linear resistor in a typical cellular neural network (CNN) cell with a memristor (compare Figure 3 with ([23], Figure 3)). This array is called an ideal memristor neural network (IMNN). It is observed that in the cell of Figure 3, the only nonlinearity is the memristor, while in a CNN, the nonlinearity corresponds to the piecewise-linear input-voltage/output-voltage characteristic implemented by an operational amplifier. The interconnection of the j-th cell, j = 1 , , n , with the i-th cell is obtained by means of a linear conductance g i j . Actually, v j is sensed via an operational amplifier operating as a buffer, and a voltage-controlled current source (VCCS) is used to inject the current g i j v j into the i-th cell. A possible circuit implementation of the buffer and VCCS is discussed in the appendix of [23].
An IMNN satisfies the following system of differential equations:
C v ˙ i = q ^ M ( φ i ) v i + j = 1 n g i j v j φ ˙ i = v i
for i = 1 , , n . In vector form, we have
C v ˙ = Q ^ M ( φ ) v + G v φ ˙ = v
where we let v = ( v 1 , , v n ) R n and Q M ( φ ) = diag ( q ^ M ( φ 1 ) , , q ^ M ( φ n ) ) R n × n , and G = [ g i j ] R n × n is the neuron interconnection matrix (the superscript refers to the transpose). This is an autonomous system of 2 n differential equations in the state variables ( v , φ ) R 2 n .
Results on the convergence of solutions of (5) are given in [32] under the assumption that G is symmetric and in [33] when G has non-negative off-diagonal entries, while conditions ensuring multistability are obtained in [35,36]. The global stability of the EP of (5) was established in [43]. The results in these papers were obtained via a reduction-of-order technique and the use of the flux–charge analysis method developed in [14,44].

3.2. Real Memristor Neural Network Model

Ideal memristors are generally not well suited for modeling real memristive devices in nanotechnology. In this paper, this leads us to consider a real memristor neural network (RMNN) in which the ideal memristor in Figure 3 is replaced by a real extended memristor model that is similar to that discussed in Section 2. A schematic of an RMNN cell is depicted in Figure 4.
An RMNN satisfies the following system of differential equations:
C v ˙ i = q ^ M ( φ i ) v i + j = 1 n g i j v j i ^ R ( v i ) φ ˙ i = v i
for i = 1 , , n . In vector form, we have
C v ˙ = Q ^ M ( φ ) v + G v I ^ R ( v ) φ ˙ = v
where I ^ R ( v ) = ( i ^ R ( v 1 ) , , i ^ R ( v n ) ) R n , which is an autonomous system of 2 n differential equations in the state variables ( v , φ ) R 2 n .
In this manuscript, we assume, unless stated otherwise, that the nonlinear resistor characteristic i ^ R satisfies Assumption 1. If, instead, i ^ R satisfies Assumption 2, we are brought back to the previous case by considering the system
C v ˙ i = q ^ M ( φ i ) v i + ( g i i γ ) v i + j = 1 , , n ; j i g i j v j i ^ R + ( v i ) φ ˙ i = v i
for i = 1 , , n , where i ^ R + now satisfies Assumption 1.
The equilibrium points (EPs) of (7) are obtained by letting v ˙ = 0 and φ ˙ = 0 . It is seen that for any φ ¯ R n , ( 0 , φ ¯ ) R 2 n is an EP. This means that (7) has an n-dimensional plane of EPs such that the voltages vanish at any EP.

4. Invariants of Motion and Lyapunov Functions

In this section, we establish some basic facts that will be used in the dynamic analysis of the paper.
Let us first consider the IMNN (5) and define the following n functions Q i : R 2 n R of the state variables ( v , φ ) R 2 n :
Q i ( v , φ ) C v i + q ^ M ( φ i ) j = 1 n g i j φ j
for i = 1 , , n .
Property 1.
Along the solutions of the IMNN (5), we have
Q ˙ i ( v , φ ) = 0
for any t and any i = 1 , , n .
Proof. 
Since v i = φ ˙ i , we have q ^ M ( φ i ) v i = d d t q ^ M ( φ i ) . Therefore, we can rewrite the IMNN equations as
d d t C v i + q ^ M ( φ i ) j = 1 n g i j φ j = 0
for any t and any i = 1 , , n . □
Property 1 means that the functions Q i are n invariants of motion for the IMNN (5). The existence of invariants of motion for the IMNN can be predicted on the basis of the flux–charge analysis method in [44]. However, their explicit expressions were not given in previous papers [32,35].
Let us now consider the RMNN (7). Now, due to the presence of nonlinear resistors i ^ R in the neuron cells, Q i are no longer invariants of motion. However, the following holds.
Property 2.
Suppose that i ^ R satisfies Assumption 1. Then, along the solutions of the RMNN (7), we have
Q ˙ i ( v , φ ) = i ^ R ( v i ) 0
for any t and any i = 1 , , n .
Proof. 
We can rewrite the RMNN equations as
d d t C v i + q ^ M ( φ i ) j = 1 n g i j φ j = i ^ R ( v i )
for any t and any i = 1 , , n . The result follows, since, according to Assumption 1, we have i ^ R ( v i ) 0 . □
Of course, an analogous result holds if i ^ R satisfies Assumption 2. Property 2 shows that if i ^ R satisfies either Assumption 1 or Assumption 2, then Q i are n Lyapunov functions that decrease along the solutions of the RMNN.

5. RMNNs in the Flux–Charge Domain

In this section, we provide two equivalent representations of the RMNN (7) in the integral variables of flux and charge (cf. Section 2), which will be useful in analyzing the convergence of the solutions and for the numerical verification.
We denote by ( v ( t ; v 0 , φ 0 ) , φ ( t ; v 0 , φ 0 ) ) the solution of the RMNN (7) with initial conditions (ICs) ( v 0 , φ 0 ) R 2 n at t = 0 and assume that it is defined for t 0 . Under Assumption 1, due to Property 2, we have
d d t Q i ( v ( t ; v 0 , φ 0 ) , φ ( t ; v 0 , φ 0 ) ) = i ^ R ( v i ( t ; v 0 , φ 0 ) ) 0
for any t and any i = 1 , , n ; so,
Q i ( v ( t ; v 0 , φ 0 ) , φ ( t ; v 0 , φ 0 ) ) Q i ( v 0 , φ 0 ) = q R , i ( t ; v 0 , φ 0 ) 0
where
q R , i ( t ; v 0 , φ 0 ) 0 t i ^ R ( v i ( σ ; v 0 , φ 0 ) ) d σ .
Note that since i R , i 0 , q R , i is a monotonically decreasing function of time.
Let us now consider the system of differential equations
C ϕ ˙ i = q ^ M ( ϕ i ) + j = 1 n g i j ϕ j + Q i ( v 0 , φ 0 ) q R , i ( t ; v 0 , φ 0 ) = q ^ M ( ϕ i ) + j = 1 n g i j ϕ j + Q i ( v ( t ; v 0 , φ 0 ) , φ i ( t ; v 0 , φ 0 ) )
for i = 1 , , n . In vector form, we have
C ϕ ˙ = Q ^ M ( ϕ ) + G ϕ + Q ( v 0 , φ 0 ) Q R ( t ; v 0 , φ 0 ) = Q ^ M ( ϕ ) + G ϕ + Q ( v ( t ; v 0 , φ 0 ) , φ ( t ; v 0 , φ 0 ) )
where ϕ = ( ϕ 1 , , ϕ n ) R n and Q R ( t ; v 0 , φ 0 ) = ( q R , 1 ( t ; v 0 , φ 0 ) , , q R , n ( t ; v 0 , φ 0 ) ) R n . Note that (15) is a non-autonomous system of n differential equations in the state variables ϕ R n and that the time-dependent forcing term Q R depends on v 0 and φ 0 .
We denote by ϕ ( t ; φ 0 ) the solution of (15) with IC φ 0 R n at t = 0 and assume that it is defined for t 0 . The next result gives a link between the solutions of (15) and (7).
Property 3.
We have
ϕ ( t ; φ 0 ) = φ ( t ; v 0 , φ 0 )
and, conversely,
( v ( t ; v 0 , φ 0 ) , φ ( t ; v 0 , φ 0 ) ) = ( ϕ ˙ ( t ; φ 0 ) , ϕ ( t ; φ 0 ) )
for any t 0 .
Proof. 
Integrating both sides of the first equation of (7), we get
C φ ˙ C v 0 = Q ^ M ( φ ) + Q ^ M ( φ 0 ) + G φ G φ 0 0 t I ^ R ( v ( σ ; v 0 , φ 0 ) ) d σ
where we consider that
0 t Q ^ M ( φ ( σ ) ) v ( σ ) d σ = φ 0 φ ( t ) Q ^ M ( θ ) d θ = Q ^ M ( φ ( t ) ) Q ^ M ( φ 0 )
and v = φ ˙ . Taking (9) into account, we have Q ( v 0 , φ 0 ) = C v 0 + Q ^ M ( φ 0 ) G φ 0 ; hence,
C φ ˙ = Q ^ M ( φ ) + G φ + Q ( v 0 , φ 0 ) Q R ( t ; v 0 , φ 0 ) .
Let ( v ( t ; v 0 , φ 0 ) , φ ( t ; v 0 , φ 0 ) ) be the solution of (7) with ICs ( v 0 , φ 0 ) R 2 n . Due to the uniqueness of the solution to a Cauchy problem, it can be easily checked that φ ( t ; v 0 , φ 0 ) is also the solution of (15) with the IC φ 0 , i.e., ϕ ( t ; φ 0 ) = φ ( t ; v 0 , φ 0 ) .
Differentiating both sides of (15), denoting w = ϕ ˙ , and taking (13) into account, we obtain
C w ˙ = Q ^ M ( ϕ ) w + G w I ^ R ( w ) ϕ ˙ = w .
Now, let ϕ ( t ; φ 0 ) be the solution of (15) with the IC φ 0 R n . Then, ( ϕ ˙ ( t ; φ 0 ) , ϕ ( t ; φ 0 ) ) is the solution of (7) with the ICs ( ϕ ˙ ( 0 , φ 0 ) , φ 0 ) . From (14), we have C ϕ ˙ ( 0 ; φ 0 ) = Q ^ M ( ϕ ( 0 ; φ 0 ) ) + G ϕ ( 0 ; φ 0 ) + Q ( v 0 , φ 0 ) and, since ϕ ( 0 , φ 0 ) = φ 0 and Q ( v 0 , φ 0 ) = C v 0 + Q ^ M ( φ 0 ) G φ 0 , we obtain φ ˙ ( 0 ; φ 0 ) = v 0 . Therefore, we have verified that ( v ( t ; v 0 , φ 0 ) , φ ( t ; v 0 , φ 0 ) ) = ( ϕ ˙ ( t ; φ 0 ) , ϕ ( t ; φ 0 ) ) .  □
Consider now
C ψ ˙ = Q ^ M ( ψ ) + G ψ + Q ( v 0 , φ 0 ) Q R Q ˙ R = I ^ R 1 C ( Q ^ M ( ψ ) + G ψ + Q ( v 0 , φ 0 ) Q R )
where ψ , Q R R n . This is an autonomous system of 2 n differential equations in the state variables ( ψ , Q R ) R 2 n .
Let ( ψ ( t ; φ 0 , 0 ) , Q R ( t ; φ 0 , 0 ) ) denote the solution of (16) with ICs ( φ 0 , 0 ) R 2 n . The next results establish links between the solutions of (16) and (15) and those of (16) and (7).
Property 4.
We have
( ψ ( t ; φ 0 , 0 ) , Q R ( t ; φ 0 , 0 ) ) = ( ϕ ( t ; φ 0 ) , 0 t I ^ R ( ϕ ˙ ( σ ; φ 0 ) ) d σ )
and, conversely,
ϕ ( t ; φ 0 ) = ψ ( t ; φ 0 , 0 )
for any t 0 .
Proof. 
Let ϕ ( t ; φ 0 ) be the solution of (15) with the IC φ 0 at t = 0 . We have
ϕ ˙ = 1 C ( Q ^ M ( ϕ ) + G ϕ + Q ( v 0 , φ 0 ) Q R ( t ; v 0 , φ 0 ) ) .
Due to Property 3, v ( t ; v 0 , φ 0 ) = ϕ ˙ ( t ; φ 0 ) . Differentiating both sides of (13), we obtain Q ˙ R ( · ; v 0 , φ 0 ) ) = I ^ R ( ϕ ˙ ( · ; φ 0 ) ) . Taking into account (17) and Property 3, we obtain the Cauchy problem:
C ϕ ˙ = Q ^ M ( ϕ ) + G ϕ + Q ( v 0 , φ 0 ) Q R Q ˙ R = I ^ R 1 C ( Q ^ M ( ϕ ) + G ϕ + Q ( v 0 , φ 0 ) Q R )
with the IC ( φ 0 , 0 ) . As a consequence, ( ϕ ( t ; v 0 ) , 0 t I ^ R ( ϕ ˙ ( σ ; φ 0 ) ) d σ ) is the solution of (16) with the IC ( φ 0 , 0 ) .
Now, let ( ψ ( t ; φ 0 , 0 ) , Q R ( t ; φ 0 , 0 ) ) be the solution of (16) with the ICs ( φ 0 , 0 ) . By noting that Q R ( t ; φ 0 , 0 ) = 0 , taking (13) into account, we can rewrite the first equation of (16) as
ψ ˙ = Q ^ M ( ψ ) + G ψ + Q ( v 0 , φ 0 ) 0 t I ^ R ( ψ ˙ ( σ ; φ 0 , 0 ) ) d σ .
As a consequence, ψ ( t ; φ 0 , 0 ) is also a solution of (15) with the IC φ 0 . □
Property 5.
We have
( ψ ( t ; φ 0 , 0 ) , Q R ( t ; φ 0 , 0 ) ) = ( φ ( t ; v 0 , φ 0 ) , 0 t I ^ R ( v ( σ ; v 0 , φ 0 ) ) d σ )
and, conversely,
( v ( t ; v 0 , φ 0 ) , φ ( t ; v 0 , φ 0 ) ) = ( ψ ˙ ( t ; φ 0 , 0 ) , ψ ( t ; φ 0 , 0 ) )
for any t 0 .
Proof. 
The result is a straightforward consequence of Properties 3 and 4. □

6. Main Results on the Convergence of RMNNs

Suppose that Assumption 1 is satisfied and consider a solution ( v ( t ; v 0 , φ 0 ) , φ ( t ; v 0 , φ 0 ) ) of the RMNN (7) that is defined for t 0 . Since q R , i in (13) is monotonically non-increasing, for any i = 1 , , n , we have that either q R , i ( t ; v 0 , φ ) as t or q R , i ( t ; v 0 , φ ) q R , i ( v 0 , φ 0 ) > as t .
Property 6.
If the solution ( v ( t ; v 0 , φ 0 ) , φ ( t ; v 0 , φ 0 ) ) of the RMNN (7) is defined and bounded for t 0 , then we have
lim t ( q R , i ( t ; v 0 , φ ) ) = q R , i ( v 0 , φ 0 ) >
for i = 1 , , n .
Proof. 
From Properties 3–5, φ ( t ; v 0 , φ 0 ) = ϕ ( t ; φ 0 ) = ψ ( t ; φ 0 , 0 ) and v ( t ; v 0 , φ 0 ) = φ ˙ ( t ; v 0 , φ 0 ) = ϕ ˙ ( t ; φ 0 ) = ψ ˙ ( t ; φ 0 , 0 ) . Additionally, Q R ( t ; v 0 , φ 0 ) = Q R ( t ; φ 0 , 0 ) . Now, consider (16). Since ( v ( t ; v 0 , φ 0 ) , φ ( t ; v 0 , φ 0 ) ) is bounded for t 0 , and ψ ( t ; φ 0 , 0 ) , ψ ˙ ( t ; φ 0 , 0 ) , Q ^ R ( ψ ( t ; φ 0 , 0 ) ) , and G ψ ( t ; φ 0 , 0 ) are bounded for t 0 ; this implies that Q R ( t ; φ 0 , 0 ) and Q ( t ; v 0 , φ 0 ) are bounded for t 0 . Since Q ( t ; v 0 , φ 0 ) is monotonically non-increasing for t 0 , there exists Q R ( v 0 , φ 0 ) > such that lim t Q R ( t ; v 0 , φ 0 ) = Q R ( v 0 , φ 0 ) . □
Under the assumptions of Property 6, we can consider the following asymptotic system in the flux–charge domain:
C Φ ˙ = Q ^ M ( Φ ) + G Φ + Q 0 ( v 0 , φ 0 ) Q R ( v 0 , φ 0 ) = Q ^ M ( Φ ) + G Φ + Q ( v 0 , φ 0 )
where
Q R ( v 0 , φ 0 ) = ( q R , 1 ( v 0 , φ 0 ) , , q R , n ( v 0 , φ 0 ) ) = 0 I ^ R ( v ( σ ; v 0 , φ 0 ) ) d σ R n
and Q ( v 0 , φ 0 ) = lim t Q ( t ; v 0 , φ 0 ) R n .
The next theorem gives the main convergence result in the paper.
Theorem 1.
Assume for the RMNN that the interconnection matrix G is symmetric. In addition, suppose that the solution ( v ( t ; v 0 , φ 0 ) , φ ( t ; v 0 , φ 0 ) ) of the RMNN (7) is defined and bounded for t 0 and that the EPs of the asymptotic system (18) are isolated. Then:
(1) 
ϕ ( t ; φ 0 ) converges to η R n as t , where η is an EP of (18);
(2) 
( v ( t ; v 0 , φ 0 ) , φ ( t ; v 0 , φ 0 ) ) converges to the EP ( 0 , η ) R 2 n of (7) as t ;
(3) 
( ψ ( t ; φ 0 , 0 ) , Q R ( t ; φ 0 , 0 ) ) converges to the EP ( η , Q R ( v 0 , φ 0 ) ) of (16) as t .
We provide some remarks before giving the proof of the theorem.
  • Theorem 1 can be considered an extension of the convergence results obtained in [32] for IMNNs to NNs with real memristors. Basically, Theorem 1 states that the presence of rectifying nonlinear resistors in the neuron model does not destroy the property of convergence that holds for symmetric IMNNs.
  • It is worth remarking that the assumption of isolated EPs for the asymptotic system (18) is not restrictive. Indeed, in the case in which the system has non-isolated EPs, the vector field defining (18) can be changed by an arbitrarily small amount to obtain isolated EPs. This can be shown via an argument based on the Sard theorem analogous to that used to prove ([32], Property 2) (details are omitted).
  • The convergence result in Theorem 1 has been proven via a Lyapunov approach applied to the system describing the RMNN in the flux–charge (integral) domain. A crucial property is that the functions Q i , i = 1 , , n , in (9) can be used as Lyapunov functions that decrease along the RMNN equations in the voltage–current domain. This enables an association of an asymptotic system in the flux–charge domain—to which the Lyapunov approach can be effectively used to prove convergence—with an RMNN.
  • From an the point of view of applications, an RMNN can be used to process signals and images in the flux–charge domain, i.e., the dynamics of the memristor fluxes can be used instead of using the dynamics of capacitor voltages, as happens for traditional memristor-less NNs operating in the voltage–current domain. A simple application to an image processing task will be illustrated in Section 7. We stress that in an RMNN, memristors are used in the analog computation, but they are also able to store the computational result, i.e., the asymptotic values of fluxes, in accordance with the principle of in-memory computing.
Proof of Theorem 1.
(1) Suppose, for simplicity, that C = 1 . Let us consider for (15) the candidate Lyapunov function
E ( ϕ ) = i = 1 n 0 ϕ i q ^ M ( σ ) d σ 1 2 ϕ G ϕ ϕ ( Q 0 ( v 0 , φ 0 ) Q R ( v 0 , φ 0 ) )
where Q R ( v 0 , φ 0 ) is defined in Property 6. Since, by assumption, φ ( t ; v 0 , φ 0 ) is bounded for t 0 , due to Property 3, we have that ϕ ( t ; φ 0 ) is bounded for t 0 and, since E is continuous, E ( ϕ ( t ; v 0 ) ) is bounded from below for t 0 .
Accounting for the symmetry of G, we have
E ( ϕ ) = Q ^ M ( ϕ ) G ϕ Q ( v 0 , φ 0 ) + Q R ( v 0 , φ 0 ) .
Hence, (15) can be written as
ϕ ˙ = E ( ϕ ) Q R ( t ; v 0 , φ 0 ) + Q R ( v 0 , φ 0 )
while the asymptotic system (18) is
Φ ˙ = E ( Φ ) .
Then, the time derivative of E along the solutions of (20) is given by
E ˙ ( ϕ ) = E ( ϕ ) ( E ( ϕ ) Q R ( t ; v 0 , φ 0 ) + Q R ( v 0 , φ 0 ) ) = E ( ϕ ) 2 E ( ϕ ) ( Q R ( t ; v 0 , φ 0 ) Q R ( v 0 , φ 0 ) ) .
We choose r > 0 such that ϕ ( t ; ϕ 0 ) B ( 0 , r ) for any t 0 . Let us first show that (21) has at least an EP in B ( 0 , R ) ¯ , where R > r . The EPs of (21) are the points where E = 0 . Suppose, for contradiction, that (21) has no EPs in B ( 0 , r ) ¯ . Since E is continuous and E 0 , then E ( Φ ) 2 m 2 < 0 for any Φ B ( 0 , r ) ¯ . Moreover, E ( Φ ) M if Φ B ( 0 , r ) ¯ . Since Q R ( t ; v 0 , φ 0 ) is monotonically non-increasing for t 0 and it tends towards Q R ( v 0 , φ 0 ) as t , there exists t ¯ such that Q R ( t ; v 0 , φ 0 ) Q R ( v 0 , φ 0 ) ) < m 2 / ( 2 M ) for any t t ¯ . Then, for t t ¯ , E ˙ ( ϕ ( t ; φ 0 ) ) E ( ϕ ( t ; φ 0 ) ) 2 + E ( ϕ ( t ; φ 0 ) ) Q R ( t ; v 0 , φ 0 ) Q R ( v 0 , φ 0 ) < m 2 / 2 < 0 . Therefore, E ( ϕ ( t ; φ 0 ) ) as t , which is a contradiction.
Since the EPs of (18) are isolated, it follows that there exist finite EPs η 1 , , η p of (18) in B ( 0 , R ) . We choose ϵ ¯ > 0 such that B ( η i , ϵ ¯ ) B ( 0 , R ) and B ( η i , ϵ ¯ ) B ( η j , ϵ ¯ ) = for any i , j = 1 , , p . We want to prove that there exists i ¯ { 1 , , p } such that for any 0 < ϵ ϵ ¯ , there exists t ϵ 0 such that ϕ ( t ; φ 0 ) B ( η i ¯ , ϵ ) for any t t ϵ . This, in turn, implies the convergence of ϕ ( · ; φ 0 ) to the EP η i ¯ .
For any λ > 0 , we let
I λ = i = 1 p B ( η i , λ ) B ( 0 , R )
and
O λ = B ( 0 , R ) I λ .
Let us show the next preliminary property.
Property 7.
Suppose that the assumptions of Theorem 1 are satisfied. Then, for any 0 < λ < ϵ ¯ , the following hold:
(a) There exist α 2 ( λ ) > 0 and t λ 0 such that for t t λ , we have
E ˙ ( ϕ ) α 2 ( λ ) < 0
if ϕ O λ ¯ ;
(b) we have
max ϕ I λ ¯ E ( ϕ ) min ϕ I λ ¯ E ( ϕ ) β 2 ( λ )
where β 2 ( λ ) 0 as λ 0 .
Proof. 
(a) Since E is continuous and there is no EP of (18) in O λ ¯ , there exists α 2 ( λ ) > 0 such that E ( ϕ ) 2 2 α 2 ( λ ) < 0 if ϕ O λ ¯ . Taking into account (19), we have, for any ϕ O λ ¯ ,
E ( ϕ ) M ^ λ + R G + Q ( v 0 , φ 0 ) + Q R ( v 0 , φ 0 )
where M ^ λ = max ϕ O λ ¯ Q ^ M ( ϕ ) < . Since Q R ( t ; v 0 , φ 0 ) is monotonically non-increasing for t 0 and it tends towards Q R ( v 0 , φ 0 ) as t , there exists t λ such that
Q R ( t ; v 0 , φ 0 ) Q R ( v 0 , φ 0 ) ) < α 2 ( λ ) / ( M ^ λ + R G + Q ( v 0 , φ 0 ) + Q R ( v 0 , φ 0 ) )
for any t t λ . Then, taking (22) into account, we obtain
E ˙ ( ϕ ) E ( ϕ ) 2 + E ( ϕ ) Q R ( t ; v 0 , φ 0 ) Q R ( v 0 , φ 0 ) < α 2 ( λ ) < 0
for all t t λ .
(b) Since ϕ I λ ¯ , there exists j ¯ { 1 , , p } such that ϕ = η j ¯ + Δ j ¯ , with Δ j ¯ B ( 0 , λ ) . We can write E ( ϕ ) as
E ( η j ¯ + Δ j ¯ ) = i = 1 n 0 η j ¯ , i + Δ j ¯ , i q ^ M ( σ ) d σ 1 2 ( η j ¯ + Δ j ¯ ) G ( η j ¯ + Δ j ¯ ) ( η j ¯ + Δ j ¯ ) ( Q 0 ( v 0 , φ 0 ) Q R ( v 0 , φ 0 ) ) .
The following inequalities hold true:
max Δ j ¯ B ( 0 , λ ) ¯ E ( η j ¯ + Δ j ¯ ) i = 1 n 0 η j ¯ , i q ^ M ( σ ) d σ + λ i = 1 n max σ [ η j ¯ , i λ , η j ¯ , i + λ ] | q ^ M ( σ ) | 1 2 η j ¯ G η j ¯ + ρ ( G ) λ η j ¯ + 1 2 ρ ( G ) λ 2 η j ¯ ( Q 0 ( v 0 , φ 0 ) Q R ( v 0 , φ 0 ) ) + λ Q 0 ( v 0 , φ 0 ) Q R ( v 0 , φ 0 )
and
min Δ j ¯ B ( 0 , λ ) ¯ E ( η j ¯ + Δ j ¯ ) i = 1 n 0 η j ¯ , i q ^ M ( σ ) d σ λ i = 1 n max σ [ η j ¯ , i λ , η j ¯ , i + λ ] | q ^ M ( σ ) | 1 2 η j ¯ G η j ¯ ρ ( G ) λ η j ¯ 1 2 ρ ( G ) λ 2 η j ¯ ( Q 0 ( v 0 , φ 0 ) Q R ( v 0 , φ 0 ) ) λ Q 0 ( v 0 , φ 0 ) Q R ( v 0 , φ 0 )
where ρ ( G ) is the spectral radius of G. These imply that
max Δ j ¯ B ( 0 , λ ) ¯ E ( η j ¯ + Δ j ¯ ) min Δ j ¯ B ( 0 , λ ) ¯ E ( η j ¯ + Δ j ¯ ) λ 2 η j ¯ ρ ( G ) + 2 i = 1 n max σ [ η j ¯ , i λ , η j ¯ , i + λ ] | q ^ M ( σ ) | + λ ρ ( G ) λ + 2 Q 0 ( v 0 , φ 0 ) Q R ( v 0 , φ 0 ) β j ¯ 2 ( λ ) .
It can be easily checked that β j ¯ 2 ( λ ) 0 as λ 0 . To complete the proof, it suffices to pick
β 2 ( λ ) = 2 λ max j ¯ = 1 , , p ρ ( G ) η j ¯ + i = 1 n max σ [ η j ¯ , i λ , η j ¯ , i + λ ] | q ^ M ( σ ) | + λ ρ ( G ) λ + 2 Q 0 ( v 0 , φ 0 ) Q R ( v 0 , φ 0 ) .
 □
For any i { 1 , , p } , we consider B ( η i , ϵ ) , B ( η i , ϵ / 2 ) , and B ( η i , ρ ) , where ρ ϵ / 2 . Moreover, we consider the sets O ϵ / 2 and O ρ . By applying Property 7 with λ = ϵ / 2 , we find that there exists t ϵ / 2 such that t t ϵ / 2 implies E ˙ ( ϕ ) α 2 ( ϵ / 2 ) < 0 if ϕ O ϵ / 2 ¯ . In particular, this is true if ϕ B ( η i , ϵ ) B ( η i , ϵ / 2 ) ¯ and i = 1 , , p . Since β 2 ( λ ) 0 as λ 0 , we can choose ρ and δ > 0 such that
ϵ Υ α 2 ϵ 2 > β 2 ( ρ ) + δ
where we let
Υ sup ϕ B ( 0 , R ) ¯ , t 0 ϕ ˙ ( t ) E ( ϕ ) + 2 Q R ( v 0 , φ 0 ) M ^ ϵ / 2 + G R + Q ( v 0 , φ 0 ) + 3 Q R ( v 0 , φ 0 )
where M ^ ϵ / 2 = max ϕ O ϵ / 2 ¯ Q ^ M ( ϕ ) . Due to Property 7, with λ = ρ , we have that there exists t ρ 0 such that for t t ρ , we have E ˙ ( ϕ ) α 2 ( ρ ) < 0 if ϕ O ρ ¯ . In particular, this is true if ϕ B ( η i , ϵ / 2 ) B ( η i , ρ ) ¯ and i = 1 , , n .
We say that ϕ ( · , φ 0 ) undergoes an input–output event if for some i { 1 , , p } , there exist t in < t + < t out such that ϕ ( t in , φ 0 ) B ( η i , ϵ ) , ϕ ( t + , φ 0 ) B ( η i , ρ ) , and ϕ ( t out , φ 0 ) B ( η i , ϵ ) . We assume that t max { t ϵ / 2 , t ρ } . Then, it can be easily verified that any input–output event leads to a net decrease in E ( ϕ ( t , φ 0 ) ) . Indeed, E ( ϕ ( t , φ 0 ) ) decreases as long as ϕ ( t , φ 0 ) B ( η i , ϵ ) B ( η i , ρ ) ¯ , while it might increase if ϕ ( t , φ 0 ) B ( η i , ρ ) . Property 7b provides β 2 ( ρ ) as an upper bound to this increase. On the other hand, the decrease in E ( ϕ ( · , φ 0 ) ) when ϕ ( t , φ 0 ) B ( η i , ϵ ) B ( η i , ρ ) ¯ will be larger than the one it undergoes when ϕ ( t , φ 0 ) B ( η i , ϵ ) B ( η i , ϵ / 2 ) ¯ , with the latter variation satisfying the condition
| Δ E ( ϕ ( t , φ 0 ) ) | ϵ Υ α 2 ϵ 2 .
Then, we obtain
E ( ϕ ( t out , φ 0 ) ) E ( ϕ ( t in , φ 0 ) ) ϵ Υ α 2 ϵ 2 + β δ < 0 .
To conclude the proof, note that there are two possibilities.
(a) The solution ϕ ( · , φ 0 ) undergoes infinite input–output events. For any event, we have a net decrease in E ( · , φ 0 ) that is equal at least to δ . Moreover, since E ˙ ( ϕ ) < α 2 ( ρ ) < 0 in O ρ ¯ , we arrive at the conclusion that E ( ϕ ( t ; ϕ ) ) as t . However, this is a contradiction.
(b) The solution ϕ ( · , φ 0 ) undergoes finite input–output events. Now, we have two possibilities. (b1) ϕ ( t ; φ 0 ) belongs to O ρ for all large times t t ^ . However, since E ˙ ( ϕ ) α 2 ( ρ ) in O ρ ¯ , we have that E ( ϕ ( t ; φ 0 ) ) as t , which is a contradiction. (b2) For some i ¯ , we have ϕ ( t ; φ 0 ) B ( η i ¯ , ϵ ) for all large t.
This concludes the proof that ϕ ( t ; φ 0 ) η i ¯ for some i ¯ { 1 , , n } as t .
(2) First, note that, since ϕ ( · ; φ 0 ) converges to an EP of (18), then from (15), we obtain that ϕ ˙ ( t ; φ 0 ) 0 as t . Then, the result is a direct consequence of Property 3.
(3) This follows directly from (1) and Propertiess 4 and 6. □

7. Numerical Simulations and Application

Let us consider a two-dimensional cellular neural network (CNN) array with N × N cells and real memristors, as in (1). After ordering the cells row-wise or column-wise, the CNN can be described by the RMNN (7) with n = N × N . Suppose that the ideal memristor characteristic q ^ M is a C 1 approximation of the PWL function
q M = q ^ M ( φ M ) = b φ M + 1 2 ( a b ) ( | φ M + 1 | | φ M 1 | )
with a = 1 and b = 4 . Moreover, we assume that the rectifying nonlinear resistor is the PWL diode (2) with V th = 0.7 and λ = 0.2 , and we let C = 0.1 .
We consider the application of the CNN to a simple image processing task, i.e., the extraction of the horizontal lines of a 2D image. In particular, we use the symmetric cloning template
A = [ 0.6 1.2 0.6 ]
which is a slight variant of that proposed in [45] for horizontal line detection. This leads to a symmetric matrix G for the RMNN (7), which can be explicitly found via the technique in ([32], App. C).
We simulated the dynamics of the CNN using MATLAB. The initial image, which is given in Figure 5a, was provided as the input to the CNN via the initial conditions φ 0 for the ideal memristor fluxes. A white pixel corresponds to φ 0 , i 1 , while a black pixel denotes φ 0 , j 1 . Gray pixels represent levels of flux between 1 and 1. The initial voltages v 0 , i of the capacitors were chosen so that Q ( v 0 , φ 0 ) = 0 (cf. [39]), i.e., from (9),
v 0 = 1 C [ G φ 0 Q ^ M ( φ 0 ) ] .
Figure 5 shows snapshots of the time evolutions of the CNN fluxes obtained through numerical simulation of (16). It was seen that the CNN was able to correctly extract the horizontal lines of the initial image. There was only one error in the pixel ( 13 , 13 ) . Figure 6a (or Figure 6b) depicts the time evolution of the fluxes ψ i ( · ; φ 0 , 0 ) (or nonlinear resistor charges Q R , i ( · ; φ 0 , 0 ) ) for the 13th row of the CNN. It was seen that the fluxes were convergent, as predicted by Theorem 1, while Q R , i ( · ; φ 0 , 0 ) = Q i ( v 0 , φ 0 ) were monotonically nondecreasing, as predicted by Property 2. Finally, Figure 6c shows the memristor fluxes φ i ( · ; v 0 , φ 0 ) , while Figure 6d shows the capacitor voltages v i ( · ; v 0 , φ 0 ) obtained via the numerical simulation of (7). Note that, in agreement with Theorem 1, all voltages vanished asymptotically. Furthermore, we showed in Property 5 that φ i ( · ; v 0 , φ 0 ) coincides with ψ i ( · ; φ 0 , 0 ) . The validity of this result can be checked by noting that the time-domain behaviors in Figure 6a,c are the same.
In order for interested readers to verify the presented results in detail, the MATLAB code used in the numerical simulations in this paper has been made available on Code Ocean platform (DOI: 10.24433/CO.4341689.v1).

8. Conclusions

The paper studied trajectory convergence for a class of NNs with real extended memristors with rectifying characteristics (RMMNs). The memristors, which were originally proposed in [39], are given by the parallel connection of an ideal flux-controlled memristor and a voltage-controlled nonlinear resistor. The paper established some fundamental results on trajectory convergence under the assumption that the interconnection matrix satisfies a symmetry condition. This result generalizes previous results on convergence for memristor NNs with ideal memristors to the considered class of real memristors [32]. To the authors’ knowledge, the obtained results are the only available ones on the convergence of feedback NNs with real memristors. The main idea in proving convergence is to use the functions of the state variables that are invariants of motion in the ideal memristor case as Lyapunov functions for RMNNs. This, in combination with a reduction-of-order technique in which the RMNN dynamics are expressed in the integral (flux–charge) domain, has enabled us to show that when the interconnection matrix is symmetric, any bounded solution necessarily converges toward an equilibrium point. The convergence results have been illustrated by applying RMNNs to the solution of some simple image processing tasks. Future work will be devoted to investigating whether we can also obtain convergence results for the considered RMNNs for some classes of nonsymmetric interconnection matrices. Moreover, we will investigate whether it is possible to address convergence for NNs with other classes of real memristors for which the flux is not the internal state variable.

Author Contributions

Conceptualization, M.D.M., M.F., R.M., L.P. and A.T.; methodology, M.D.M., M.F., R.M., L.P. and A.T.; formal analysis, M.D.M., M.F., R.M., L.P. and A.T.; writing—original draft preparation, M.D.M., M.F., R.M., L.P. and A.T.; writing—review and editing, M.D.M., M.F., R.M., L.P. and A.T. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the Italian Ministry of Education, University, and Research (MIUR) grant PRIN 2017LSCR4K 002 (“Analogue COmputing with Dynamic Switching Memristor Oscillators: Theory, Devices and Applications (COSMO)”).

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest. The funders had no role in the design of the study; in the collection, analyses, or interpretation of data; in the writing of the manuscript, or in the decision to publish the results.

References

  1. Li, S.; Xu, L.D.; Zhao, S. The internet of things: A survey. Inf. Syst. Front. 2015, 17, 243–259. [Google Scholar] [CrossRef]
  2. Waldrop, M.M. The chips are down for Moore’s law. Nat. News 2016, 530, 144. [Google Scholar] [CrossRef] [Green Version]
  3. Williams, R.S. What’s next? [The end of Moore’s law]. Comp. Sci. Eng. 2017, 19, 7–13. [Google Scholar] [CrossRef]
  4. Krestinskaya, O.; James, A.P.; Chua, L.O. Neuromemristive circuits for edge computing: A review. IEEE Trans. Neural Netw. Learn. Syst. 2019, 31, 4–23. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  5. Yang, J.J.; Williams, R.S. Memristive devices in computing system: Promises and challenges. ACM J. Emerg. Technol. Comput. Syst. (JETC) 2013, 9, 11. [Google Scholar] [CrossRef]
  6. Zidan, M.A.; Strachan, J.P.; Lu, W.D. The future of electronics based on memristive systems. Nat. Electron. 2018, 1, 22. [Google Scholar] [CrossRef]
  7. Sebastian, A.; Gallo, M.L.; Burr, G.W.; Kim, S.; BrightSky, M.; Eleftheriou, E. Tutorial: Brain-inspired computing using phase-change memory devices. J. Appl. Phys. 2018, 124, 111101. [Google Scholar] [CrossRef] [Green Version]
  8. Li, C.; Wang, Z.; Rao, M.; Belkin, D.; Song, W.; Jiang, H.; Yan, P.; Li, Y.; Lin, P.; Hu, M.; et al. Long short-term memory networks in memristor crossbar arrays. Nat. Mach. Intell. 2019, 1, 49. [Google Scholar] [CrossRef] [Green Version]
  9. Xia, Q.; Yang, J.J. Memristive crossbar arrays for brain-inspired computing. Nat. Mater. 2019, 18, 309–323. [Google Scholar] [CrossRef]
  10. Ielmini, D.; Pedretti, G. Device and circuit architectures for in-memory computing. Adv. Intell. Syst. 2020, 2, 2000040. [Google Scholar] [CrossRef]
  11. Sebastian, A.; Gallo, M.L.; Khaddam-Aljameh, R.; Eleftheriou, E. Memory devices and applications for in-memory computing. Nat. Nanotechnol. 2020, 15, 529–544. [Google Scholar] [CrossRef] [PubMed]
  12. Chua, L.O.; Kang, S.M. Memristive devices and systems. Proc. IEEE 1976, 64, 209–223. [Google Scholar] [CrossRef]
  13. Chua, L. Everything you wish to know about memristors but are afraid to ask. Radioengineering 2015, 24, 319–368. [Google Scholar] [CrossRef]
  14. Corinto, F.; Forti, M.; Chua, L.O. Nonlinear Circuits and Systems with Memristors; Springer Nature Switzerland AG: Cham, Switzerland, 2021. [Google Scholar]
  15. Chua, L.O. Memristor-The missing circuit element. IEEE Trans. Circuit Theory 1971, 18, 507–519. [Google Scholar] [CrossRef]
  16. Mazumder, P.; Kang, S.M.; Waser, R. Special issue on memristors: Devices, models, and applications. Proc. IEEE 2012, 100, 1911–1919. [Google Scholar] [CrossRef]
  17. Ascoli, A.; Corinto, F.; Senger, V.; Tetzlaff, R. Memristor model comparison. IEEE Circuits Syst. Mag. 2013, 13, 89–105. [Google Scholar] [CrossRef]
  18. Kvatinsky, S.; Friedman, E.G.; Kolodny, A.; Weiser, U.C. TEAM: Threshold adaptive memristor model. IEEE Trans. Circuits Syst. I Reg. Pap. 2013, 60, 211–221. [Google Scholar] [CrossRef]
  19. Hajri, B.; Aziza, H.; Mansour, M.M.; Chehab, A. RRAM device models: A comparative analysis with experimental validation. IEEE Access 2019, 7, 168963–168980. [Google Scholar] [CrossRef]
  20. Cohen, M.A.; Grossberg, S. Absolute stability of global pattern formation and parallel memory storage by competitive neural networks. IEEE Trans. Syst. Man Cybern. 1983, 13, 815–825. [Google Scholar] [CrossRef]
  21. Hopfield, J.J. Neurons with graded response have collective computational properties like those of two-state neurons. Proc. Nat. Acad. Sci. USA 1984, 81, 3088–3092. [Google Scholar] [CrossRef]
  22. Hirsch, M. Convergent activation dynamics in continuous time networks. Neural Netw. 1989, 2, 331–349. [Google Scholar] [CrossRef] [Green Version]
  23. Chua, L.O.; Yang, L. Cellular neural networks: Theory. IEEE Trans. Circuits Syst. 1988, 35, 1257–1272. [Google Scholar] [CrossRef]
  24. Zurada, J. Introduction to Artificial Neural Systems; West Publishing Co.: Eagan, MN, USA, 1992. [Google Scholar]
  25. Haykin, S. Neural Networks: A Comprehensive Foundation; Prentice-Hall: Hoboken, NJ, USA, 1999. [Google Scholar]
  26. Liu, P.; Wang, J.; Zeng, Z. An overview of the stability analysis of recurrent neural networks with multiple equilibria. IEEE Trans. Neural Netw. Learn. Syst. 2021. [Google Scholar] [CrossRef] [PubMed]
  27. Michel, A.N.; Farrell, J.A.; Porod, W. Qualitative analysis of neural networks. IEEE Trans. Circuits Syst. 1989, 36, 229–243. [Google Scholar] [CrossRef]
  28. Yang, S.; Liu, Q.; Wang, J. A collaborative neurodynamic approach to multiple-objective distributed optimization. IEEE Trans. Neural Netw. Learn. Syst. 2018, 29, 981–992. [Google Scholar] [CrossRef] [PubMed]
  29. Arik, S. New criteria for stability of neutral-type neural networks with multiple time delays. IEEE Trans. Neural Netw. Learn. Syst. 2020, 31, 1504–1513. [Google Scholar] [CrossRef]
  30. Di Marco, M.; Forti, M.; Grazzini, M.; Pancioni, L. Limit set dichotomy and multistability for a class of cooperative neural networks with delays. IEEE Trans. Neural Netw. Learn. Syst. 2012, 23, 1473–1485. [Google Scholar] [CrossRef]
  31. Forti, M.; Tesi, A. Absolute stability of analytic neural networks: An approach based on finite trajectory length. IEEE Trans. Circuits Syst. I 2004, 51, 2460–2469. [Google Scholar] [CrossRef]
  32. Di Marco, M.; Forti, M.; Pancioni, L. Complete stability of feedback CNNs with dynamic memristors and second-order cells. Int. J. Circuit Theory Appl. 2016, 44, 1959–1981. [Google Scholar] [CrossRef]
  33. Di Marco, M.; Forti, M.; Pancioni, L. Convergence and multistability of nonsymmetric cellular neural networks with memristors. IEEE Trans. Cybern. 2017, 47, 2970–2983. [Google Scholar] [CrossRef]
  34. Di Marco, M.; Forti, M.; Pancioni, L. Memristor standard cellular neural networks computing in the flux–charge domain. Neural Netw. 2017, 93, 152–164. [Google Scholar] [CrossRef]
  35. Deng, K.; Zhu, S.; Bao, G.; Fu, J.; Zeng, Z. Multistability of dynamic memristor delayed cellular neural networks with application to associative memories. IEEE Trans. Neural Netw. Learn. Syst. 2021. [Google Scholar] [CrossRef] [PubMed]
  36. Deng, K.; Zhu, S.; Dai, W.; Yang, C.; Wen, S. New criteria on stability of dynamic memristor delayed cellular neural networks. IEEE Trans. Cybern. 2022, 52, 5367–5379. [Google Scholar] [CrossRef] [PubMed]
  37. Di Marco, M.; Forti, M.; Moretti, R.; Pancioni, L.; Innocenti, G.; Tesi, A. Convergence of a class of delayed neural networks with real memristor devices. Mathematics 2022, 10, 2439. [Google Scholar] [CrossRef]
  38. Tetzlaff, R.; Ascoli, A.; Messaris, I.; Chua, L.O. Theoretical foundations of memristor cellular nonlinear networks: Memcomputing with bistable-like memristors. IEEE Trans. Circuits Syst. I Reg. Pap. 2020, 67, 502–515. [Google Scholar] [CrossRef]
  39. Corinto, F.; Gilli, M.; Forti, M. Flux-charge description of circuits with non-volatile switching memristor devices. IEEE Trans. Circuits Syst. II Expr. Briefs 2018, 65, 642–646. [Google Scholar] [CrossRef]
  40. Yang, J.J.; Pickett, M.D.; Li, X.; Ohlberg, D.A.A.; Stewart, D.R.; Williams, R.S. Memristive switching mechanism for metal/oxide/metal nanodevices. Nat. Nanotech. 2008, 3, 429. [Google Scholar] [CrossRef]
  41. Hu, S.G.; Wu, S.Y.; Jia, W.W.; Yu, Q.; Deng, L.J.; Fu, Y.Q.; Liu, Y.; Chen, T.P. Review of nanostructured resistive switching memristor and its applications. Nanosci. Nanotechnol. Lett. 2014, 6, 729–757. [Google Scholar] [CrossRef]
  42. Khalid, M. Review on various memristor models, characteristics, potential applications, and future works. Trans. Electr. Electron. Mater. 2019, 20, 289–298. [Google Scholar] [CrossRef]
  43. Di Marco, M.; Forti, M.; Pancioni, L. New conditions for global asymptotic stability of memristor neural networks. IEEE Trans. Neural Netw. Learn. Syst. 2018, 29, 1822–1834. [Google Scholar] [CrossRef]
  44. Corinto, F.; Forti, M. Memristor circuits: Flux–charge analysis method. IEEE Trans. Circuits Syst. I Reg. Pap. 2016, 63, 1997–2009. [Google Scholar] [CrossRef] [Green Version]
  45. Chua, L.O.; Yang, L. Cellular neural networks: Applications. IEEE Trans. Circuits Syst. 1988, 35, 1273–1290. [Google Scholar] [CrossRef]
Figure 1. Memristor models: Ideal flux-controlled memristor (left) and real extended memristor given by the parallel connection of an ideal memristor and a nonlinear voltage-controlled resistor (right).
Figure 1. Memristor models: Ideal flux-controlled memristor (left) and real extended memristor given by the parallel connection of an ideal memristor and a nonlinear voltage-controlled resistor (right).
Mathematics 10 04024 g001
Figure 2. Characteristics of i ^ R for a nonlinear voltage-controlled resistor. (a) PWL diode satisfying Assumption 1. (b) Exponential characteristic of a Shockley diode satisfying Assumption 2; the drawing also shows the tangent to i ^ R at v R = 0 (dashed–dotted) and the function i ^ R + (light gray). (c) Characteristic with a negative slope at v R = 0 satisfying Assumption 2 and (d) non-monotone characteristic satisfying Assumption 2.
Figure 2. Characteristics of i ^ R for a nonlinear voltage-controlled resistor. (a) PWL diode satisfying Assumption 1. (b) Exponential characteristic of a Shockley diode satisfying Assumption 2; the drawing also shows the tangent to i ^ R at v R = 0 (dashed–dotted) and the function i ^ R + (light gray). (c) Characteristic with a negative slope at v R = 0 satisfying Assumption 2 and (d) non-monotone characteristic satisfying Assumption 2.
Mathematics 10 04024 g002
Figure 3. Circuit schematic for the i-th cell of an IMNN. The cell is obtained by replacing the linear resistor in a CNN cell with a flux-controlled ideal memristor. The interconnections are obtained via linear conductances g i j . The VCCSs represent the currents g i j v j , j = 1 , 2 , , n , which are injected into the cell due to the interconnections with the other cells.
Figure 3. Circuit schematic for the i-th cell of an IMNN. The cell is obtained by replacing the linear resistor in a CNN cell with a flux-controlled ideal memristor. The interconnections are obtained via linear conductances g i j . The VCCSs represent the currents g i j v j , j = 1 , 2 , , n , which are injected into the cell due to the interconnections with the other cells.
Mathematics 10 04024 g003
Figure 4. Circuit schematic for the i-th cell of an RMNN. The cell is obtained by replacing the ideal flux-controlled memristor in the cell of an IMNN (cf. Figure 3) with a real extended memristor given by the parallel connection of an ideal flux-controlled memristor and a nonlinear voltage-controlled resistor.
Figure 4. Circuit schematic for the i-th cell of an RMNN. The cell is obtained by replacing the ideal flux-controlled memristor in the cell of an IMNN (cf. Figure 3) with a real extended memristor given by the parallel connection of an ideal flux-controlled memristor and a nonlinear voltage-controlled resistor.
Mathematics 10 04024 g004
Figure 5. Numerical simulation with MATLAB of a memristor CNN for horizontal line detection. (a) Initial image at t = 0 ; (b) snapshot of the transient at t = 0.1 ; (c) snapshot at t = 0.15 ; (d) final image at t = 1 .
Figure 5. Numerical simulation with MATLAB of a memristor CNN for horizontal line detection. (a) Initial image at t = 0 ; (b) snapshot of the transient at t = 0.1 ; (c) snapshot at t = 0.15 ; (d) final image at t = 1 .
Mathematics 10 04024 g005
Figure 6. Numerical simulation with MATLAB of a memristor CNN for horizontal line detection. (a) Time evolution of fluxes ψ i ( · ; φ 0 , 0 ) for the 13th row of the CNN; (b) evolution of nonlinear resistor charges Q R , i ( · ; φ 0 , 0 ) ; (c) evolution of fluxes φ i ( · ; v 0 , φ 0 ) ; (d) evolution of capacitor voltages v i ( · ; v 0 , φ 0 ) .
Figure 6. Numerical simulation with MATLAB of a memristor CNN for horizontal line detection. (a) Time evolution of fluxes ψ i ( · ; φ 0 , 0 ) for the 13th row of the CNN; (b) evolution of nonlinear resistor charges Q R , i ( · ; φ 0 , 0 ) ; (c) evolution of fluxes φ i ( · ; v 0 , φ 0 ) ; (d) evolution of capacitor voltages v i ( · ; v 0 , φ 0 ) .
Mathematics 10 04024 g006aMathematics 10 04024 g006b
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Di Marco, M.; Forti, M.; Moretti, R.; Pancioni, L.; Tesi, A. Convergence of Neural Networks with a Class of Real Memristors with Rectifying Characteristics. Mathematics 2022, 10, 4024. https://doi.org/10.3390/math10214024

AMA Style

Di Marco M, Forti M, Moretti R, Pancioni L, Tesi A. Convergence of Neural Networks with a Class of Real Memristors with Rectifying Characteristics. Mathematics. 2022; 10(21):4024. https://doi.org/10.3390/math10214024

Chicago/Turabian Style

Di Marco, Mauro, Mauro Forti, Riccardo Moretti, Luca Pancioni, and Alberto Tesi. 2022. "Convergence of Neural Networks with a Class of Real Memristors with Rectifying Characteristics" Mathematics 10, no. 21: 4024. https://doi.org/10.3390/math10214024

APA Style

Di Marco, M., Forti, M., Moretti, R., Pancioni, L., & Tesi, A. (2022). Convergence of Neural Networks with a Class of Real Memristors with Rectifying Characteristics. Mathematics, 10(21), 4024. https://doi.org/10.3390/math10214024

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop