PERFORMANCE ANALYSIS OF DS-CDMA SYSTEM WITH CHAOTIC

BERNOULLI SEQUENCES AND TURBO CODING

Dr. S. Anuradha
Assistant Professor, ECE Dept.
NIT Warangal
anuradha@nitw.ac.in (9490334276)

Dr. P. S. Rao
Associate Professor, ECE Dept.
NIT Warangal
patri@nitw.ac.in (8702462439)

Snehal Chipade
B. Tech. ECE Dept., NIT Warangal
csnehal@student.nitw.ac.in (9642743737)

Piyush Meshram
B. Tech. ECE Dept., NIT Warangal
mpiyush@student.nitw.ac.in (7842412862)

Abstract- In this paper, use of twodimensional Bernoulli chaotic sequences is

proposed as spreading codes. The main
feature of this sequence is its excellent autocorrelation and cross-correlation properties.
The performance of the DS-CDMA system is
analyzed and demonstrated in a multi-user
environment by means of computer
simulation with AWGN and Rayleigh fading
channel using BPSK modulation schemes.
These results reveal that the proposed system
performs better compared to the conventional
Gold code sequence. Then turbo-codes are
applied to system in AWGN channel.
Significant improvement in performance with
turbo codes is observed.

correlation and BER performance play a major

role. So it is needed to generate spreading code
such that it achieves above attributes which
helps to eliminate undesirable effect like Inter
Symbol Interference (ISI), Multiple Access
Interference (MAI) by reducing the chance of
false synchronization.
The most commonly used sequences in DSCDMA are maximal length (m-sequence), Gold
and Kasami which are described in [2], [5] and
[7]. In [4] and [8], it has been shown that chaotic
sequences with exponentially vanishing autocorrelation function can
improve
the
performance of spreads spectrum systems.
Complex chaotic sequences are introduced in
[3], and performance of the DS-CDMA system
with them has been studied. The spread
spectrum system can have better performance in
terms of cross-correlation and the average Bit
Error Rate (BER), using two-dimensional or
complex sequences. This is due to more
flexibility to select real and imaginary parts of
each sequence.
When digital data is transmitted through a
communication channel, errors are embedded
into it. Error Detection Coding is used to detect
the errors in the received information and these
errors can be corrected by the use of Error
Correction Coding. Error Detection Coding and
Error Correction Coding when used collectively,
is known as Error Control Coding [6]. Most
popular ECC is Turbo Coding. Turbo Codes are
also known as Parallel Concatenated codes and
the decoding complexity is small for the

Keywords:
DS-CDMA
system,
Auto
correlation, Cross-correlation, Rayleigh fading
channel, Complex Chaotic Sequence, Turbocodes.
I.

INTRODUCTION

Code Division Multiple Access (CDMA) is

used as a multiple access technique in
telecommunications radio system that can
transport multimedia traffic at high data rates.
The most important goal of spreading spectrum
communication
system
is
to
protect
communication signals against interference and
exploitation of information by unintended
listeners. In DS-CDMA system, low probability
of detection and intercept are achieved by
multiplying the data information with spreading
sequences. In a CDMA system minimum
magnitude of cross correlation, availability of
more number of codes, impulsive peak auto

dimension of code, whereas the code length

possible is very long. The bounds of Shannons
Limit also become achievable for all practical
purposes because the decoding complexity
becomes small [1].
Different sections of the paper will be
arranged as follows. In the second section,
Conventional Gold Sequence is introduced.
Section 3 and 4 explain the proposed two
dimensional Bernoulli chaotic sequences and its
generation. Section 5 introduces usage of turbo
codes in DS-CDMS system. In Section 6,
analysis and computer simulation results are
depicted. Section 7 is devoted to conclusions.
II.

CONVENTIONAL GOLD
SEQUENCES

For CDMA applications, m-sequences

are not optimal. In CDMA system, we need to
construct a family of spreading sequences, in
which the codes have well-defined crosscorrelation properties. One popular set of
sequences that possess good cross-correlation
property are the Gold sequences. Gold
sequences are efficient because they can be
easily generated with simple circuitry. A Gold
sequence can be constructed by the XOR
operation
of
two
synchronous
msequences.Figure shows the schematic for Gold
code generation.

(where m = 5) is taken, and performing the

modulo-2 sum of the two sequences for each of
the L=2m-1 cyclically shifted version of one
sequence relative to the other sequence.
III.

CHAOTIC BERNOULLI
SEQUENCES

Different chaotic sequences with proper

auto-correlation features for DS-CDMA systems
are presented. Generally, chaotic sequences are
generated by recursive maps and have particular
properties. One of these properties is extreme
sensitivity to initial values, as for the two initial
values that are very close together, after a few
steps, the output values will have a large relative
distance from each other.
Bernoulli map used to generate chaotic
sequence is defined as follows
(xn+1) =

2
2 1

0 0.5
0.5 1

(1)

By choosing the initial point x0 (0,1), a

real valued chaotic sequence is {xn = n(x0)}
obtained, which means that the function is
applied for n times. A binary converter function
is used for converting the continuous values (xn)
to +1 value.
Binary converter function B(x) is
defined as follows
B(x) = 1 3 + 3 ( )
8

(2)

Where, () is the threshold function given as

=
Fig.1 Gold code sequence generator
To achieve increased capacity, at an
expense of altering the correlation properties
slightly, a pair of m-sequences may be used to
generate a set of Gold sequence, which has the
property that the cross-correlation is always
equal to 1, when the phase offset is zero. Nonzero phase offset produces a correlation value
from one of the three possible values. In this
work a pair of specially selected m-sequences

1 ( < )
1 ( )

(3)

It is also possible to use other binary functions.

IV.

DS-CDMA SYSTEM WITH

TWO DIMENTIONAL
BERNOULLI SEQUENCE

In case of using two-dimensional or

complex sequences, two different Bernoulli
sequences with different initial conditions, as
real and imaginary parts of a two-dimensional
sequence are used. So, there is more freedom of

choice of sequences with appropriate crosscorrelation properties.

parallel concatenation of two convolutional

codes separated by an interleaver or permuter.
An iterative process through the two
corresponding decoders is used to decode the
data received from the channel. Each elementary
decoder passes to the other soft (probabilistic)
information about each bit of the sequence to
decode. This soft information, called extrinsic
information, is updated at each iteration. Block
diagram of turbo coding is as shown in Fig.3.

Fig.2 DS-CDMA transmitter with complex spreading

sequence

Above figure illustrates the block

diagram of a DS-CDMA transmitter in complex
mode (for the kth user).
=

= (

(4)

Where, bk(t) is the data waveform for the kth

user. {1} and Tb is the bit time duration.
=

= (

(5)

Where, ck(t) is the spreading code for the kth user

and {1 } and Tc is the chip time. (. )

is the rectangular pulse and ratio is called

spreading factor.
At the receiver end, to detect the data bits,
the received waveform is firstly down-converted
to baseband. Despreading is performed by taking
the dot product of the base-band signal with the
Hermitian Transpose of the spreading sequence
(assuming perfect synchronization at code
level). After despreading, most of the
transmitted bit energy concentrated in the real
parts of the signal will provide the complex
spreading sequences which have proper autocorrelation properties. Hence, the real part alone
is considered for the detection purpose.
V.

ERROR CONTROL CODING

WITH TURBO CODES

Turbo codes are error-correcting codes with

performance close to the Shannon theoretical
limit [SHA]. The encoder is formed by the

Fig.3 Block diagram of turbo encoder and decoder

Turbo encoder used at transmitter contains two

parallel concatenated RSC convolutional
encoders with same trellis structure. Trellis
structure used for simulations is poly2trellis(4,
[13 15], 13). Decoder used at the receiving end
is a posteriori probability decoder with the same
trellis structure as encoder. The algorithm
running inside decoder 1 is Viterbi algorithm.
The output of decoder 1 is interleaved and then
fed to decoder 2. Then, the output from decoder
2 is fed to decoder 1 and this process of
transferring the information back and forth
continues until some maximum number of
iterations is achieved. We have analyzed the
performance of system for different number of
iterations.
VI.

SIMULATION RESULTS

DS-CDMA system was studied with two

types of spreading sequences and two channel
environments like AWGN and Rayleigh fading
channel. In this paper, Conventional gold
sequence performance is compared with new
chaotic sequences generated using Bernoulli
map.
It is observed that the BER performance of
chaotic sequences is better than Gold sequences.

Also, observed that the performance with

Bernoulli chaotic sequences is better even for
increased number of users.

Fig 4 and 5 depict performance of DS-CDMA

system under AWGN channel is better than
Rayleigh fading channel because AWGN is a
non-fading channel. System is studied with error
control coding using turbo encoders and
decoders. Fig.7 shows the BER improvement
with increase in number of iterations at decoder.
For number of iterations more than 3, BER
drops to zero after SNR of 2 db.

Fig.4 BER Vs Eb/N0 for AWGN channel

Fig.7 Turbo codes BER performance in AWGN

channel for Bernoulli sequences
VI.

Fig.5 BER Vs Eb/N0 under Rayleigh fading

channel

Fig.6 BER Vs number of users for Gold and

Bernoulli sequences

CONCLUSION

In this paper, two-dimensional Bernoulli

chaotic sequences are introduced. They can be
used to generate complex spreading sequences
for utilizing in DS-CDMA system. The
considerable properties of Bernoulli chaotic
sequence are due to the negative auto-correlation
at lag one. Employing the new sequences can
improve the performance of systems compared
with the conventional spreading codes. The
performance improvement is due to the
following reasons: the proper auto-correlation
function and more freedom of choice of
appropriate codes among complex codes which
results in decrease in BERs and increase in
cellular capacity.
It is also concluded that turbo codes
provide better error performance and sufficient
coding gain as compared with system without
turbo coding.

VII.

REFERENCES

[1] Claude, B., & Alan, G. (1996). Near

Optimum Error Correcting Coding and
Decoding: Turbo Codes, IEEE Transactions on
Communications, Vol. 44, No. 10.
[2] Kurian, A. P., Puthusserypady, S., & Htut, S.
M. (2005), Performance enhancement of
DS/CDMA system using chaotic complex
spreading sequence. IEEE Transactions on
Wireless Communications, 4, 3.
[3] Proakis, J., & Salehi, M. (2008). Digital
communications (5th ed.). New York, NY:
McGraw Hill.
[4] Rovatti, R., & Mazzini, G. (1998).
Interference in DS-CDMA systems with
exponentially
vanishing
autocorrelations:
Chaos-based spreading is optimal. Electronics
Letters, 34(20), 19111913.
[5] Stavroulakis, P. (2005). Chaos applications
in telecommunications. Hoboken, NJ: CRC
Press. ISBN-13: 978-0849338328.
[6] Todd K. Moon, Error Correction
CodingMathematical Methods and Algorithms.
[7] Torrieri, D. (2011). Principles of spreadspectrum communication systems. (2nd ed.).
Berlin: Springer. ISBN-13: 978-1441995940.
[8] Tsuneda, A. (2005). Design of binary
sequences
with
tunable
exponential
autocorrelations and run statistics based on
one-dimensional
chaotic
maps.
IEEE
Transactions on Circuits and systems-I, 52(2),
454462.