International Journal of Computer Networks & Communications (IJCNC)

AIRCC PUBLISHING CORPORATION

Performance Assessment of Chaotic Sequence Derived from Bifurcation Dependent Logistic Map in CDMA System

Oluyemi E.  Adetoyi1 and Solomon A. Adeniran2

1 Electrical and Electronic Engineering Department, University of Ibadan, Nigeria

2 Electronic and Electrical Engineering Department, Obafemi Awolowo University, Ile-Ife, Nigeria

Abstract


In CDMA system, m-sequence and Gold codes are often utilized for spreading-despreading and scrambling-descrambling operations. In a previous work, a design framework was created for generating large family of codes from logistic map, which have comparable autocorrelation and cross correlation to m-sequence and Gold codes.  The purpose of this work is to evaluate the performance of these chaotic codes in a CDMA environment. In the bit error rate (BER) simulation, matched filter, decorrelator and MMSE receiver have been utilized. The received signal was modelled for synchronous CDMA uplink for simulation simplicity purpose. Additive White Gaussian Noise channel model was assumed for the simulation. 

Keywords


CDMA, Chaotic codes, Linear Receivers, Logistic Map, Lyapunov exponent

1. Introduction 


Code Division Multiple Access (CDMA) capacity is dependent on a number of factors, of which spreading code plays a crucial role (Meenakshi & Chawla, 2014). Lot of efforts has been made towards developing optimal codes both for synchronous and asynchronous CDMA. The m-sequence, Gold sequence and Kasami sequence that are currently used asynchronously in CDMA, all have limitations. M-sequence has small set and poor cross correlation; Gold codes have poorer correlation than m-sequence, but larger set. Small Kasami has better correlation than Gold, but small set; while large Kasami has poorer correlation values than Gold, but contain more sequences (Meenakshi & Chawla, 2014) (Sawlikar & Sharma, 2011) (Pickholtz, Milstein, & Schilling, 1982).  The essence of this research work is to create a framework for generating large sets of optimal codes for asynchronous CDMA. Recent researches have shown that apart from linear shift registers sequences (m-sequences, gold sequences etc), chaotic sequences have good correlation properties and large family size (Umeno & Kitayama, 1999) (Vladeanu, Banica, & Assad, 2003) (Zhang, Guo, Wang, Ding, & Chen, 2000). The low autocorrelation side-lobes of these chaotic sequences allow for easy synchronization with the receiver; while the low cross correlation reduces the multiple access interference. They have been considered as good candidate for application in DS-CDMA system. In (Adetoyi & Adeniran, 2016), we presented a method for generating chaotic sequences by exploiting the bifurcation control of the logistic map. The BER performance of these bifurcation dependent sequences, in a DS-CDMA environment, is exploited in this paper.

2. Related Work


The generation of OverSampled Chaotic Map binary sequences was presented in (Zhang, Guo, Wang, Ding, & Chen, 2000), where Chebyshev map was also used. The generalized OSCM is

where p = 1 is the parent map.

The binary sequence was obtained by using threshold and also by writing the absolute value of  x in a floating point number with m-bits:

It was found that the balance property of the sequences produced by both methods was worse than Gold sequences or Kasami Sequences, except the period is very large. The sequences were considered good candidate for CDMA and W-CDMA. It is doubtful if large family can be realized.

Two thousand sequences having one million bits length were subjected to NIST randomness test and nine test results were presented. The proportion of sequences that passed the test at a significant level (α) of 0.01 is at least 98.6%. The sequences are considered good enough for secure cryptosystem.

In (Spinsante, Andrenacci, & Gambi), De Bruijn sequences generated from combinatorial mathematics was presented. Although the family size is large, the generation process is complex. The analysis was shown only for De Bruijn sequences with a length of 32 bits. The normalized radar ambiguity diagrams of De Bruijn and the chaotic sequences was compared, the differences in their performance, with respect to distance and doppler resolution determined by the main peak level, and the sidelobes level on the plane, were not significant. Results show that in some scenarios, and with given assumptions, De Bruijn sequences may provide improved performance with respect to systems adopting chaotic sequences. It was suggested that it can be used in DS-CDMA if the correlation selection criteria is defined, then its performance will be comparable to currently used CDMA codes.

In (Suneel, 2009), the sequences generated from Henon map was considered random enough and having large key space to be used for cryptographic applications. Henon map is a two-dimensional discrete-time nonlinear dynamical system represented by the state equations:

A multilevel spreading codes for DS-CDMA using ternary and quaternary Gray Inverse Gray (GIG) codes was proposed in (Usha & Sankar, 2013). The 3-level, 6-length ternary and 4-level, 8-length quaternary GIG codes obtained have autocorrelation and cross correlation that is better than Gold.

3. Bifurcation Dependent Chaotic Sequences – A Revisit


The method for generation of the bifurcation dependent sequences has been fully described in (Adetoyi & Adeniran, 2016). The discrete form of the original logistic map was modified to accommodate the bifurcation control in Equation 1.

where, LT1, LT2 and LT3 are three partitions obtained from Lloyd algorithm.

The family of sequences generated, by the perturbation of the bifurcation parameter can be represented in matrix form for k number of sequences of length n each, as

Figure 1. Chaotic domains creation based on Lyapunov exponent estimation

4. CDMA RECEIVED SIGNAL MODEL 


While transmission from mobile to base station is done asynchronously, it is often the case to model it, as synchronous CDMA for simulation and analysis purpose (Liu). A CDMA channel with K users sharing the same bandwidth is shown in Figure 1. In this model, all the users simultaneously access a communication channel. The users of the system are identified at the base station by their unique spreading code Sk(t). The signal that is transmitted by any user consists of the user’s data bk that modulates its spreading code.  Baseband transmission was employed. Then the received signal is

where, K is the total number of users, Ck is the channel attenuated amplitude, n(t) is the additive white Gaussian noise with σ2 as variance, bk and Sk(t) are as defined above

5. Linear Receivers


Figure 2. Received signal model for forward and reverse links

5.1. Matched Filter 

Matched filter bank, which is depicted in Figure 3, is the simplest receiver and usually the first stage in the base band signal detection. Almost all modern multi-user detection techniques deal with the output of the matched filter bank and the cross-correlation information of all users in the system (Venkateswarlu, Sandeep, & Chakravarthy, 2012). Matched filter was designed for orthogonal signature waveforms, which correlates the received waveform with the suitably delayed version of the spreading code. It does not cancel the effect of interference from other users, which is a main drawback of its use in CDMA system.  Each of the filters weight is matched to the signature waveforms assigned to the users. It is an optimum receiver of known signal in Additive White Gaussian Noise (AWGN) environment. But in CDMA systems, matched filter is not the optimum receiver because the power of system’s MAI signal is very high at output of matched filter. Received signal at base band is given by Equation 1. The output of each matched filter can be represented as y1(t), y2(t), …, yk(t). The output can be defined for the K-th user matched filter (Liu), as

The crosscorrelation between the kth and jth user spreading sequences can be defined as

The decision is made by taking the signum of the matched filter output as follows

From equation 5b, the outputs of the matched filters for all users in matrix form is

where R is the normalized crosscorrelation matrix whose diagonal elements are equal to 1 and non-diagonal elements is equal to the cross-correlation ρkj,

and n is a Gaussian random vector with zero mean and covariance matrix σ2R.

5.2. Decorrelator 

The decorrelator is shown in Figure 4. It is a linear detector which applies a linear transformation to the matched filter output to eliminate the effect of multiple access interference, thus providing unbiased estimates (Venkateswarlu, Sandeep, & Chakravarthy, 2012). The transformation R-1, which is the correlation matrix inverse, is applied (Liu). It does not require prior knowledge of the received power and its performance is independent of the power of interfering users so that it solves the near-far problem. The main problem in the decorrelator detector is the neglect of noise term in the data estimate b, which leads to noise enhancement.  Moreover, the structure of this detector needs to know the entire signature codes of the system’s users and this makes the structure complex. The decision for the kth user is made based on

5.3. MMSE Detector  

Figure 3. Conventional matched filter receiver for multiple user detection

Figure 4. Decorrelating detector

Figure 5. Six users BER performance of M, Gold and Logistic sequence for matched filter receiver

6. SIMULATION RESULT


The three multiuser receivers has been chosen such that the performance of the sequences can be accessed under varying noise and interference conditions. The matched filter is the worst case scenario, since it does not provide means of reducing interference and noise. The decorrelator reduces interference, but enhances noise; while the MMSE provide means for mitigating both interference and noise. Equation 8, 9 and 10 corresponding to the mathematical model of the matched filter, decorrelator and MMSE respectively, were implemented with MATLAB sub-routines. All the six 63-bit M-sequences, first six out of sixty-five 63-bit Gold sequences and first six out of two hundred and forty-nine 62-bit bifurcation dependent logistic sequences generated

Figure 6. Six users BER performance of M, Gold and Logistic sequence for decorrelator receiver

from D1 domain, were utilised for simulating six users transmission. Each of the six user transmission consists of 100,000 bits of data spread by his respective user code. The transmitted data are corrupted by AWGN in the channel. The BER of logistic sequence was compared to Gold and m-sequence for the matched filter, decorrelator and MMSE receiver types, in a CDMA environment of six users as shown in Figures 6-8 respectively. In Figure 6, logistic sequence has worst BER performance for matched filter receiver; while it has best performance for decorrelator and MMSE as shown in Figure 7 and 8 respectively. In Figure 9, the BER performance of logistic sequence was considered for all the receiver types. It can be seen that decorrelator provides the best reception for logistic sequence. The spectral analysis of random sample logistic, Gold and m-sequences were conducted by taking the Fast Fourier Transform and shown in Figures 10-12.

Figure 7. Six users BER performance of M, Gold and Logistic sequence for MMSE receiver

Figure 8. Six users BER performance of Logistic sequence for matched filter, decorrelator and MMSE receiver

Figure 9. Spectrum of 63-bits Gold Sequence

Figure 10. Spectrum of 63-bits Gold Sequence

Figure 11. Spectrum of 62-bits Logistic Sequence

Figure 12. Spectrum of 63-bits M-Sequence

7. CONCLUSIONS


It can be observed from the result that logistic sequences show better BER performance than Gold and m-sequences for Decorrelator and MMSE receiver. Also, the decorrelator receiver proves to be an optimal receiver for logistic sequences, compared to matched filter and MMSE receiver. Furthermore the frequency spectrums of the logistic sequences are wideband, due to the low MSAAC values. However the spectrums of the logistic sequences are not as flat as m-sequence, but the flatness is comparable to Gold sequences.

Acknowledgements 


This work was supported by the Nigerian Tertiary Education Trust Fund under academic staff training and development programme.

References 


[1]     Meenakshi and M. P. Chawla, “A review comparison of different spreading codes for DS CDMA,” IJSRD – International Journal for Scientific Research & Development|, vol. 2, no. 2, pp. 995-999, 2014.

[2]     A. Sawlikar and M. Sharma, “Analysis of different pseudo noise sequences,” International Journal of Computer Technology and Electronics Engineering (IJCTEE), vol. 1, no. 2, pp. 156-161, 2011.

[3]     R. L. Pickholtz, L. B. Milstein, and D. L. Schilling, “Theory of spread-spectrum communications-A tutorial,” IEEE Transactions on Communications, vol. com-30, no. 5, pp. 855-884, May 1982.

[4]     K. Umeno and K. Kitayama, “Spreading sequences using periodic orbits of chaos for CDMA,” Electronic Letters, vol. 35, no. 7, pp. 545-546, April 1999.

[5]     C. Vladeanu, I. Banica, and S.El. Assad, “Periodic chaotic spreading sequences with better correlation properties than convectional sequences-BER performances analysis,” in Signals,Circuits and Systems, 2003. SCS 2003.International Symposium on, vol. 2, Iasi,Romania, 2003, pp. 649-652.

[6]     H. Zhang, J. Guo, H. Wang, R. Ding, and W Chen, “Oversample chaotic map binary sequences: Definition, performance and realization,” in Circuits and Systems, 2000. IEEE APCCAS 2000., Tianjin, 2000, pp. 618-621.

[7]     O. E. Adetoyi and S. A. Adeniran, “Chaotic Sequence Derived from Bifurcation Dependency,” International Journal of Scientific & Engineering Research , vol. 7, no. 4, pp. 165-169, April 2016.

[8]     N. K. Pareek, V. Patidar, and K. K. Sud, “A random bit generator using chaotic maps,” International Journal of Network Security, vol. 10, no. No.1, pp. 32-38, 2010.

[9]     S. Spinsante, S. Andrenacci, and E. Gambi, “De Bruijn Sequences for Spread Spectrum Applications: Analysis and Results”.

[10]   M. Suneel, “Cryptographic pseudo-random sequences from the chaotic,” Sadhana, vol. 34, no. 5, pp. 689-701, October 2009.

[11]   K. Usha and K. J. Sankar, “New Multi Level Spreading Codes for DS CDMA Communication,” in Conference on Advances in Communication and Control Systems (CAC2S 2013), 2013, pp. 154-159.

[12]   Y. Liu. Simulation Comparison of Multiuser Receivers in DS/CDMA Systems. [Online]. http://plaza.ufl.edu/yongliu/projectreport.PDF

[13]   Y. Venkateswarlu, K. Sandeep, and A.S.N. Chakravarthy, “CDMA and MAI problem elimination methods,” International Journal of Scientific and Research Publications, vol. 2, no. 7, pp. 1-13, 2012.

[14]   Z. Mahtab, S.J. Ahmed, S.S. Hussain, and S. Hasan, “CDMA based wireless transceiver system matlab simulation and FPGA implementation,” in Engineering Sciences and Technology,2005.SCONEST 2005. Student conference on, Karachi, August 2005, pp. 1-9.

Authors 


https://ijcncdotcom2.files.wordpress.com/2016/10/capture-33.jpg?w=744Oluyemi Adetoyi obtained her B.Sc. degree in Electrical and Electronic Engineering from University of Ibadan, Nigeria. Her M.Sc. degree in Electronic and Electrical Engineering was obtained from Obafemi Awolowo University, Ile-Ife, Nigeria. She was a lecturer at different time at Adekunle Ajasin University in Nigeria and at Babcock University between. Currently, she is a lecturer with University of Ibadan, Nigeria. She is currently pursuing her PhD in Communication Engineering at Obafemi Awolowo University, Ile-Ife, Nigeria. Her research interest is in wireless communication and data security.

Solomon Adeniran is a lecturer with the Department of Electronic and Electrical     Engineering, Obafemi Awolowo University, Nigeria. His area of research work spans passive components for microwave networks, DSP and communication systems.

%d bloggers like this: