Bit Error Rate Analysis of DS-CDMA System With Convolutional Codes

International Journal of Advance Foundation And Research In Science & Engineering (IJAFRSE)
Volume 1, Special Issue , ICCICT 2015. Impact Factor: 1.036, Science Central Value: 26.54
Bit Error Rate Analysis of DS-CDMA System with Convolutional Codes

Tajinder Saini
Hardeep Kaur
Department of Electronics technology
Department of Electronics technology
G.N.D.U. Amritsar
G.N.D.U. Amritsar
tajindersaini90@yahoo.com
hardeep.gndu@gmail.com
ABSTRACT
Direct sequence spread spectrum has become the dominant technology in advanced wireless
communication system. The same frequency band is shared by several users simultaneously and
users data is separated by mutually orthogonal spreading codes. DS-CDMA is suitable for
integration with modulation techniques like QAM/PSK. In this paper we have used DS-CDMA over
AWGN channel with BPSK modulation. Further its BER performance is evaluated with and without
convolutional coding using AWGN, Rayleigh and Rician fading channels
Index Terms: AWGN, BER, BPSK, DS-CDMA, Rayleigh, Rician
I. Introduction
Direct sequence spread spectrum is a promising multiple access technology for present and next
generation mobile communication systems [1]. In this technique multiple users can access a single
communication channel by using unique spreading codes. The signal which is transmitted by any user
consists of users data that modulates its spreading code which in turn modulates a carrier. The special
code acts as a noise to the jammer who tries to jam the signal. The detector receives a signal composed of
sum of all users signals which overlap in time and frequency. In this system particular users signal is
detected by correlating the entire received signal with that of users coded waveform. It is an area of
growing interest due to its attractive properties which has led to increase in capacities over TDMA and
FDMA systems [2]. The next section contains a description of PN sequences. In the third section a detailed
look at the Convolutional codes is given. We then describe the DS-CDMA followed by fading channels and
our simulation results. The last section contains the concluding remarks and future work.
II. PN Sequences
These are periodic, deterministic and binary sequences with a noise like wave form. It is also known as
Pseudo-random noise since it looks random for the user who does not know the code. The longer the
period of PN spreading code, the harder will be the detection of the sequence. A good PN sequence s(t) is
characterized by an autocorrelation function which is high near =0 and low for all 0. As several users
are sharing the same band using different PN sequences, therefore the cross correlation among different
pairs of PN sequences must be small to reduce mutual interference. The most widely known PN
sequences are the maximum length shift register sequences [3]. This sequence can be generated using
feedback shift registers which are made up of m flip-flops that have two states memory stages and logic
circuit as shown in figure below.
1 | 2015, IJAFRSE and ICCICT 2015 All Rights Reserved
www.ijafrse.org
Fig.1 Block diagram of PN sequence [2].

DSSS spreading code is a short code if the PN sequence period equals the data symbol period. It is called a
long code if the PN sequence period is a multiple of data symbol period.
The properties of PN sequences are
1) Balance property: In each period of PN sequence, the no. of 1s is one greater than no. of 0s.
2) Run property: Run is a subsequence of 1s or 0s. Of all the runs in the sequence of each type
a. One half of the runs are of length 1
b. One quarter of the runs is of length 2
c. One eighth of the runs are of length 3 etc.
3) Autocorrelation Property of PN Sequences: If the period of the sequence is compared term by
term with any cyclic shift of itself, it is best if the number of agreements differs from the number
of disagreements by not more than one count [2].
III. Theory of Convolutional Codes
Convolutional codes were first introduced by Elias in 1955 [3]. Since then they have gained vast
popularity in practical applications. The codes are not only equal to block codes in performance but also
relatively simpler to decode. Convolutional coding is a special case of error-control coding. Unlike a block
coder, a convolutional coder is not a memoryless device. Even though a convolutional coder accepts a
fixed number of message symbols and produces a fixed number of code symbols, its computations
depend not only on the current set of input symbols but on some of the previous input symbols.
A convolutional code is specified by three parameters: the codeword length n, the message length k, and
the constraint length v defined as the number of previous messages involved, M, plus 1. So, an (n, k, v)
convolutional code involves not only the current message but also v - 1 previous ones. The parameter M
refers to the memory depth of the code [9].
Fig.2 Structure of binary convolutional encoder [3]

For an (n, k, v) binary convolutional code, the message input to the encoder is a binary sequence. Upon
receiving an input bit mt at time t, the encoder produces an n-bit codeword ct = (c(1)t , c(2)t .. c(n)t ) as
follows:
www.ijafrse.org
where j = 1, 2 n and gi(j) {0,1} are the coefficients. These coefficients constitute the encoding logic of
the encoder. In case of a feedback encoder, we need a vector of feedback connection polynomials. The
length of this vector is the number of inputs in the encoder diagram. The elements of this vector indicate
the feedback connection for each input, using an octal format.
A trellis description of a convolutional encoder shows how each possible input to the encoder influences
both the output and the state transitions of the encoder. The figure 3 depicts a trellis for the
convolutional encoder of figure 2. The encoder has four states (numbered in binary from 00 to 11), a onebit input, and a two-bit output. (The ratio of input bits to output bits makes this encoder a rate-1/2
encoder.) Each solid arrow shows how the encoder changes its state if the current input is zero, and each
dashed arrow shows how the encoder changes its state if the current input is one. The octal numbers
above each arrow indicate the current output of the encoder. If the encoder is in the 10 state and receives
an input of zero, it outputs the code symbol 3 and changes to the 01 state. If it is in the 10 state and
receives an input of one, it outputs the code symbol 0 and changes to the 11 state [4]. Convolutional
decoding is the process of searching for the path that an encoder has traversed.
Three main convolutional decoding schemes exist: sequential decoding, majority-logic decoding, and
Viterbi decoding. Sequential decoding is the first practical decoding technique for convolutional codes.
Majority-logic decoding scheme appeared some time later. In 1967 Viterbi published a new decoding
method, known as the Viterbi algorithm. It is the most widely used decoding method in practice and gives
satisfactory performance [3].
Fig.3 Trellis for the convolutional encoder [4]

Further the decoding can be performed with hard or soft input, and the decoder may output hard or soft
decision data. In hard decision decoding each received channel bit is assigned a value of one or zero at
the demodulator depending whether the received noisy data is higher or lower than a threshold. The
decoder then uses the redundancy added by the encoder to determine if there are errors and if possible
to correct the errors. Corrected codeword is the desired output of the decoder. A soft decision decoder
receives not only the binary value of 1 or 0, but also a confidence value associated with the given bit. The
demodulator places very high confidence on the bit if it is certain that the bit is 1 otherwise places a
lower confidence value. A soft input decoder can output either hard or soft decision data [5].
IV. DS-CDMA System
www.ijafrse.org
A direct sequence spread spectrum signal is amplitude modulated by a very high rate NRZ binary stream
of digits. Hence if the original signal is s(t) , where
s(t)= (2Ps)1/2 d(t) cos wo t
(2)
then the DS spread spectrum signal is given as:

v(t) = g(t) s(t) = (2Ps)1/2 g(t) d(t) cos wo t
(3)
where g(t) is a pseudo random noise binary sequence having the values +1 or -1 [6]. The DSSS system
satisfies certain requirements like: 1) The spreading signal has a bandwidth much larger than the
minimum bandwidth required to transmit the desired information which, for a digital system, is
baseband data. 2) The code signal is independent of data and is of much higher chip rate than the data
signal. 3) Despreading is accomplished by cross correlation of the received spread signal with a
synchronized replica of the same code signal used to spread the data [5].
Fig.4 Block diagram of DSSS technique with convolutional encoding

Here we have firstly encoded the data using convolutional codes and then transmitted the spreaded
signal after BPSK modulation. The signal is jammed by an interferer along its way and also passed
through an AWGN channel. The received signal is despreaded, demodulated and then decoded using
Viterbi hard decoding.
V. Fading Channels used
We have considered two types of fading Rayleigh and Rician. Fading is present when there are several
multipath components and these components arrive at the receiver at slightly different times. If there is
movement in the system then there is also phase difference between the received components, which
leads to shift in the frequency. The Rayleigh fading model works on the assumption that the resultant
fading arises from a large number of uncorrelated waves with identically distributed amplitudes and
uniformly distributed random phases. Here the envelope of received carrier signal is Rayleigh
distributed. When there is non line-of-sight communication between the transmitter and receiver, the
objects in the environment attenuate, reflect, refract, and diffract the signal before it arrives at the
receiver. Rician fading occurs when one of the paths, typically a line of sight signal, is much stronger than
the others. In Rician fading, the amplitude gain is characterized by a Rician distribution [8].
VI. Matlab Simulation Results
www.ijafrse.org
The implementation of DS-CDMA is simulated in MATLAB R2013a, here we have analyzed the
performance of DS-CDMA system by plotting the graph between BER Vs Eb /No. The BER performance of a
coherent BPSK system is
BER = Pe = () erfc (Eb /No)1/2
(4)
where Eb = average energy of a received bit and No = noise density.

A comparison is carried out between the uncoded CDMA signal and coded CDMA signal. Narrowband
jamming is introduced along with the noise in the signal as it passes through the channel. Simulation has
been done over AWGN channel and for BPSK modulation technique. The number of bits taken for
simulation is 64000. The decoding method used is hard decision Viterbi. The following table shows the
values of various parameters used.
Table 1. Values of Various Parameters
S No.
Parameter
Value
1.
No. of bits
64000
2.
Modulation
BPSK
3.
Channel
AWGN
4.
Code rate
5.
Constraint
4
length
Fig.5 BER Vs Eb /No curve for DS-CDMA with convolutional coding

The simulation result shown in Fig.5 indicates that when DS-CDMA signal is first coded and then passed
through AWGN channel, the value of BER is lesser as compared to the uncoded DS-CDMA signal. For
instance, the value of BER is 0.0234 at Eb/No of 3dB for the coded signal, while for an uncoded signal the
BER is 0.0400 at the same value of Eb/No, which is clearly greater than former.
The following graph shows bit error rate of convolutionally encoded data over AWGN, Rayleigh and
Rician channels. We observe that BER of the coded CDMA signal when passed through the AWGN channel
is less than that of Rician channel which in turn is much lesser than the Rayleigh channel. For instance, at
Eb/No value of 4 dB, the BER with AWGN channel is 0.0026, with Rician 0.0042 and with Rayleigh it is
www.ijafrse.org
0.0157.
Fig.6 BER Vs Eb /No curve for DS-CDMA for different channels

VII. Conclusion
Spread spectrum communication when used with channel coding provides greater protection against
interference, provision for privacy as it enables protection of signals from eaves dropping and reduces
the effects of noise and interference. CDMA system without coding achieves zero BER when value of
Eb/No is about 11 dB, while in case of coded signals the zero BER is achieved at about 9dB,clearly
indicating the improvement in performance with the use of convolutional codes. Further we conclude
that the AWGN and Rician channels are better than Rayleigh channel as they give lesser value of BER.
VIII. References
[1]
B.P. Lathi, Zhi Ding, Modern Digital and Analog Communication Systems, Oxford University
Press, 4th edition, 2012.
[2]
M. Katta Swamy, M.Deepthi, V.Mounika, R.N.Saranya, Performance Analysis of DSSS and FHSS
Techniques over AWGN Channel, International Journal of Advancements in Technology, vol. 4,
no.1, pp. 59-65, March 2013.
[3]
Yuan Jiang, A Practical Guide to Error Control Coding using Matlab, Artech House publishers,
Oct. 2010.
[4]
http://www.mathworks.com
[5]
Vijay K. Garg, Wireless Communications and Networking, Morgan Kaufmann publishers, 2007.
[6]
Michael B. Pursley, Thomas C. Royster, High-Rate Direct-Sequence Spread Spectrum with ErrorControl Coding, IEEE Trans. on commun, vol. 54, no. 9, pp. 1693-1702, Sept. 2006.
[7]
Andrew J. Viterbi, Very low rate convolutional codes for maximum theoretical performance of
spread spectrum multiple access channels, IEEE journal on selected areas in communications,
vol. 8, no. 4, pp.641-649, May 1990.
www.ijafrse.org
www.ijafrse.org

Bit Error Rate Analysis of DS-CDMA System With Convolutional Codes

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Bit Error Rate Analysis of DS-CDMA System With Convolutional Codes

Uploaded by

Copyright:

Available Formats

International Journal of Advance Foundation And Research In Science & Engineering (IJAFRSE)

Bit Error Rate Analysis of DS-CDMA System with Convolutional Codes

1 | 2015, IJAFRSE and ICCICT 2015 All Rights Reserved

Fig.1 Block diagram of PN sequence [2].

Fig.2 Structure of binary convolutional encoder [3]

2 | 2015, IJAFRSE and ICCICT 2015 All Rights Reserved

Fig.3 Trellis for the convolutional encoder [4]

then the DS spread spectrum signal is given as:

Fig.4 Block diagram of DSSS technique with convolutional encoding

where Eb = average energy of a received bit and No = noise density.

Fig.5 BER Vs Eb /No curve for DS-CDMA with convolutional coding

Fig.6 BER Vs Eb /No curve for DS-CDMA for different channels

6 | 2015, IJAFRSE and ICCICT 2015 All Rights Reserved

7 | 2015, IJAFRSE and ICCICT 2015 All Rights Reserved

You might also like