Chaos processor

Abstract: A chaos processor which is able to gain a dynamic of a dynamics system and to determine whether the dynamic is gained by a random noise or by the meaningful information. The chaos system having a strange attractor comprising a state value selecting unit for selecting the state value inputted according to an embedding dimension value and a delay time value; a distance calculating unit for calculating the distance between two state values selected by the state value selecting unit; an correlation sum calculating unit for calculating the correlation sum, in which the correlation sum calculating unit compares the calculated distance with a pre-stored distance index, increases the distance index when the distance index and a distance condition is satisfied, and calculates a sum of states in a circle having a radius corresponding to the increased distance index; an inflection point selecting unit for selecting points of inflection of a linearly increased parts from the calculated correlation sum; a correlation dimension calculating unit for calculating the correlation dimension by calculating a slope of a line which is made by connecting the inflection points selected.

Description: BACKGROUND OF THE INVENTION Field of the Invention The present invention relates to a chaos detection system, more particularly to a chaos processor which is able to determine whether an input signal is obtained from a random noise or from a meaningful information containing qualitative features of the strange attractor. Description of the Prior Art Recently, there have been active studies for seeking a process for estimating the future movements of the nature phenomena, such as the flow of water, air, and blood etc., the movement may be predetermined by the mathematical regularity of the movements gained. A dynamical system can be defined as a system in which its states are varying with respect to time. The dynamical system is called a stable system when the steady state solution remains in one point, which is in turn called an equilibrium point. When the attractor of the system makes a closed loop, the system is called a periodic system. When the attractor has a shape of doughnut, it is called a quasi-periodic system. The procedure for obtaining the attractor of the dynamical system will be described as follows. Generally, an nth order dynamical system has n state equations, and the state equations indicate the variation ratio of the states of the dynamical system against the variation of time as shown in equation (1). dx1/dt = f(x1, x2, ..., xn), ... dxn/dt = f(x1, x2, ..., xn) where, f: R n - R n stands for a nonlinear mapping, and x1, x2, ..., xn stands for states respectively. Hereinafter, a pendulum motion will be described as an elemental example of the dynamical system, the pendulum motion is expressed by 2 state equations in that the pendulum motion is a second order dynamical system as follows. dx1/dt = f(x1, x2) dx2/dt = f(x1, x2) The solutions of the above state equations consist of a transient solution and a steady state solution. The steady state solution can be expressed in a state space, in which each state variable makes an axis of the state space, so as to express the steady state solution entirely. Namely, the steady state solution at a given time can be expressed as a point in the state space. A set of the points presented in the state space is called an attractor of dynamical system. If the given dynamical system has a finite state, i.e., a finite nth order dynamics system, the system has a four forms of the attractor. Dynamical systems are classified into four types according to the types of the attractor of the dynamical system. Namely, the steady linear system which is the most simple dynamical system has one point attractor in the state space, which is called an equilibrium point. Also, the dynamical system having the steady state solution, and the solution being a periodic solution, has a closed loop-shaped attractor in the state space, which is then called a limit cycle. And, the dynamical system having kth order subharmonic solution, which has a k periods, has a doughnut-shaped attractor. The doughnut is called a torus. The attractor except those of the above-mentioned dynamical system is a strange attractor, and this type of dynamical system is called a chaos system. Namely, the chaos system refers to a system having a strange attractor in the state space, with the exception of said one point attractor, said limit cycle, and said torus. As mentioned above, the attractor may be constructed from the state equation which is presenting the state of the movements of the nature phenomena. In that case, all the n state equations are known in the nth order dynamical system, the attractor may be constructed easily. In fact, however, it is practically impossible to access the whole n state equations let alone state variables, in a given nth order dynamical system. Accordingly, the endeavor has been devoted to construct the attractor of nth order dynamical system from only one state variable. Namely, when an attractor is obtained from the steady state solution of a given state variable, the attractor may be presented in the state space. Since the desired attractor may not be gained in the state space, an embedding space should be introduced. As described above, the constructing of the attractor of the nth dynamical system from a given state variable is called an attractor reconstruction. The attractor reconstruction plays an important role among the researchers who are dependent upon the experiments. The attractor reconstruction has been proposed by Floris Takens in the mid of 1980's. And, the trace time is divided into the same periods, and the corresponding state value of the divided time is presented as an embedding vector, g(t). The embedding vector g(t) is satisfied with the following equation. g(t) = {y(t), y(t+τ), ..., y(t+nτ)} where, y(t) stands for a state value, τ is a delay time which is divided into the same periods, and n+1 is an embedding dimension. If the delay time and the embedding dimension are fixed, the embedding vector is expressed as one point. And the delay time and the embedding dimension is altered, then the embedding vector draws a trace in the embedding space. The embedding vector trace in the given nth order embedding space may not exactly be the same as the trace of the attractor of the given dynamical system, but the embedding vector trace has relation with the trace of the original dynamical system in the qualitative viewpoint (pattern face). However, it needs to determine whether the attractor is constructed from a random noise or the meaningful information from chaos system. There are two kinds of methods for analyzing the reconstructed attractor, one is to analyze the qualitative feature of the reconstructed attractor, which is called a qualitative method, and the other is to analyze the degree of the pattern such as a slope of the attractor, which is called a quantitative method. In case that said reconstructed attractor has a pattern of an equilibrium point, a limit cycle, and torus, it is possible to analyze the attractor only by the qualitative method. The strange attractor, however, is constructed by the reconstruction, it is impossible to determine whether the attractor is constructed from a noise or from a meaningful information only by the qualitative process. Therefore, the strange attractor is analyzed by analyzing the quantitative feature of the attractor. As described above, there are various methods in analyzing the quantitative feature of the reconstructed strange attractor such as the procedure of calculating the capacity of the strange attractor, the procedure of gaining an information dimension, and the procedure of gaining a correlation dimension and the like. The process of calculating the capacity of the reconstructed strange attractor will be described hereinafter. Assuming that the reconstructed strange attractor is covered with a volume element such as a sphere or a hexahedron with a radius r, and that the number of the volume element which is necessary to cover the entire attractor is N(r), the relation N(r) = kr D is satisfied. In case that the radius(r) is reduced enough, then n(r) is solved with regard to the D, the capacity of the attractor (D cap ) is satisfied with the following equation. The process of gaining capacity of the attractor is performed by using the space, but it does not use the information accompanying the state variation of the given dynamical system. Namely, the information dimension employs the following equation in analyzing the quantitative feature of the attractor which is reconstructed by using the information accompanying the state variation of the dynamics system. The P i stands for a probability in which the trace enters into the nth volume element, and δ(r) stands for an entropy of the dynamical system. In the meanwhile, the most convenient procedure of analyzing the quantitative feature of the reconstructed attractor is to gain a correlation dimension, the procedure will be described with detail hereinafter. The number of the states in the circle having a radius (Ri) which corresponds to the distance between a state(Xi) and other state(Xj) is calculated. The gained number of the states is divided by the square number of the state value (N) of the attractor, that is N 2 . The whole number (N) is approached to a infinite, then the correlation sum of a state(X1) can be obtained. That is, correlation sum (C(R)) = lim 1/N 2 {the number of state(Xi, Xj) such that ∥X i - X j ∥ < R }. With the above calculated correlation sum (C(R)), the correlation dimension (Dc) can be calculated by using the following equation. The correlation dimension (Dc) stands for a slope of the linear region of the graph of the correlation sum (C(R)) which is calculated by the equation (1). Namely, the graph of the correlation sum (C(R)) calculated by the equation (1) is plotted in a form convergent toward a certain value. However, the attractor which is constructed by the noise is plotted in a divergent form. And, the correlation dimension (Dc) of the attractor is obtained from the slope of the linear region of the graph which is gained by the equation (1). As described above, in the analyzing process for a quantitative feature of the reconstructed strange attractor, the circuit seeking the correlation dimension is called a chaos processor. In the prior art, the chaos processor has had a great large amount of calculation works, in that the correlation sum is to be obtained from the whole states (X1, X2, ..., Xn). Namely, in order to get a correlation sum, the calculation which is equivalent to the square number of the whole states ( N 2 = N(N-1)/2 ) is needed. Particularly, a common computer does not process the matter in a reasonable time for a high number of the state value. In PHYSICAL REVIEW A (GENERAL PHYSICS), 15 FEB. 1988, USA, vol. 37, no. 4, ATMANSPACHER H ET AL "Global scaling properties of a chaotic attractor reconstructed from experimental data" the metric properties of chaotic attractors are described, with particular emphasis on the global scaling properties and criterion for a sufficient length of the analyzed time series. SUMMARY OF THE INVENTION It is therefore an object of the invention to provide a chaos processor in which an exclusive processor for calculating a correlation dimension of the states of the attractor is realized by a hardware. In order to achieve the above subject, there is provided a chaos processor according to claim 1. BRIEF DESCRIPTION OF THE DRAWINGS The various features and advantages of the present invention may be more readily understood with reference to the following detailed description taken in conjunction with the accompanying drawings. Fig. 1 shows a block diagram of a chaos processor according to a first embodiment of the present invention; Fig. 2 shows a block diagram of a chaos processor according to a second embodiment of the present invention; Fig. 3 shows a time-state diagram which is plotting an example of the state value inputted to a chaos processor in accordance with the principles of the present invention; Fig. 4 shows a diagram of a distance index (Di, Dj)-a number of state representing the correlation sum which is calculated through the chaos processor of the present invention; and Fig. 5 shows a block diagram of a chaos processor according to a third embodiment of the present invention. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Referring to the drawing figures, Fig. 1 shows a block diagram of a chaos processor according to a first embodiment of the present invention. The chaos processor according to a first embodiment of the present invention comprises a switching unit (1) that is adapted to switch a state value of the chaos processor, which in to be analyzed, sequentially according to a time and to output the state value; a state value selecting unit (2) that is adapted to select a state value out of the switching unit (1) on the basis of an embedding dimension (ED) and a delay time (DL); a distance calculating unit (3) that is adapted to calculate a distance (R ij ) on the basis of the two selected state values (Xi)(Xj) which are selected at the state value selecting unit (2) and to output the distance (Ri j ); a correlation sum calculating unit (4) that is adapted to compare the distance (Ri j ) out of the distance calculating unit (3) and a pre-stored distance index (di), and to output a correlation sum (C(r)) corresponding to a distance index which meets to a given distance condition; an inflection point determining unit (5) which is adapted to determine a suitable inflection point of said correlation sum which is out of said correlation sum calculating unit (4); a slope calculating unit (6) which is adapted to calculate a slope of a line which is made by connecting inflection points, and to output a correlation dimension (Dc); and a control unit (7) which is adapted to control the switching unit (1), the state value selecting unit (2), the distance calculating unit (3), the correlation sum calculating unit (4) and the determining unit (5) in response to an input clock signal (CLK), an enable signal (E), an embedding dimension (ED) and a delay time (DL). The state value selecting unit (2) includes a pair of registers. A setting unit (8), which is adapted to input an optimum inflection point from outside, is connected to other input of said determining unit (5). Hereinafter, it will be described an operation of the first embodiment of the present invention with an example of an embedding dimension (ED) = 1, a delay time (DL) = τ = Δt . When a state of the chaos system having strange attractor is inputted to a chaos processor, the inputted state (X(n)) is applied to the state selecting unit (2) through the switching unit (1) which is adapted to switch according to a control signal out of the control unit (7). Assuming that the initial state value of the inputted state (X(n)) is a X(t0), the initial state value X(t0) is applied to the state selecting unit (2) through the switching unit (1), and a state value which is inputted continuously at every delayed time (τ) is applied to the state selecting unit (2) through the switching unit (1). Namely, the initial state value (X(t0)) is inputted to one of two shift registers of said state selecting unit (2), then a state value (X(t0 + Δt)) of the delay time (t0 + Δt) is inputted to the other of two shift registers of said state selecting unit 2, and the inputted state values (X(t0), X(t0 + Δt)) are applied to the distance calculating unit (3) according to a control signal out of the control unit (7). After said inputted state value (X(t0), X(t0 + Δt)) are stored in said registers for a predetermined time, the values are outputted as state values to a time as shown in Fig. 3. With the outputted state values (X(t0), X(t0+ Δt)), a distance between two state values (X(t0), X(t0+Δt)) is calculated through said distance calculating unit (3). In this occasion, since the embedding dimension (ED) is 1, and the delay time (τ) is Δt, the distance (R1) is obtained from the following equation. Distance (R1) = [X(t0) - X(t0 + Δt)] 2 The calculated distance (R1) is applied to the correlation sum calculating unit (4) which compares an inputted distance (R1) and a pro-stored distance index (di) and increases the distance index (di) one by one when the condition of the distance (R1) > distance index (di) is satisfied. Namely, the increased distance index (dj) is satisfied with the following equation (2). Distance index (dj) = di + 1 where, i < j. The above process is performed in delay time (Δt). At the switching unit (1), the state value (X(t0+2Δt) inputted at a moment in which the delay time is 2Δt is supplied to the state value selecting unit (2). With the inputted state value (t0+2Δt)) and the initial state value (X(t0)), the distance (R2) between the two state values is outputted at the distance calculating unit (3). The outputted distance (R2) is compared with the pre-stored distance index (dj) through the correlation sum calculating unit (4). When the compared result is satisfied with the condition of R2 > dj, the distance index is increased. Above described process is performed repeatedly with all state values which are inputted according to the time delay. When a number of the state (Ndj), which is presented in a circle having a diameter corresponding to the increased distance index, reaches a predetermined final number (Dmax), the inputted state value is no more applied to the state value selecting unit (2). Namely, in case that the number of the state (Ndj) presented in a circle having a diameter which corresponds to the distance index (dj) reaches the final number (DMax) through above described correlation sum calculating unit (4), the control signal from the control unit (7) is supplied to the switching unit (1) in order to switch it. By the switching of the switching unit (1), the state value may be prevented from being inputted to the state value selecting unit (2). In the mean while, distance indexes (di)(dj) are selected by said determining unit (5), the distance indexes (di)(dj) having a suitable inflection point in the graph which confers the state number (Ndj) presented in the circle having a diameter corresponding to the inputted distance index. The inflection point may be selected as a distance index (di)(dj) which is predetermined from said determining unit (5), or the user may set the inflection point through the setting unit (8) outside. In order to obtain the inflection point, when the distance index is predetermined through the determining unit (5), a distance index is selected from the distance indexes (di)(dj). The distance index which is satisfied with a minimum distance between said predetermined distance index and a line made by connecting said selected distance index to any other index is searched. Once the distance index is searched, a process is performed in which the searched distance index is set as an inflection point to determine a suitable inflection point. In case that the distance index is determined by the setting unit (8), an optimum inflection point which is predetermined experimentally in the dynamics system to be analyzed is determined from outside. The inflection point determined as above is supplied to the slope calculating unit (6). In the slope calculating unit (6), with an X-Y coordinate plane which is made by a distance index axis (d-axis) and an accumulated state value number axis (Nd) respectively, the state value number being presented in a circle with a diameter equivalent to the distance index, the slope resulted from the increased state value in calculated. In this occasion, the slope is calculated by using the following equation (3). Slope = (log(Ndj)-log(Ndi))/(log(dj)-log(di)) The above calculated slope is a correlation dimension of the chaos system, the slope is in turn a final output (Y(n)) of the chaos processor. As described above, the correlation dimension of the chaos system, which is obtained on the assumption that the embedding dimension (ED) is 1, and the delay time (DL) is Δt, refers to a correlation dimension according to a pointwise process. Fig. 2 shows a block diagram of a chaos processor according to a second embodiment of the present invention. To the output side of the calculating unit (3) as shown in Fig. 1, a distance value converter (9) is connected. The distance value converter converts an inputted distance into an integer and applys it to the correlation sum calculating unit (4). Other elements have same construction as shown in Fig. 1. Namely, the distances (R1, R2, ... ,Rn) from said distance calculating unit (3) have a floating point value, which is applied to the distance correlation sum calculating unit (4), and increases an amount of calculation work greatly. This leads to a delay of the calculation speed. In this regard, it is necessary to convert the distances (R1, R2, ..., Rn) having the floating point through the distance value converter (9) into an integer to be applied to said correlation sum calculating unit (4). It is desirable to convert the inputted distance (Ri) into an integer by applying a log function (log 2 Rij) to the distance (Ri) in said distance value converter (9). Accordingly, the correlation sum calculating unit (4) compares the inputted integer distance (Ri) with the distance index so that the calculating unit (4) can perform said calculation at a very high speed to increase the number of the state value presented in the corresponding distance index. The slope calculated in said slope calculating unit (6) is obtained from the following equation (4). Slope = (log(Ndj)-log(ndj))/(dj-di)) Fig. 5 shows block diagram of a chaos processor according to a third embodiment of the present invention. As shown in Fig. 5, the third embodiment of the invention has the same elements as those of Fig. 1, such as a state value selecting unit (2), a distance calculating unit (3), a correlation sum calculating unit (4), a determining unit (5), a slope calculating unit (6), a control unit (7), and a setting unit (8) except that a memory unit (11) is further included in this third embodiment to store the whole inputted state value (X(n)). Assuming that the embedding dimension (ED) is n and said delay time ( DL=τ ) is pΔt, at a given time ( t=t0 ) and the nth order chaos system, the state value stored in said memory unit (11) is outputted from said state value output unit (12) for a time of (n-1)pΔt. The process may be expressed by a formula as follows, Xi = [X(t0), X(t0+pΔt), ..., X(t0+(n-1)pΔt] And, at t = t0 + Δt , the state value can be expressed as follows. Xj = [X(t0 + Δt), X(t0+(p+1)Δt), ... , X(t0+npΔt)] With the above described state value, the distance value (R1) can be calculated through an equation [Xj-Xj]. From said calculated distance, as described in connection with the Fig. 1, the correlation dimension (Y(n)) of the chaos system can be obtained through said correlation calculating unit (4), said determining unit (5), said slope calculating unit (6), and said control unit (7). Said correlation dimension (Y(n)) refers to a correlation dimension according to a full method. According to the chaos processor of the present invention as described in detail, it is possible to perform a calculation in a reasonable time in that the chaos processor, which is adapted to analyze the quantitative feature of the strange attractor of the chaos system, is constructed with a hardware. Moreover, said distance value can be converted to an integer value to reduce the processing time of the chaos processor.

Claims: A chaos processor comprising: state value selecting means (2) for selecting a state value (X(n)) which is inputted continuously according to an embedding dimension value (ED) and a delay time value (D1), a switching unit (1) for switching a state value of the chaos processor, distance calculating means (3) for calculating a distance R ij between two state values (x i , x j ) selected by said state value selecting means (2) ; correlation sum calculating means (4) for calculating a correlation sum, which said correlation sum calculating means compares said calculated distance (R ij ) with a prestored distance index (d j ) increases a distance index when the condition of said calculated distance (R ij ) being greater than said distance index is satisfied and calculates a sum of states (Ndi) in a circle having a diameter corresponding to said increased distance index (d j ), said comparison being performed repeatedly for all state values which are inputted, in accordance with said time delay (DL); and said state values (X(n)) being applied by said switching means (1) to said state value selecting means (2) until said sum of states (Ndi) reaches a predetermined final number (Dmax); inflection points selecting means (5) for selecting points of inflection from a linear region of the graph of the correlation sum C(R), which corresponds to the number of states present in the circle having a radius which corresponds to the distance between a state (X I ) and another state (X j ); correlation dimension calculating means for calculating said correlation dimension by calculating a slope of a line which is made by connecting said inflection points selected; and a control unit for controlling the switching unit, the state value selecting unit, the distance calculating unit, the correlation sum calculating unit and the determining unit in response to an input clock, an enable signal, an embedding dimension and a delay time, said calculated slope being the final output of said chaos processor. A chaos processor of Claim 1, wherein said chaos processor further comprises converter means for converting a distance value outputted from said distance calculating means, into an integer value. A chaos processor of Claim 2, wherein said distance value is converted into said integer value by applying a log function to said distance value. A chaos processor of Claim 1, wherein said chaos processor further comprises memory means for storing a whole state value inputted to calculate said correlation dimension by a full method. A chaos processor of Claim 1, wherein said inflection point selecting means is adapted to select a distance index from the two distance indices, to search a distance index which is satisfied with a minimum distance between said selected distance index and a line made by connecting said selected distance index to any other index, and to select said searched distance index as an inflection point. A chaos processor of Claim 1, wherein said chaos processor further comprises means for inputting an optimum inflection point which is calculated previously in the chaos system to be analyzed. A chaos processor of Claim 1, wherein said state value selecting means includes a shift register which is adapted to store the inputted state value temporarily, and to shift the state value in sequence.

Inventors: KIM HYUNG SEOP, KIM IN TAEK, WANG BO-HYEUN, KIM, HYUNG SEOP, KIM, IN TAEK, WANG, BO-HYEUN
Applicants: LG ELECTRONICS INC, LG ELECTRONICS INC.
Application year: 1993
Main classification: G06F17
IPC codes: G06F17, G06F19, G06F15