Professional Documents
Culture Documents
Design of A Novel Chaotic Synchronization System: Yung-Nien Wang and He-Sheng Wang
Design of A Novel Chaotic Synchronization System: Yung-Nien Wang and He-Sheng Wang
Oriental Institute of Technology, Ban-Chiao, New Taipei City, 8~9 June, 2013
X n 1 aX n Yn2
Yn 1 bYn X nYn
(1)
With the parameters a = 0.22 and b = 1.75. Fig. 1 shows
the time series. Changing the value of parameter, the
trajectory will also change. It will become another different
trajectory. This is an important characteristic for chaotic
system.
I. INTRODUCTION
Chaos is aperiodic long-term behavior in a deterministic
system that exhibits extremely sensitive dependence on
initial conditions and parameter. Chaos communications is
an application of chaos theory which is aimed to provide
security in the transmission of information performed
through communications technologies. However most of
chaotic communication systems that cant tolerate channel
noise have the powerless performance with noise. In this
paper, we offer the novel method that has the excellent
performance that could resistance to the noise. The rest of
the paper is organized as follows: In the Section II, we
discuss the basic theory and the structure of system. In
Section III, we analysis the property in detail and in section
IV, the simulation result is revealed. Finally, in section V,
we conclude the paper.
II. SYSTEM
We proposed a general approach in the design of the
chaotic communication system that is applied the Burgers
chaotic map. In this system, transmitter uses chaotic signal
to be carrier. Then, the message is not only added to the
chaotic signal but also modulated to the carrier, and
transmitted to the receiver, which is synchronized to the
chaotic component of the signal, thus allowing to extract
the information.
A. A. The Burgers map
The Burgers map is given as follows:
Then : en
Ben , n
0, as n
0, eig B
1.
Rn .
, e0
Theorem 2
Suppose : en
Then : en
An en U n en , n
0, as n
, e0
0, eig An U n
eig B
1.
R .
(2)
mYn ;
bSY ,n
S X , n SY , n
(3)
Received signal:
S ,n S X ,n noise
SY , n
SY , n
noise
(4)
Let the error be defined by:
e
S
S
1n
X ,n
X ,n
e2n
SY , n
SY , n
(5)
The difference error, (the error system), can then be
represented by:
e1n 1 SX , n 1 S X ,n 1
e2n
aSX , n
aS X , n
SY , n
SY , n
bSY ,n
SY2,n
SY2, n
u1n
(6)
S X , n SY , n
bSY , n
S X ,n SY ,n
u2 n
Y ,n
SX , n SY ,n
Y ,n 2n
S X , n SY , n
Xn
S X , n e2 n
e2n
X ,n 1
X ,n 1
ae1n
( SY , n
SY , n
SY , n
SY ,n e1n
Y ,n 2n
SY , n e1n
(7)
1n 1
SY ,n )e2 n
u1n
(8)
(b S X ,n )e2 n
u2n
(12)
rX n (1 X n )
1, if X n
0, if X n
Yn
Yn
(13)
(9)
Where
An
a11n
a12n
a21n
a22 n
,U n
u11n
u12 n
u21n
u22n
, en
e1n
e2 n
u
u22 n n
SY ,n
b S X ,n
21n
where : u1n
u11n e1n
u12 n e2 n and u2 n
versus N for
the Burgers map with X 0
0.1, Y0 Y0 0.1 . About 104
iterations are required to get a result accurate to 1%. In fact,
the error in 1 is of order 1 ~ 1/ N , which is typical for a
chaotic map, although there are exceptions. A much longer
calculation (N = 107) indicates 1 0.178884 0.000316
It is easy to find the sum of LEs that
is 1 2 ln a(b X ) 2Y 2
0.328420 . From the
III. ANALYSIS
A. Lyapunov exponent for Burgers map
Lyapunov exponent (LE) is the most powerful diagnostic
in determining whether the system is chaotic or not. A
positive value signifies chaos, and a negative value implies
a fixed point or periodic cycle.
The LE for two-dimensional case can be defined as follows:
lim
where Yn
1
2N
ln
n 0
( A BYn )2 (C
1 Y n2
DYn )2
(14)
C DYn
and Jacobian matrix
A BYn
F1
X
F2
X
N 1
F1
Y
F2
Y
A B
C D
(15)
ln det( J )
ln AD BC
(16)
lim
1
2N
Where Yn
N-1
ln
n 0
Yn (b X n )Yn
a ( 2Yn )Yn
(19)
1
2
1.352616...
lim
1N 1
ln f ( X n )
Nn0
lim
1
N
N 1
n 0
ln r (1 2 Xn ) (20)
D. FFT
Fig. 9 shows the power spectrum of transmitted
signals S X , SY . The absolute-valued signals have some
unobvious peaks that varied with parameters a.
C. Parameter of system
Chaotic systems have sensitive dependence on initial
conditions and parameter of system. For any chaotic
synchronization system, setting the threshold that is
important can distinguish the power of the signal
representing bits 0 and 1 respectively. In this section, we
measure the parameter of system on bit powers effect. Fig.
4 and 5 shows the representing the power of bits
transmitted in X and Y carrier respectively. The parameter b
is always kept constant at 1.75. The parameter a varied in
steps of 0.005 from a = 0.05 to a = 0.75.
IV. RESULT
A. Single User systems
The received and reconstruction signal are shown in Fig. 10
when the series of 10 bits is transmitted, that is, when m =
[0 0 1 0 0 0 1 1 1 0]. Fig 11 shows the corresponding
squared synchronization error e1n e X , e2 n eY under SNR = 3
dB conditions and Message m. The received bits are
detected by squaring and integrating the error. The output
of the integrator is then compared to the predetermined
threshold and the decision is made whether a bit 0 or a bit 1
was sent.
V. CONCLUSION
In this paper, we propose the novel design of chaotic
synchronization system that has the excellent noise
resistance. The multiple access system combines many
positive features of conventional spread spectrum
techniques. Since all of our results are based on rough
theoretical analysis and simulations, the results in this
paper provide a framework and foundation for future works.
REFERENCES
[1] Branislav Jovic, Synchronization Techniques for Chaotic
Communication Systems, Springer, 2011.
[2] J. Y. Chen, K. W. Wong, L. M. Cheng, and J. W. Shuai, A
secure communication scheme based on the phase
[9]