ANALYSIS OF DSSS PERFORMANCE

UNDER COMMUNICATION-JAMMING
ENVIRONMENT
M.L.S.N.S.LAKSHMI K.ANUDEEPSAGAR NIRANJANPRASAD
Asst Professor. Department of M Tech student, Department of Scientist-F, DLRL,
ECE. ECE, Hyderabad, India.
Vignan's Institute of Vasireddy Venkatadri Institute
Engineering for Women, of Technology, Guntur-522509,
Visakhapatnam-560046, India India
Email: Email:
lalithamunjuluri07@gmail anudeepsagar89@gmail .
. com com

Abstract---To achieve Anti-Jamming protection, the signal energy is spread over much wider
DSSS Systems spread the baseband data signal bandwidth. This in turn, reduces the signal strength
over a broad bandwidth from the received signals
versus frequency. As shown in this figure, the lower
(spread) signal has only five times the bit rate of the
with power below the noise floor. However, the
normal digital signal (called chip rate). DSSS signal
existence of the near-far problem in multiple
usually have much higher bit rate ratio, typicallylOO
access DSSS Systems supports the notion that to more than 1000, such that the spreading and
these signals can also be jammed though in resulting reduction of signal density (versus
normal case the detection of the DSSS Signals is frequency) would be much greater. Like the other
difficult. The near-far problem is created by one spread spectrum signals, the DSSS signal carries its
signal (DSSS or otherwise) being significantly
information in digital modulation format and it can
be jammed easily for mealy Jammer to Signal (J/S)
stronger than a DSSS signal within the same
ratio of OdB even after signal de-spreading. However,
bandwidth so that the receiver is swamped by the
the DSSS receiver provides a significant processing
first signal itself, which is similar to gain by removing the pseudo-random spreading code.
communication jamming phenomenon. In this If the spreading factor is 1000, the de-spreading
paper performance of DSSS System are analyzed circuitry reduces the signal level which does not have
and the results are presented under different the correct pseudo-random code (at exactly the
correct phase) by 30 dB.
jamming conditions.

Keywords: DSSS, Jamming, Jammer to signal 2 X chip rate

ratio, BER.

Regular digital signal

I. INTRODUCTION
For an Electronic Attack (EA) System, the presence
of communication signals must be established before
jamming is initiated. Determining presence of
jammer signal by the receiver is called signal
detection. The Direct Sequence Spread Spectrum
(DSSS) signal continuously occupies a spread Frequency
frequency spectrum as shown in Figure 1. DSSS
signal can be generated by applying a secondary
digital modulation with a very high bit rate. Since the
bandwidth of the signal is proportional to the bit rate,
 2 x chip rate
;;:;;Jct:Jc=� . Frequency
Figure. I : Frequency Spreading Yersus Data Bit Rate.
II. DSSS COMMUNICATION SYSTEMS
A. Transmitter
In the DSSS transmitter, the data signal modulates a
carrier, and then the data modulated signal modulates
a wideband spreading code onto a wideband carrier.
In the cases we consider, the phase of the carrier is
the manifestation of the modulation by the spreading
code. Furthermore, we only consider binary and
quadri phase modulations. At a synchronized
receiver, the received signal is despread by a de­
spreading code and demodulated by a carrier. The
modulation in all the cases we are concerned with is
digital phase modulation. Note that different
modulation may be used for the carrier and the
spreading signal (1). To measure Bit Error Rate
(BER) of a communication signal at the receiver, it is
necessary to know the test statistics of the data,
jammer, and noise signals at the output of the
correlator in the receiver. It is assumed that the noise
has Gaussian distribution function with variance of
NoW. Figure 2 shows a mathematical model for a
Binary Phase Shift Keying (BPSK)lQuadrature Phase
Shift Keying (QPSK) DSSS transmitter.
ForBPSKT�O
Channel
ForOO'SKTo=T/2 Jammer
To
Receiver
Figure.2: Mathematical model for a BPSKlQPSK DSSS
transmitter
The In-phase signal SI (t) is represented as
SI W = {Sd (t -'1:Il)w1 WeI (t -'1:0) <OO cS (�1l t + 0,g)
(1)
The Quadrature-phase signal s Q(t) is represented as
sQ(t) = {S.dWwQ(t) c Q(t) si n(�11 t + 0,g)
Where
S is the average power of the data signal and d(t) is
the normalized data with values ±1 with equal
probability.
,e 1 (t), cQ(t) are spreading waveforms of In-phase
and Quadrature-phase signal components
respectively with their values lying between -1 to +1.
The jammer frequency ,Wj may or may not be equal
to the signal frequencywo . WI
(t) , w ,Q (t) are
weighting functions of In-phase and Quadrature­
phase paths respectively used in the model to control
whether the modulation is BPSK or QPSK. To
represents the time offset of I component relative to
that for the quadrature component Q.
For BPSK/BFSK, To = 0, WI (t) = 2, and w Q (t) = O.
,
For QPSKlBPSK, To = Tc I 2,
Here, Tc is the chip duration, WI W= l1i Q(t) = 1.
The combined signal due to the data components,
denoted by SsW, is obtained at the output by adding
the two quadrature components together.
(3)
B. Receiver
Mathematical representation of a BPSK/QPSK DSSS
receiver using model block diagram is shown in
Figure 2. The received signal is split into I and Q
paths and weighting is applied to determine the
modulation type. The first mixer stage converts I & Q
path signals to an IF frequency(1). The signals are
then multiplied by asynchronized replica of the code
sequence, band-pass fIltered and mixed at the second
mixing stage, the result of which is fed to an
integrator (the combination of band pass fIlter and
integrator is a correlator). Decision logic is at the
output of integrators decides the symbol sent.
DElign M1J
Logic
Figure .3: Mathematical model for a BPSK/QPSK DSSS Receiver
III. BBN JAMMING OF DSSS SYSTEMS
Broad Band Noise (BBN) jammer which is also
known as Barrage Jammer spreads the broad band
(2) noise over the total frequency spread band W(ss)with
constant power J. The one sided noise spectral
density in the instantaneous BW of the Transmitter
signal is
Nj = J/Wss (4)
BBN jamming of DSSS signals is when the jammer
signal is noise with a bandwidth approximately the
same as the DSSS signal. BBN jamming is illustrated
in Figure.4. It is tacitly assumed that the center
frequency of the jamming signal is the same as that
of the DSSS target. Only hard decision decoding with
no JSI is considered. With multiple users of a DSSS
system within range of a single receiver, the effects
of interference are very similar to AWGN.
Techniques have been investigated to mitigate this
interference and therefore mitigate the effects of
BBN jamming from an intuitive point of view, at the
target DSSS receiver as the detector output SNR, (i.e.
SNR,) is increased by Gp• The output signal level is
increased by Gp while the output noise is not. The
decorrelation process does not affect the noise, and
whatever noise exists at the input will exist at the
output of the detector.
(9)
(10)
The received SNR is effectively increased by the
processing gain of the DSSS System. In order to
disrupt the signal at the receiver, the jamming signal
must somehow overcome this processing gain. In
addition to this, the effectiveness of a jammer against
DSSS depends on whether the DSSS signal is error
protection coded or not. The performance of DSSS
Systems which are phase modulated with BBN
jamming is the same as the performance with
Additive White Gaussian Noise (AWGN) only.
� =Q ( :: (11)

NT = N o KJ ", (12)
Where
No is the one-sided thermal noise spectral density
and Jo is the jammer noise spectral density given by
t, f
�------wJ--------�
10 = J/W.!\:l and a constant K are determined by the
1+------ w« --------+1
method of imposing the PSK modulation onto the
carrier K whose values are as under
{0.903 BPSK DSSS
Figure.4: BBN jamming of DSSS
K = 0.995 M FSK DSSS (13)
Therefore to use BBN as the jamming technique, the For most cases K 1 is assumed, while the symbol
=

processing gain must be over come in order to put duration is twice as long, which ensures that the
enough noise at the detector output to affect the energy per bit for both approaches is the same. For
detection process(2). The signal-to-noise plus rectangular pulse shapes and BBN jamming, the bit
jamming ratio after the despreading and error performance for BPSK signals is given by
demodulation processes for DSSS receivers, denoted
by vo, when the jamming waveform is BBN is given
p
e BP5K -
_ (l
"
( U1S
Nr
(14)
by
Where
1VT = No 1, 0 (15)
(5)
Thus Pe becomes
,--,--
Where P, UlT"Ws"
R is the signal power received, e =Q 1tS" iVo +J
(16)
No is the one-sided noise spectral density,
W.!\:l
is the bandwidth of the signal,
J is the jamming power at the receiver, and 1
(l
2AT -
Gp is the number of chips per data bit.
e - " �
-
P'ro,r +j
(17)
p'
In this expression it is assumed that the receiver noise The processing gain Gp = 1's/Tc , so Pe becomes
bandwidth is matched to that of the signal. If Tb
denotes the Base band data bit duration(2) and Tc
�=Q � (18)
denotes the spreading waveform chip duration, then, .,J i + i;
the processing gain, Gp' is given by Where s,: denotes the JSR. For Gp lOO (GPdB 20dB),= =
T
Gpo "- (6) a plot for Probability of Bit-Error for BPSK DSSS
T<
2:.. signal is obtained using Eq. 18. The result is shown
1.=
8 11 "
(7) in Figure 5. Here, the SNR includes the noise spread
over despread bandwidth Wss. The equivalent
R
C
= T2:. (8)
narrowband SNR can be determined if the despread
<
bandwidth of the data symbol is known. For WF = 25 This jamming waveform is more effective than broad
kHz and Wss = 50MHz, if the spread signal SNR is - band noise jammer as it enhances the occurrence of

( :>0 1«) &),

20dB, then the despread SNR will be errors by corrupting a portion of spectrum more
-20 + 10 1 og 1 1l --
0

' � BdS (19) intensely.

25 - 1'0 '
Broad Band jamming Ilerformance of uncoded BPSK DSSS In PBN jamming, the RF power from the jammer is
'
10 r--�--�-�---'
spread over a bandwidth WJ which is narrower than
IO·' F----------------:::. the whole spread bandwidth Wss. The fraction of Wss
s .--� covered by the jammer is given by
.2
� 10 -
----------- ----------- ------­

,
-
o WJ
;.. .
� y= (20)
= 10 lit••
�
E The spectral density of the jammer is given by
"
� 10

lO� ___--
.L (21)
......---- WJ
· = L litss
10 '--_�__'___�__'___�____'
·10 -5 0 10 15 20
(22)
lit•• W'J
Jsr(db)
Figure 5: BBN Jamming Performance for uncoded BPSK DSSS & (23)
y
As shown in Figure 5, the BBN jammer remains Where, Jo is the jammer energy density as if the
relatively ineffective until the processing gain of N= jammer power were spread over the whole spreading
100 (i.e. 20dB) is overcome. At that point, however, bandwidth Wss. Both the jammer energy as well as
Probability of Bit-error will be Fe � 10- 1 or higher the thermal noise affects the system perfonnance,
irrespective of spread SNR of those considered here. although frequently it is assumed that the jammer
The jamming performance of BBN as the Gp is
energy is larger than the thermal noise so that the
varied from Gp = 10 to Gp = 1000 is shown in the
Figure.5 for iI = 20dB (2). Note that Gp = 100 is latter can be ignored. That is normally the case in the
approximately that for some forums of 3G+ personal portion of the spectrum covered by WJ but not outside
communication system (PCS). Increasing the JSR by this region. It typically takes v> I OdB for effective
10dB improves the jamming perfonnance, a communication performance and S = OdB implies
measured by the processing gain overcome, by about that the jamming signal is 10dB higher than the noise
3dB at Fe = 10- 1 . It's worth nothing again that 3G+
level. Therefore, ignoring the noise in the region of
PCS systems were not designed for anti-jam
the spectrum covered by the jammer is justified.
performance.
Jarruner

BBN jamming performance against DSSS QPSK DSSS Signal

/'
1 oOr--.----,.----r----.--.-
---.--��::::
-;: :;:;:__,
:;

10·' f
....
2
....
a .2
';10
(aj
£ Jarruner
� .

Ai
B 10
o
�
-4
10

fo
I0 '�O --:-'::-=- ( b)
Io o�
"""""
2 0:-:' 3 = 00�4:':'
0--::- 00:-·:':
-) -=-
O O�6 0:-:'0---='
0 0--=8= 00:-9:':'
7 :-:' -: 00=-1 000
Processing gain Figure 7: PBN jamming of DSSS signals shown in (a) is when the
Figure 6: Broadband jamming performance: uncoded QPSK DSSS jammer is centered on the center frequency of the signal while (b)
shows the jammer offset.
IV.PARTIAL BAND NOISE (PBN) JAMMING The BER for uncoded BPSK and QPSK DSSS in
OF DSSS PBN jamming is the same and is given by
PBN jammer consists of noise whose total power is
evenly spread over a subset of the total spread BW.
 � =Q bandwidth of the pulse jammer when it is on is
(24)
assumed to be Wss' As with noise jamming,
techniques have been examined to mitigate the
effects of pulse jamming on DSSS systems(4). As
with any pulsed signaling, including jamming, the
receiver characteristics are important to evaluate the
Where effectiveness of the jamming waveform. The signal
SJ (hp) is the spectral density of the jammer at the IF must be present long enough for the receiver filters to
settle in order for the analysis that follows to apply.
frequency of the receiver with in the receiver band
width.
The average bit error probability due to noise and the
S/hp) = J' D sinc2 [CtD - Ij) w:J (25) jamming is given by

Where
(26)
Ij is jammer center frequency.
This function is plotted in Figure 8,PE versus the
processing gain Gpo Where
1:"1 is Pe when the jammer is off, Pe2is Pe when the
Partial band performance against BPSK DSSS
10° t------�---r=====;] jammer is ON. If NO,I represents the noise density
when the jammer is OFF, and NO,2 denotes the noise
density when the jammer is ON, then NI = NO,I and
NO,2 = No+Jo. P" 1 is therefore due to the thermal noise,
and P"2is due to the jammer and thermal noise. When
it is assumed that when the jammer is ON, it is
sufficiently more powerful than the noise so that the

(J,;;,+'t)
latter can be ignored, then the average Pe is given by

P, = 0- ylQ (J2N�) + YQ (27)

\
\
10-4,-:-_������-=--_--"-�����
10 1 10 2 103 It is assumed that the jammer is ON for at least for
processing gain(N) the bit interval Tb• This expression is valid for
coherent BPSK, QPSK, OQPSK and MSK signals.
Figure 8: Partial Band Jamming Performance for uncoded BPSK
(y=O.1 v=-lOdB)
The pulsed jammer performance is shown in Figure 9
As shown in Figure 8, if the jammer can overcome for v = -dB and N = 100. For these representative
the processing gain of the DSSS system, significant values, y must exceed about 25% to be effective.
degradation can be witnessed at the BPSK receiver. Performance does not change significantly for higher
For v= -10 dB, the coding gain less than 13 dB can values of SNR.
be tolerated while if �= 20 dB, coding gains of over
20 dB are still effective. These results are not very
sensitive to the SNR at these JSR levels. The DSSS
processing gain when using BBN jamming BPSK or
QPSK signals is 3dB less than for PBN jamming.
Thus, PBN jamming is preferred choice against these
communication signal types(3).

V. PULSE JAMMING OF DSSS SYSTEMS

A pulsed jammer transmits BBN power for a fraction
of the time specified by y and is off for the rest of the
time, the fraction of which is 1 -yo If a pulsed jammer
and nonplused BBN jammer have the same average
power, then the pulsed jammer will have a larger
peak power since it is not always emitting. The
 --
such as estimates of the thermal noise level and the
channel fading characteristics are also used (4).
Pulsed jamming with BPSK DSSS (soft decoding)
10 '
·
I-�r===='-�--�-�
Withoutjsi
Wilhouljsi
With jsi
Wilhouljsi
10'
With jsi

· '-c,_L-L--'-LLC
- �C---'---"----L-"--LLLllC----'-----'--'-'-
-'-LU-'
10
°
10 10 10 10
fraction of time when pulse jammer on
1O· -- . - -- - -- -
� IL O �5- � � �IO -�' 5 �20
Figure 9: Perfonnance of pulse jamming against BPSK DSSS
Jsr (dB)

y that maximizes Pe, denoted by

! erJN-r'
There is a value of Figure 10: Pulsed jamming perfonnance against repeat coded
Y ·and is given by BPSKDSSS with soft decoding
'II. ,1)9

{ �� �
When the jammer state is known with soft decision
y.
ErJN, > 0. 709'
= (28) decoding
1 ErJN, ::; 0 . 7 0,9
� =
ymQ (J�f>y) (32)
With co� ;� nding bit er r b b �: �: : ����
/ 9
e", N-r � . This result to
�. =
Q � (. EIJ/NT::; 0.709'
(29)
(33)
' .I N-r J '
Pulsed Jamming of Repeat Coded BPSK DSSS
When the receiver knows the JSI, the pulse jamming
Systems Interleaving the data bits before being
performance significantly degrades as illustrated in
mUltiplied by the spreading sequence spreads the data
bits out over time, usually separated by enough time Figure 10. For given parameters � = 10- , without
so that the resulting spread data bit chips are JSI and m=3, repeat coding degrades JSR
independent(5). With no interleaving and associated performance by about 7 dB and 10 dB for � = 101- ,
deinterleaving then the BER performance of repeat m = 5. The repeat coding effectively defeats the pulse
coded BPSK DSSS is the same as uncoded, and there jamming attempts. With the presence of JSI the JSR
is no advantage to coding. With soft decision
decoding and unknown channel state
degradation is even more(5).
For a given y,
the pulsed jamming performance

L;= l m:11( � )yk (1 - y)m -kQ ( JZ;;f>y)

-- � � -
against repeat hard coded BPSK DSSS is shown in
�= (30)
Figure 11.
Where m is the diversity of the code; that is, the Pulse jamming performance of hard decision uncoded BPSK
10-1 -----,.====� --

( 2Imf )
number of repeated bits. This function can be -� -j
I Unknown jsi
manipulated ton yield. Unknown jsi

...
Known jsi
Unknown jsi

.
P =
·L.", m=1"":1 1(m)yk (l - y)m -kQ ....!... /' rIS .
...
o
]0.2
Known jsi
,g k k J\r ..:!.. Af
...
...

J" t
¢ 10.3
(31) ...
�

y
For = 0.3, Pulsed jamming performance against ..Q
"
repeat coded BPSK DSSS with soft decoding is ..Q 10-4
o
...
plotted as shown in Figure10. It is evident from the Q.,
figure that the jamming effects on repeat coded signal
at low JSR is not disastrous. IO� L --� 5
5. --�--�5--�--� ::- --�2
IO 1O 1 0
Without Jammer Signal Interference (JSI), the soft Jsr (dB)
decision decoder biases its decisions on the estimated Figure I I : Pulsed Jamming Performance against Repeat hard
bit reliability without the knowledge of the presence coded BPSK DSSS (solid lines without JSI; dotted lines with JST)
or absence of a jamming signal. Other information
The JSI in this case significantly degrades the
jamming performance, even for relatively small VII.CONCLUSION
amounts of coding. For repeat codes with m symbols
The DSSS Communication System performances
per data bit, hard decision decoding, and unknown
against various types of jamming conditions are
jammer state, the BER is given by
discussed and the results are presented. The BBN
jamming effect on the BPSK DSSS signals will be
�= I;=lm;1 I C;)y i« 1 t9)m-k - (34) effective only when Processing Gain is more than
20dB. The DSSS processing gain when using BBN
Where
19
= yQ
.(J e�
y
) (35)
jamming for BPSK or QPSK DSSS signals is 3dB
lesser than for PBN jamming, which indicates the
ml\T suitability of PBN jamming over BBN jamming.

( I)
The same can also be written as The performance of pulsed jammer on BPSK DSSS
signals indicate that y must exceed about 25% to be
19
= yQ m .P (36) effective and also the system performance does not
J\r�+mJ\rs . change significantly for large SNR. When the BPSK
Pt
receiver detects the JSI, the pulse jamming
performance significantly degrades. Repeat coding
Pe is plotted in figures for y= 0.3, N=IOO, and v=­ effectively defeats the pulse jamming attempts as
IOdB, although the results are essentially independent without JSI for BER probability of Pe=1O-2 , and for
of the SNR at these levels of JSR. Comparing the m=3 (m=5), the JSR performance degradation will be
curves Here with those in Figure 11, as expected, about 7 dB (10 dB). With JSI the degradation is
jamming performance is better against hard decision found to be even more.
decoding when JSI is not available(6). It is observed from the figure that in absence of
With JSI and hard decision decoding the BER is coding (m=I), the Pulsed jammer performance is
given by found better against hard decision decoding by about
� = ym I ;=lm 1 I C;) t9 k (1 t9) m -
;
k -
(37) lOdB. For minimal coding (m = 3), the Pe never
19
reaches acceptable jamming performance limit for
Where is given by the above equations without the decoding methods and when there is no coding, the
leading y multiplier. In this case the jamming jamming performance reaches to acceptable limit at
performance decreases somewhat (see Figure 11, for JSR levels.
y= 0.3)(5). Without JSI, there is an optimum y that The above analysis on communication System
maximizes Pe, however repeat coding also decreases performance against various types of
jammer performance for hard decision coding. jamming/interference conditions will help in
A comparison of soft and hard decision decoding in designing the ruggedized digital communication
absence of JSI is shown in Figure 12. receiver which could withstand under the multiple
jamming scenario for Communication EW
applications.
,pulsed jamming performance comparision for soft and hard decoding
10 'c-�����--�--��--�---,
REFERENCES:
- soft decoding
- soft decoding [1] Simon, M. K., 1. K. Omura, R. A. Scholtz,
hard decoding
soft decoding and B. K. Levitt, Spread Spectrum
hard decoding Handbook,New York: McGraw-Hili, 2003,
p.l49
[2] Sharnain, P., and L. B. Milstein,
-Minimum Mean Square (MMSE)
Receiver EmployingI6-QAM in CDMA

--
Channel with Narrowband Gaussian
Interference,Proceedings JEEEMILCOM,
2001.(2)
10' 0' � [3] Gui, X. and T. S. Ng, -Performance of DS
1:------
:---�
s -- ---:--
s----"c-10 ----"c-
1S -- 20
jsr(dB») SS System under On-Off Wideband
Jamming, Electronic Letters, January 2000
[4] Lau, F. C. M., M. Ye, C. K. Tse, and S. F.
Figure 12: Comparison of soft and hard decoding for pulse Hau, -Anti-Jam Performance of Chaotic
jamming against repeated BPSK DSSS. Digital Communication Systems, IEEE
 Transactions on Circuits and Systems-I:
Fundamental Theory and Applications, Vol.
49, No. 10, October 2002, pp. 1486-1494.
[5] Modem communications jamming
principles and techniques by
Richard.A.poisel .
[6] Spread spectrum by R.Michael Buehrer
summer 2007.