Coexisting Attractors and Multistability in a Simple Memristive Wien-Bridge Chaotic Circuit

Abstract

In this paper, a new voltage-controlled memristor is presented. The mathematical expression of this memristor has an absolute value term, so it is called an absolute voltage-controlled memristor. The proposed memristor is locally active, which is proved by its DC V–I (Voltage–Current) plot. A simple three-order Wien-bridge chaotic circuit without inductor is constructed on the basis of the presented memristor. The dynamical behaviors of the simple chaotic system are analyzed in this paper. The main properties of this system are coexisting attractors and multistability. Furthermore, an analog circuit of this chaotic system is realized by the Multisim software. The multistability of the proposed system can enlarge the key space in encryption, which makes the encryption effect better. Therefore, the proposed chaotic system can be used as a pseudo-random sequence generator to provide key sequences for digital encryption systems. Thus, the chaotic system is discretized and implemented by Digital Signal Processing (DSP) technology. The National Institute of Standards and Technology (NIST) test and Approximate Entropy analysis of the proposed chaotic system are conducted in this paper.

1. Introduction

A memristor is a nonlinear two-terminal circuit element reflecting the relationship between charge and magnetic flux, which was first predicted by Chua in 1971 [1]. Reference [2] introduced the general definition of memristor and its three fingerprints. Then, in 2008, the realization of a nanoscale memristor was first reported by the Hewlett-Packard laboratory [3]. A locally active memristor was proposed by Chua, which can generate complex behaviors in nonlinear dynamical systems [4]. The DC V–I plot is a smooth curve passing through different voltages V and corresponding currents I on the V–I plane, which can be used to show that a memristor is locally active [5]. Because of its unique properties, a memristor can be used in many areas such as nonlinear chaotic circuits [6,7,8,9], artificial intelligence [10,11,12], electronic engineering [13,14,15], neural networks [16,17,18], and so on.

Recently, much attention has been paid to construct memristor-based chaotic circuits and analyze their dynamical behaviors. Reference [19] presented and analyzed a new chaotic circuit, which was composed of a meminductor emulator and an active memristor emulator. Reference [20] constructed a memristor-based hyperchaotic Wien-bridge oscillator and analyzed its dynamical behaviors. In Reference [21], an inductor-free chaotic circuit containing two memristors was proposed. A Wien-bridge chaotic oscillator based on an SBT memristor was designed in Reference [22]. Besides, some dynamical behaviors in chaotic systems were analyzed with the help of a phase diagram, Poincare section, bifurcation diagram, and Lyapunov exponent spectrum [23,24,25]. Specifically, coexisting attractors and multistability are common phenomena in a chaotic system, which indicates that a chaotic system with fixed parameters under different initial conditions can generate disparate attractors. In recent years, many studies have been conducted on coexisting attractors and multistability in chaotic systems. Reference [26] discovered coexisting singular attractors in a two-dimensional dynamical system. The two-dimensional dynamical system consisted of a bistable bi-local active memristor and an inductor. Reference [27] introduced a new four-wing chaotic system and analyzed its multistability. In Reference [28], the multistability phenomenon was detected and analyzed in an autonomous hyperchaotic oscillator. A sustained chaos state means that independent of the initial conditions, a system will finally turn to a chaotic state with constant Lyapunov exponents. The sustained chaos phenomenon was discovered in a new memristor-based chaotic system [29]. Reference [30] proposed a novel 4D chaotic system with constant Lyapunov exponents. In Reference [31], the constant Lyapunov exponent spectrum was found in a Wien-bridge chaotic oscillator based on a meminductor.

Furthermore, the chaotic system can be used for encryption and secure communication. In Reference [32], a new 3D system was used for signal encryption. A fractional-order hperchaotic system was applied to a color image encryption in Reference [33]. Reference [34] applied a four-dimensional hyperchaotic system to image encryption. Reference [35] designed a chaotic system with adaptive control synchronization and applied it to secure communication. Reference [36] introduced a new 3D autonomous chaotic oscillator and described its secure communication application. The chaotic system can be implemented by a digital circuit, which makes it better applicable to digital encryption. Therefore, the chaotic system can be further discretized and implemented by Digital Signal Processing (DSP) technology [37]. Besides, the chaotic system can be used as a pseudo-random sequence generator to provide key sequences for encryption systems. The randomness of the chaotic sequence can be tested by means of the National Institute of Standards and Technology (NIST) test suite [38].

In this paper, an absolute voltage-controlled memristor is presented. Then, a simple three-order Wien-bridge circuit is constructed based on the presented memristor. Because of the absence of an inductor, this Wien-bridge circuit is easily integrated. In addition, this chaotic system possesses dynamical behaviors, including multistability and sustained chaos state. The rest of this paper is composed of the following sections. In Section 2, the model of this absolute voltage-controlled memristor is presented and its characteristics are researched via a DC V–I plot. A simple three-order memristive Wien-bridge circuit and its typical chaotic attractors are demonstrated in Section 3. The rich dynamical behaviors of the presented system are analyzed in Section 4. In Section 5, an analog circuit of this chaotic system is realized by the Multisim software. The DSP implementation of this chaotic system is introduced in Section 6. NIST test and Approximate Entropy analysis of the proposed chaotic system are conducted in Section 7. Finally, some conclusions are drawn in Section 8.

2. Mathematical Model and DC V–I Plot of the Proposed Memristor

2.1. Mathematical Model

According to the definition of memristor, an nth-order voltage-controlled memristor can be described by the following equation [1,39,40]:

$$\{\begin{array}{l}i=W(z)v\\ \frac{dz}{dt}=f(z,v)\end{array}$$

(1)

where i represents the current flowing through the memristor, v stands for the voltage across the memristor, z is the state variable of the memristor, and W(z) is the corresponding memductance.

In order to research the characteristics of a new memristor model and explore the dynamic behaviors of an oscillator system based on the memristor, a new voltage-controlled memristor was proposed as follows:

$$\{\begin{array}{l}i=(a_m-b_n\left|z\right|)v\\ \frac{dz}{dt}=-cz-d{v}^2\end{array}$$

(2)

where a_m, b_n, c, and d are coefficients, and a_m-b_n|z| is the memductance W(z). The mathematical expression of this memristor has an absolute value term, so it is called an absolute voltage-controlled memristor.

When a voltage signal v = v_msin(2πft) with amplitude v_m and frequency f is applied to the memristor, the v–i pinched hysteresis loops of the proposed memristor with amplitude v_m = 1 V and different frequencies f are depicted in Figure 1.

In Figure 1, it is obvious that the v–i pinched hysteresis loops of the proposed memristor pass through the origin. Besides, the v–i pinched hysteresis loops are symmetrical. The area of the v–i hysteresis loop decreases when the frequency f increases. The pinched hysteresis loop shrinks to a straight line when the frequency f is 55 Hz. Therefore, the proposed memristor satisfies the characteristic fingerprints of memristors [2].

2.2. DC V–I Plot of the Proposed Memristor

The DC V–I plot is a smooth curve passing through different voltages V and corresponding currents I on the V–I plane, which can be used to research the characteristics of a memristor [5]. When the state variable z is Z, the DC voltage is V, and the DC current is I, the Equation (2) can be rewritten as follows:

$$I=(a_m-b_n\left|Z\right|)V$$

(3a)

$$\frac{dZ}{dt}=-cZ-d{V}^2$$

(3b)

when the right-hand side of (3b) is zero, the equilibrium equation of the memristor can be written as follows:

$$-cZ-d{V}^2=0$$

(4)

The relationship between the state variable z and the DC voltage V can also be written as follows:

$$Z=-\frac{d}{c}{V}^2$$

(5)

When a_m = 5, b_n = 4, c = 0.4, d = 1, and Equation (5) is taken into Equation (3a), the DC current I can be written as follows:

$$I=(a_m-b_n\left|\frac{d}{c}{V}^2\right|)V=(5-10V^2)V$$

(6)

According to Equation (6), the DC V–I plot of the proposed memristor is shown in Figure 2.

It is obvious that there are negative slope regions in the DC V–I plot of the memristor. Hence, the proposed absolute memristor is locally active [41]. In a nonlinear dynamical system, the function of a locally active element is to maintain oscillations [41].

3. The Three-Order Memristive Wien-Bridge Chaotic Circuit

3.1. Circuit Model

As shown in Figure 3, a simple memristive Wien-bridge circuit based on the above absolute voltage-controlled memristor was constructed. The three-order chaotic circuit consisted of three dynamic elements, i.e., the capacitor C1, the capacitor C2, and the absolute voltage-controlled memristor W corresponding to the three state variables voltage v₁, voltage v_2, and current i_w, respectively.

According to Kirchhoff’s law and the constitutive relations of circuit elements, the state equations of the above Wien-bridge circuit are written as follows:

$$\{\begin{array}{l}\frac{d{v}_1}{dt}=\frac{R_2}{C_1{R}_1}[\frac{v_1-v_2}{R_3}+W(z)v_1]\\ \frac{d{v}_2}{dt}=\frac{v_1-v_2}{C_2{R}_3}\\ \frac{dz}{dt}=-cz-d{v}_1^2\end{array}$$

(7)

where W(z) = a_m − b_n|z|. Let x = v₁, y = v₂, R₁ = R₂, a = R₂/C₁R₁R₃, b = R₂/C₂R₁R₃, m = a_m/C₁, and n = b_n/C₁, Equation (7) can be simplified to:

$$\{\begin{array}{l}\frac{dx}{dt}=a(x-y)+(m-n\left|z\right|)x\\ \frac{dy}{dt}=b(x-y)\\ \frac{dz}{dt}=-cz-d{x}^2\end{array}$$

(8)

3.2. Typical Chaotic Attractors

When the parameters of Equation (8) are set as in

Table 1. Parameter values of typical attractors.

Parameters	Values
a	4.5
b	5.5
c	0.4
d	1.0
m	5.0
n	4.0

and the initial conditions are (0, 0.1, 0), the system is in a chaotic state. In this condition, the Lyapunov exponents are calculated as LE₁ = 0.4369, LE₂ = 0, LE₃ = −2.0762. The corresponding chaotic attractors on the x-y-z, x-y, y-z, x-z planes are depicted in Figure 4. The time domain waveform of the state variable x(t) is shown in Figure 5a. Figure 5b demonstrates the corresponding Poincare mapping on z = −1.3 section. The time domain waveform and Poincare mapping shown in Figure 5 indicate that the system was chaotic.

4. Dynamical Behaviors of the Proposed Chaotic System

4.1. Dissipativity and Stability

The solutions of Equation (8) are invariant under the following transformation:

$$(x,y,z)\to (-x,-y,-z)$$

(9)

this implies that the proposed chaotic system was symmetric at the origin.

If the system is dissipative, it can generate chaotic attractors. The dissipativity of this system can be described by the following expression:

$$\nabla V=\frac{\partial \dot{x}}{\partial x}+\frac{\partial \dot{y}}{\partial y}+\frac{\partial \dot{z}}{\partial z}=a+m-n\left|z\right|-b-c$$

(10)

when the parameters a, b, c, d, m, and n are set as in Table 1 and |z| > 0.72, the ∇V of this system is negative. It means the system is dissipative.

Let $\dot{x}=\dot{y}=\dot{z}=0$ in Equation (8): three equilibrium points of this system can be calculated as follows:

$$\{\begin{array}{l}{S}_0=(0,0,0)\\ S_1=(\sqrt{\frac{mc}{nd}},\sqrt{\frac{mc}{nd}},-\frac{m}{n})\\ S_2=(-\sqrt{\frac{mc}{nd}},-\sqrt{\frac{mc}{nd}},-\frac{m}{n})\end{array}$$

(11)

The Jacobian matrix J of Equation (8) is expressed as follows:

$$\mathit{J}=\left[\begin{array}{ccc}a+m-n\left|z\right|& -a& -nxsign(z)\\ b& -b& 0\\ -2dx& 0& -c\end{array}\right]$$

(12)

If m = 5.0 and n = 4.0, its characteristic equation at equilibrium point S₀ can be simplified as follows:

$$\det (\lambda \mathit{I}-\mathit{J})={\lambda }^3+(b-a-4.6){\lambda }^2-(0.4a+4.6b+2)\lambda -2b=0$$

(13)

In terms of the Routh–Hurwitz stability criterion, if all coefficients of Equation (13) satisfy the following equation, the system is stable:

$$\{\begin{array}{l}b-a-4.6>0\\ -0.4a-4.6b-2>0\\ -2b>0\\ (b-a-4.6)(-0.4a-4.6b-2)+2b>0\end{array}$$

(14)

As shown in Figure 6, the region of a ∈ [−20,10] and b ∈ [−20,10] can be divided into two parts. The blue part satisfies the above equation, so it represents a stable region. Conversely, the yellow part belongs to an unstable region.

4.2. Bifurcation Diagrams and Lyapunov Exponent Spectra

The dynamical behaviors of the above chaotic system were further investigated with the help of bifurcation diagrams and Lyapunov exponent spectra.

When a varied from 1 to 6 and other parameters were set as in Table 1 with initial conditions of (0, 0.1, 0), the bifurcation diagram of the state variable x and the corresponding Lyapunov exponent spectra are as plotted in Figure 7a,b, respectively. As it is shown in Figure 7a, when a ∈ [1, 1.7], the system was convergent, and the corresponding Lyapunov exponents were all negative. Then, the system went into chaotic state nearby a = 1.8, with one of the Lyapunov exponents positive. When a ∈ [1.8, 2.2], the system was in chaotic state. Next, the system entered a period window nearby a = 2.3. The system was still in periodic state in the regions of a ∈ [2.3, 3.4]. In the regions of a ∈ [3.5, 5.2], the system was in chaotic state. Finally, nearby a = 5.2, the system entered periodic state.

More specifically, various phase portraits with different a are depicted in Figure 8. In Figure 8a, when a = 1.5, the red trajectory converges to the stable equilibrium point (0.7071, 0.7071, −1.2500). When a = 5.5, the blue trajectory is a limit cycle, implying the system is in periodic state. Different kinds of chaotic attractors are plotted in Figure 8b–d. Figure 8b,c depict two kinds of twin-scroll chaotic attractors. The single-scroll chaotic attractor is shown in Figure 8d.

4.3. Coexisting Attractors and Multistability

Coexisting attractors and multistability are common characteristics of a chaotic system. Generally, if a system possesses coexisting attractors, it has multistability. The existence of coexisting attractors indicates that a system with fixed parameter values and different initial conditions can generate disparate attractors. If a chaotic system has coexisting attractors, it can also show the phenomenon of coexisting bifurcation.

If a = 4.5, b = 4.85, c = 0.4, d = 1, m = 5, n = 4, and the initial conditions are set as (0, 0.1, 0) and (0, −0.1, 0), the coexisting attractors are as depicted in Figure 9, where the red trajectory starts from initial conditions of (0, 0.1, 0), and the blue trajectory starts from initial conditions of (0, −0.1, 0). Obviously, the coexisting attractors starting from (0, 0.1, 0) and (0, −0.1, 0) are symmetric with respect to y = 0 on the y-z plane. The above coexisting attractors are symmetric with respect to x = 0 on the x-z plane. Thus, the coexisting attractors at different initial conditions are symmetrical in this chaotic system.

When a = 4.5, c = 0.4, d = 1, m = 5, n = 4, and b is set as different values, a variety of coexisting attractors with initial conditions of (0, 0.1, 0) and (0, −0.1, 0) are obtained, as plotted in Figure 10, where the red orbit starts from the initial conditions of (0, 0.1, 0), and the blue one starts from the initial conditions of (0, −0.1, 0). Figure 10a,b depicts two kinds of a symmetric pair of single-scroll attractors. Figure 10c,d depicts two kinds of a symmetric pair of twin-scroll attractors. Two kinds of a symmetric pair of limit cycles are shown in Figure 10e,f.

When b varies from 4.5 to 7 and other parameters are set as in Table 1, the coexisting bifurcation diagram of the state variable x is shown in Figure 11a, where the orbit colored in red starts from the initial conditions of (0, 0.1, 0), and the blue one starts from the initial conditions of (0, −0.1, 0). Obviously, the coexisting bifurcation diagram varying with b is symmetric with respect to x_max = 0. The Lyapunov exponent spectra varying with b are depicted in Figure 11b and correspond to the coexisting bifurcation diagram plotted in Figure 11a. It can be concluded from Figure 11b that independent of the initial conditions being (0, 0.1, 0) or (0, −0.1, 0), this chaotic system has the same Lyapunov exponents.

4.4. Sustained Chaos State

As mentioned above, the proposed chaotic system showed multistability, which means that under different initial conditions, it can always evolve into a chaotic state. Therefore, the proposed chaotic system is very interesting. Independent of the initial conditions, the system will evolve into a chaotic state. This indicates that the proposed system maintains a sustained chaos state and constant Lyapunov exponents as the initial conditions vary.

If the system parameters are as in Table 1 with initial conditions of (x(0), 0.1, 0) in which x(0) is the bifurcation parameter, the bifurcation diagram of the state variable x and the corresponding Lyapunov exponent spectra are as shown in Figure 12a and Figure 13a, respectively. It is obvious that the Lyapunov exponents of the proposed system almost remain constant under the initial conditions of (x(0) ∈ (−1 × 10⁴, 1 × 10⁴), 0.1, 0). If the initial value y(0) is regarded as the bifurcation parameter and x(0) = z(0) = 0, the bifurcation diagram of the state variable y and the corresponding Lyapunov exponent spectra are as shown in Figure 12b and Figure 13b, respectively. The corresponding Lyapunov exponents are approximately the same under the initial conditions of (0, y(0) ∈ (−1×10⁴, 1×10⁴), 0). Similarly, the Lyapunov exponents are constant under the initial conditions of (0, 0.1, z(0) ∈ (−1×10⁴, 1 × 10⁴)). The bifurcation diagram of the state variable z and the corresponding Lyapunov exponent spectra with initial conditions of (0, 0.1, z(0) ∈ (−1×10⁴, 1×10⁴)) are shown in Figure 12c and Figure 13c, respectively.

5. Circuit Simulation by the Multisim Software

The circuit simulation of this chaotic system could be realized by the Multisim software [42]. For time scaling factors τ = 100t and circuit parameters as in Table 1, Equation (8) can be written as follows:

$$\{\begin{array}{l}\frac{dx}{d\tau }=450(x-y)+(500-400\left|z\right|)x\\ \frac{dy}{d\tau }=550(x-y)\\ \frac{dz}{d\tau }=-40z-100x^2\end{array}$$

(15)

The analog circuit is shown in Figure 14, from which the state equations can be obtained as follows:

$$\{\begin{array}{l}\frac{dx}{dt}=\frac{1}{C_1{R}_3}(x-y)+(\frac{1}{C_1{R}_4}-\frac{R_{10}}{C_1{R}_4{R}_9}\left|z\right|)x\\ \frac{dy}{dt}=\frac{1}{C_2{R}_3}(x-y)\\ \frac{dz}{dt}=-\frac{1}{C_3{R}_6}z-\frac{1}{C_3{R}_5}{x}^2\end{array}$$

(16)

Supposing that the coefficients in Equation (15) are equal to the corresponding ones in Equation (16), the above equations can be written as follows:

$$\{\begin{array}{ll}\frac{1}{C_1{R}_3}=450& \frac{1}{C_2{R}_3}=550\\ \frac{1}{C_3{R}_6}=40& \frac{1}{C_3{R}_5}=100\\ \frac{1}{C_1{R}_4}=500& \frac{R_{10}}{C_1{R}_4{R}_9}=400\end{array}$$

(17)

In Figure 14, the specific capacitance and resistance parameters were set as C₁ = 11 nF, C₂ = 9 nF, R₁ = R₂ = 10 kΩ, R₅ = 4 kΩ, R₆ = 10 kΩ, R₇ = R₈ = 1 kΩ, R₉ = 5 kΩ, R₁₀ = 4 kΩ, R₁₁ = R₁₂ = R₁₃ = R₁₄ = R₁₅ = 10 kΩ. Other capacitance and resistance parameters could be calculated as: C₃ ≈ 2.5 μF, R₃ ≈ 202 kΩ, R₄ ≈ 182 kΩ. In this analog circuit, the type of operational amplifiers U1–U7 was OP07CP, and the type of multipliers A1–A2 was AD633. XSC1, XSC2, and XSC3 were oscilloscopes. D1 and D2 were diodes.

The simulation results obtained from oscilloscopes by the Multisim software are shown in Figure 15. Figure 15a–c are phase portraits of the attractors. Figure 15d–f are phase portraits of coexisting attractors, where the red orbit starts from the initial conditions of (0, 0.1, 0), and the blue orbit starts from (0, −0.1, 0). It is obvious that the simulation results matched well with the numerical simulation results.

6. Implementation of the Chaotic System by DSP Technology

The chaotic system can be used for digital encryption. The main characteristic of the proposed chaotic system is multistability. The multistability of the proposed system can enlarge the key space in encryption, which improves the encryption effect. Therefore, the proposed chaotic system can be used for digital encryption. In analog chaotic circuits, the existence of random signal perturbation will lead to output instability. So, the analog chaotic circuits cannot be directly applied to digital encryption. Therefore, in order to make the proposed chaotic system better suitable for digital encryption applications, it was further discretized and implemented by DSP technology [37].

During digital implementation, the dynamical degradation effect will eliminate the chaotic behavior in a finite space and prevent practical applications for chaos phenomena [43,44]. There are five approaches to prevent dynamical degradation: (1) higher finite precision [45]; (2) cascading multiple digital chaotic systems [46]; (3) perturbance-based method [47,48,49,50]; (4) switching multiple digital chaotic systems [51,52]; (5) error compensation methods [53]. In this paper, the first method was adopted to prevent dynamical degradation. The integration step in the discretization process is crucial.

There are three algorithms for discretization and digitalization of continuous chaotic systems. They are the simple Euler algorithm, the improved Euler algorithm, and the Runge–Kutta algorithm. The simple Euler algorithm has faster computation speed than the other two algorithms. When the Euler algorithm is implemented with DSP, it requires less resources and is easy to implement. Thus, the Euler algorithm was adopted to discretize the chaotic system. The theoretical basis of the Euler algorithm is shown as follows:

$$f^{\prime }(x)=\underset{\Delta t\to 0}{\lim }\frac{x(t_n+\Delta t)-x(t_n)}{\Delta t}=\underset{\Delta t\to 0}{\lim }\frac{x_{n+1}-x_n}{\Delta t}\approx \frac{x_{n+1}-x_n}{\Delta t}=\frac{x(n+1)-x(n)}{\Delta t}$$

(18)

Equation (8) can be discretized to the following equations according to the Euler algorithm:

$$\{\begin{array}{l}x(n+1)=(a(x(n)-y(n))+(m-n\left|z(n)\right|)x(n))\Delta t+x(n)\\ y(n+1)=(b(x(n)-y(n)))\Delta t+y(n)\\ z(n+1)=(-cz(n)-d{x}^2(n))\Delta t+z(n)\end{array}$$

(19)

where the parameters a, b, c, d, m, and n are as in Table 1. The integration step Δt = 0.01 and the initial conditions were set as x(0) = 0, y(0) = 0.1, z(0) = 0.

The digital signal was obtained by solving Equation (19) in a digital signal processor. The chaotic pseudo-noise (PN) sequence extracted from the variable x is shown in Figure 16a. In order to observe the analog signal in an oscilloscope, the digital signal was input into an 8-bit D/A convertor. The output phase portraits of the chaotic attractor are shown in Figure 16b–d. The phase portraits of coexisting attractors are shown in Figure 16e,f, where the trajectory on the left starts from the initial conditions of (0, −0.1, 0), and the right trajectory starts from the initial conditions of (0, 0.1, 0). The experimental equipment is shown in Figure 17. In the experimental equipment, the type of evaluation board was ICETEK-VC5509-AE, and the core processing chip was TMS320C5509.

7. NIST Test Results and Approximate Entropy Analysis of the Proposed Chaotic System

7.1. NIST Test Results

The chaotic system can be used as a pseudo-random sequence generator to provide key sequences for an encryption system. The random characteristics of the chaotic sequences directly affect the security of an encryption system. The randomness of the binary sequences extracted from the above chaotic system were tested by means of the NIST test suite [38]. The NIST test suite is a tool for testing the randomness of pseudo-random sequences.

In this NIST test, a binary sequence was generated from the solution sequence z of Equation (19). A binary sequence can be generated as follows: If the sixth place after the decimal point of a solution z is an even number, the generated binary number is 0, otherwise the generated binary number is 1. So, the solution sequence z can generate a binary sequence. In this NIST, the significance level α was set to 0.01. The binary sequence was divided into 1000 groups according to the significance level α [38], and each group contained 1,000,000 bits. The final test results are shown in

Table 2. Final analysis report.

Statistical Test Terms	p-ValueT	Proportion
Frequency	0.624627	0.9960
Block Frequency	0.668321	0.9940
Cumulative Sums	0.326749	0.9960
Runs	0.399442	0.9900
Longest Run	0.877083	0.9880
Rank	0.044797	0.9900
FFT	0.887645	0.9860
Non-Overlapping Template	0.993493	0.9880
Overlapping Template	0.476911	0.9930
Universal	0.854708	0.9870
Approximate Entropy	0.272977	0.9890
Random Excursions	0.649066	0.9935
Random Excursions Variant	0.995975	0.9951
Serial	0.007805	0.9820
Linear Complexity	0.755819	0.9920

.

In Table 2, two parameters evaluated in 15 tests are reported. One is the p-value_T, which reflects the distribution of p-values (possible values). It is used to check for uniformity of the sequences [38]. If p-value_T ≥ 0.0001, the distribution of sequences is uniform [38]. It is obvious that the p-value_T of all types of test satisfied the above condition. The other parameter is the proportion, which represents the proportion of sequences that pass a statistical test [38]. The range of acceptable proportions is determined by the confidence interval. The range of acceptable proportions is computed as follows:

$$(\widehat{p}-3\sqrt{\widehat{p}(1-\widehat{p})/N},\widehat{p}+3\sqrt{\widehat{p}(1-\widehat{p})/N})$$

(20)

where $\widehat{p}=1-\alpha$, α is the significance level, N is the total number of groups. In this test, α = 0.01, N = 1000, and the range of acceptable proportions was (0.9805608, 0.9994392). If the value of proportion is in the range of 0.9805608–0.9994392, the sequences pass this type of test [38]. It is obvious that all proportions were in the range of 0.9805608–0.9994392, which means that the sequences passed all types of test and the randomness of the proposed chaotic system was up to the standards of NIST [38]. Thus, when the integration step Δt was set as 0.01 in Equation (19), the chaotic behavior was not eliminated. Therefore, the proposed chaotic system can be used as a pseudo-random sequence generator to provide key sequences for encryption systems.

7.2. Approximate Entropy Analysis

The purpose of the Approximate Entropy test is to measure the complexity and randomness of sequences [38]. In this NIST test, the chaotic sequences were divided into 1000 groups, and each group contained 1,000,000 bits. The Approximate Entropy test method is used to test the randomness of sequences in the following way:

(1) Construct a new sequence on the basis of each group of the original sequence. The method to construct the new sequence consists of appending m−1 bits (m is the block length) from the beginning of each group of the original sequence to the end of the original sequence.

(2) Count the frequency of all 2^m m-bit sub-sequences in the new sequence. Record the frequency of each m-bit sub-sequence as #i (i represents different m-bit sub-sequences).

(3) Compute $C_i^m$ as follows:

$${{\displaystyle C}}_i^m=\frac{\#i}{n}$$

(21)

where m represents the block length, i represents different m-bit strings, and n represents the length of each group of the new sequence.

(4) Compute φ^(m) as follows:

$${\phi }^{(m)}={\displaystyle \sum _{j=0}^{2^m-1}{C}_i^m}\ln C_i^m$$

(22)

(5) Compute φ^(m+1). Repeat steps (1)–(4) by replacing m with m + 1.

(6) Compute the test statistic χ²

$${\chi }^2=2n[\ln 2-ApEn(m)]$$

(23)

where ApEn(m) = φ^(m) − φ^(m+1).

(7) Compute the p-value as follows:

$$p\text{-}\mathrm{value}=igmc(2^{m-1},\frac{{\chi }^2}{2})$$

(24)

where igamc is the incomplete gamma function. It can be calculated as follows:

$$igmc(a,x)=\frac{1}{\mathsf{\Gamma }(a)}{\displaystyle {\int }_x^{\infty }{e}^{-t}}{t}^{a-1}dt$$

(25)

$$\mathsf{\Gamma }(a)={\displaystyle {\int }_0^{\infty }{t}^{a-1}}{e}^{-t}dt$$

(26)

Since the chaotic sequences were divided into 1000 groups in this test, the number of p-values to compute was 1000.

(8) Compute p-value_T as follows:

$${\chi }^2={\displaystyle \sum _{j=1}^{10}\frac{{(F_j-\raisebox{1ex}{$N$}\!\left/ \!\raisebox{-1ex}{$10$}\right.)}^2}{\raisebox{1ex}{$N$}\!\left/ \!\raisebox{-1ex}{$10$}\right.}}$$

(27)

$$p\text{-}{\mathrm{value}}_{\mathrm{T}}=igmac(\raisebox{1ex}{$9$}\!\left/ \!\raisebox{-1ex}{$2$}\right.,\raisebox{1ex}{${\chi }^2$}\!\left/ \!\raisebox{-1ex}{$2$}\right.)$$

(28)

where the intervals between 0 and 1 are divided into 10 sub-intervals; j represents one of the 10 sub-intervals, F_i is the number of p-values in the sub-interval j, N is the total number of groups. In this test, N = 10,000. The Approximate Entropy test result is shown in Table 2. It is obvious that the Approximate Entropy test results were up to the standards of the NIST [38].

8. Conclusions

In this paper, an absolute voltage-controlled memristor model is proposed. The DC V–I plot analysis indicated that the proposed memristor was locally active. A simple Wien-bridge chaotic circuit based on the absolute memristor was designed. Because of the absence of an inductor, the above chaotic circuit was easily integrated. The presented chaotic circuit possesses rich dynamical behaviors, such as multistability and sustained chaos state. The simulation results of the chaotic circuit obtained by the Multisim software matched well with the numerical simulation results obtained by the Matlab software. The results of the DSP experiment and the NIST test indicated that the proposed chaotic system can be used as a pseudo-random sequence generator to provide key sequences for encryption systems. Therefore, the proposed chaotic system can be efficiently applied for digital information encryption.