Chaotic Turbo Codes in Secure Communication

(For Mobile Communication Systems stream)

Xiao-lin Zhou, Jian-bo Liu, Wen-tao Song, Han-wen Luo Electronic Engineering Department of Shanghai Jiaotong University Room 910, Haoran Hi-tech Bldg., Shanghai Jiaotong University, Shanghai, China (200030). Fax: (86)-21-62932159 E-mail: xlzhou@mail.com

Abstract
This extended ,abstract presents,a new class of codes, Chaotic Turbo Codes, which can be used in chaotic secure communication. In our research, the conventional Turbo Codes and Chaotic Digital Encoder are implemented together in an effective way. After a lot of simulation, we find Chaotic Turbo Codes ,bring some important properties to both Turbo Codes and the chaotic secure communication. We also make great efforts into developing and evaluating some practical chaotic iterative decoding algorithms for efficiently exploitation. is hardly occurred under realistic mobile channel conditions. There is a need for robust and efficient coding and decoding algorithms for reducing various forms and amounts of channel distortion. During the past few years, a novel class of binary parallel concatenated recursive systematic conventional codes termed Turbo-codes [11 was introduced. Turbo-codes has several amazing error-correcting capabilities which can be used in chaotic secure communication. As known to all, interleaver that is a key component in turbo-codes may bring decoding latency. According to [2], taking the Chaotic Digital Encoder as a fragment, we designed a Chaotic Turbo-codes Encoder. Simulation shows that interleaver can be eliminated in this Chaotic Turbo Coding method. Thus decoding latency is reduced. Chaotic Turbo Coding [3] can make use of advantages of the conventional Turbo-codes and the chaos sequence to overcome disadvantages of each other. Firstly, with good error-correcting capabilities of Turbo-codes, we can enhance the robust of the chaotic communication system. Secondly, with good self-correlation property and mutual-correlation property of chaotic sequence, we can reduce the decoding delay by using a chaotic encoder
199

1. Introduction

In recent years, there has been tremendous interest worldwide in the possibility of exploiting chaos in wideband communications system. A chaotic sequence has several good properties of a noise-like waveform, wideband spectrum, and most importantly, sensitive dependence on initial conditions. All these important properties can make chaotic sequence to be widely used in the chaotic secure communication. But at present, without coding, chaotic secure communication is developed for high signal-to-noise ratios (SNR) channel which
0-7803-~90-2l01/$10.~ 0 1IEEE 02

in a turbo encoder. And finally, because of being incorporated one or more key [2], variations on the Chaotic Digital Encoder allow high security in communication.

of the two Chaotic Digital Encoders have good

pZi&-JJF]47, Encoder
Henon Mop
I

2. Chaotic a r b 0 Encoder
After a lot of simulation, we have designed several kinds of Chaotic Turbo Encoder. Fig.1 shows the block diagram of 1 - rate Chaotic Turbo Encoder which is

decision)

2L

Fig2 Chaos shift key based on contract Yon Henon maps

composed of two Chaotic Digital Encoders in parallel to produce concatenated outputs.

1

To

x(k)

channel
b

mutual-correlation property by choosing appropriate Modified LCIRC Block A and Block B. As shown in Fig 1, binary digits, B(k) , are mapped on either 0 or 2(L-) at a time. And then the coded outputs X(k),

y,(k)

and

Y2(k) which ,

are L bits and can

modulate one or more pulses, are punctured to a higher global rate.

Fig. 1 Chaotic Turbo Encoder

According to the in phase synchronization and anti phase synchronization of contraction maps [4], such as Henon map, digital signals to be transmitted are mapped into two synchronous phases of chaotic systems. A coherent demodulation for chaos shift keying is presented, as shown in Fig 2. We also designed a Chaotic Turbo Encoder with two basic Chaotic Digital Encoders by using different Modified LCIRC Block A and Block B [2], shown in Fig 1. According to [2],with appropriate parameters in LCIRC, we can get high communication security. Just as RSC (Recursive Systematic Code ) in conventional Turbo-codes, these two basic Chaotic Digital Encoders are key fragments in Chaotic Turbo Encoder. Simulation shows that the output sequences

3. Chaotic limbo Decoder

After transmission over channel, the noisy received information bits sequence and encoded sequence are R(k),

Yrl(k) and

Y r 2 ( krespectively. )

1 This - rate Chaotic Turbo Decoder 2 with two sub-decoders is shown in Fig 3.

T
I

Decoder

F i g . 3 Chaos Turbo iterative Decoder

For the special property of chaotic sequence, we have designed modified

iterative SISO algorithms which can avoid . the complexity of maximum likelihood decoding algorithms. Simulation has shown that this Chaotic Turbo Decoding method has good error-correcting capabilities to reduce channel distortion.

1995, 198: 14-22.

4. Conclusions
This extended abstract describes a Chaotic Turbo Encoder and Decoder. Some preliminary results that we have gotten are present. And the main block of Chaotic Turbo Encoder and Decoder is also pointed out in Fig [ 1,2,3]. Simulation demonstrates that chaotic signal with Chaotic Turbo Coding has better error-corrected capabilities than that of chaotic signals without coding. Although Chaotic Turbo Codes is still very young and great efforts should be paid on this domain, simulation proves that Chaotic Turbo Codes will get significant improvement in chaotic secure communication.

References
[l]. C.Berrou, A. Glavieux and P. Thitimajshima, Near Shannon limit error-correcting coding and decoding: turbo-codes, ICC 1993, Geneva, Switzerland, pp. 1064-1070, May 1993. [ 2 ] . D.R.Frey, Chaotic digital encoding: an a approach to secure communications, IEEE Transactions on Circuits and System, vol40, no.10, pp.660-666, Oct. 1993. [3] S.Adnan Barbulescu and Andrew Guidi, Chaotic Turbo Codes ISIT 2000, Sorrento, Italy, June 2000 [4] Ushio Toshimitsu. Chaotic synchronization and controlling chaos based on contraction mappings. Phys. Lett. A,

201