Lectures of Spread Spectrum Communications
Lectures of Spread Spectrum Communications
1. Avoiding interception
1
EEM 735 Spread Spectrum communications
The distance (range) between two points can be determined by measuring the time
in seconds, taken by a signal to move from one point to the other and back. This
technique is exploited in the Global Positioning System (GPS). Since the signal
travels at the speed of light (3×108meters/sec),
Range in meters = 3×108 (transit time / 2)
It is clear from the above expression that the accuracy of the transit time
measurement determines the ultimate range accuracy. In practice, the transit time is
determined by monitoring the correlation between transmitted and received code
sequences. The transit time can be computed by multiplying the code duration by
the number of code bits needed to align the two sequences. Clearly, higher resolution
requires code symbols to be narrow which means high code rates. Thus, the
sequences are selected to provide the required resolution so that if the code sequence
has N chips, each with duration Tc seconds, then:
Maximum range = 1.5NTc · 3×108 meters.
The range resolution requires the chip duration Tc to be small so that sequence chip
rate is as high as possible. On the other hand, maximum range requires a long
sequence (i.e. N is large) so that many chips are transmitted in a single sequence
period.
The GPS system consists of twenty-four satellites orbiting the earth along six orbitals
planes, spaced 60 degrees apart with nominally four satellites in each orbit. These
clusters of satellites provide any user with visibility of five to eight satellites from
any point on earth. The position, in 3-D, of a moving receiver and its speed can be
measured using signals received from at least four satellites. GPS provides two
services. The precise positioning service uses very long code sequence at a code rate
of 10.23 MHz. The standard positioning service, on the other hand, uses a shorter
code (1023 bits) at a rate of 1.023 MHz. Each satellite is identified by a different
phase of the short code.
5. Improved multiple access scheme
Multiple access schemes are designed to facilitate the efficient use of a given
network resource by a group of users. Conventionally, there are two schemes in use:
The Frequency Division Multiple Access (FDMA), and the Time Division Multiple
Access (TDMA). In FDMA, the radio spectrum is shared between the users such
that a fraction of the channel is allocated to each user at a time. On the other hand,
in TDMA, each user is able to access the whole of the spectrum at a unique time
slot.
2
EEM 735 Spread Spectrum communications
The spread spectrum offers an access scheme due to the use of unique code
sequences. Users transmit and receive signals with access interference that can be
controlled or even minimized. This technique is called Code Division Multiple
Access (CDMA) and is considered in more detail in later.
Principles of spread-spectrum communications
Digital transmission schemes which provide satisfactory performance and an
adequate bit rate can be arranged into two categories.
• In applications like satellite communications, these schemes provide efficient
usage of the limited power available.
• In applications such as mobile wireless, where the schemes achieve efficient
usage of the limited bandwidth available for the service in demand.
However, both schemes are narrowband and vulnerable to hostile jamming and radio
interference. The novelty of the spread-spectrum concept is that it provides
protection against such attacks. This concept is based upon exchanging bandwidth
expansion for anti-jamming capability.
The bandwidth expansion in spread spectrum is acquired through a coding process
that is independent of the message being sent or the modulation being used. The
spread spectrum, unlike FM, does not combat interference originated from thermal
noise. The trade-off between signal-to-noise ratio (SNR) and data bit rate (or
bandwidth) in the spread-spectrum scheme can be demonstrated by the following.
Consider a digital signal transmission over a Gaussian channel occupying a
bandwidth B with SNR = 10 dB. A channel coding scheme can be used to receive
data with as small an error probability as desired if transmission is carried out at a
data bit rate less or equal to the channel capacity (C) defined by the Shannon
equation:
𝐶 = 𝐵 · 𝑙𝑜𝑔2 (1 + 𝑆𝑁𝑅) (1)
Substituting for the SNR = 10 dB in equation (1) gives the ratio of bit rate to
bandwidth:
𝑐
= 𝑙𝑜𝑔2 (11) = 3.4
𝐵
Now if we reduce the channel SNR to 5 dB (i.e., to 3.16 in ratio), then referring to
the bandwidth-efficiency diagram shown in Figure 1, the reliable transmission is still
possible at the same bit rate but with expanded bandwidth 𝐵′ given by:
3
EEM 735 Spread Spectrum communications
𝑐
= 𝑙𝑜𝑔2 (4.16) = 2.06
𝐵′
𝐶 𝐶
Now consider 𝐵′ = and 𝐵 = so that the expansion in the bandwidth is
2.06 3.46
𝐵′ 3.46
given by = = 1.73 Thus 𝐵′ = 1.73 𝐵
𝐵 2.06
𝐸
Figure 1. Throughput in bits/Hz (log scale) versus 𝑏⁄𝑁 in dB
0
4
EEM 735 Spread Spectrum communications
𝑙𝑜𝑔10 (3.24)
𝐶 = 𝐵 · 𝑙𝑜𝑔2 (1 + 2.24) = 𝐵 ·
𝑙𝑜𝑔2 (2)
𝐶 = 1.7 𝑑𝐵
Note the maximum bit rate for binary transmission that can be achieved with no errors in
an ideal channel (no noise) is 2B. In this example the bit rate is about 1.7B.
1 𝐵 · 𝑙𝑜𝑔2 (3)
=
2.65 1.75 𝐵 · 𝑙𝑜𝑔2 (1 + 𝑆𝑁𝑅)
𝑙𝑜𝑔10 (3)
=
1.75 𝑙𝑜𝑔10 (1 + 𝑆𝑁𝑅)
5
EEM 735 Spread Spectrum communications
ii. If the channel signal-to-noise ratio is kept at 3 dB, the expanded bandwidth B
1 𝐵
is computed from = .
2.65 𝐵′
Thus 𝐵′ = 2.65 𝐵 compared with 1.75𝐵 in the first case.
The spread-spectrum concept has developed from the principle of Shannon theorem.
If data is transmitted at a rate of 𝑅𝑏 over a channel occupying a bandwidth much
greater than 𝑅𝑏 , Shannon theorem indicates that reliable communications can be
achieved at a reduced SNR. However, if the transmitted power is kept fixed, even
though the power density is substantially reduced, a surplus in the SNR is generated
and can be used to combat interference and jamming. This surplus in SNR is called
processing gain.
The spreading of the energy is achieved by phase modulating the input data with the
user code sequence. The modulation reduces the high-power density of the original
data to a low level shown in Figure 2(a).
Figure 2(a) Power spectral density of data signal before and after spreading
Figure 2(b) Power spectral density of spread-spectrum signal using Gold code sequence (7:31) generated by Matlab.
6
EEM 735 Spread Spectrum communications
Figure 2(c) Power spectral density of spread-spectrum signal with narrowband signal.
Figure 2 (d) Power spectral density of signal and interference after the despreading process.
A simple Matlab code is written to compare the power spectral density of 6 data
symbols with power spectral density of the same data symbols spread using Gold
sequence number 7 of length 31 and is shown in Figure 2(b). The spreading process
generates enough processing gain to protect the transmission from hypothetical
jammer employing a narrow band tone as shown in Figure 2(c).
The received signal has to be converted into the original narrowband to limit the
amount of input noise accompanying the wideband reception. The conversion is
performed at the receiver with the aid of a locally generated code sequence causing
the spread spectrum to collapse. Moreover, the de-spreading process is accompanied
with spreading of the jamming power into background noise as shown in Figure 2(d).
Thus, de-spreading the wanted signal is accompanied by reduction of the impact of
jamming attack on the data transmission.
7
EEM 735 Spread Spectrum communications
The carrier modulation commonly used in spread spectrum is phase shift keying.
Considering Figure 3, we get:
𝑆𝑛 (𝑡) = 𝑚(𝑡) · 𝐶(𝑡) (2)
The baseband signal 𝑆𝑛 (𝑡) is convoluted with impulse response of the spectrum-
shaping filter to yield 𝑦(𝑡):
8
EEM 735 Spread Spectrum communications
A binary data stream of 4 digits [1011] is spread using an 8-chip code sequence C(t)
= [01 10 10 01]. The spread data phase modulates a carrier using binary phase shift
keying. The transmitted spread-spectrum signal is exposed to interference from a
tone at the carrier frequency but with 30 degrees phase shift. The receiver generates
an in-phase copy of the code sequence and a coherent carrier from a local oscillator.
i. Determine the baseband transmitted signal.
ii. Express the signal received. Ignore the background noise.
iii. Assuming negligible noise, determine the detected signal at the output of the
receiver
Solution
i. Let the data stream be denoted as 𝑚(𝑡). The baseband spread-spectrum data
𝑚𝑠 (𝑡) can be represented as:
𝑚𝑠 (𝑡) = 𝑚(𝑡) · 𝐶(𝑡)[01 10 10 01, 10 01 01 10, 01 10 10 01, 01 10 10 01]
9
EEM 735 Spread Spectrum communications
iii. The front-end stage of the receiver mixes the received signal 𝑚𝑟 (𝑡) + with
the local oscillator by multiplying 𝑚𝑟 (𝑡) + by the reference carrier,
cos (𝜔𝑐 𝑡) to compose the baseband signal, 𝑚𝑟 (𝑡). Therefore:
𝑚𝑏 (𝑡) = 𝑚𝑡 (𝑡) ∙ 𝑐𝑜𝑠𝜔𝑐 𝑡 + cos(𝜔𝑐 𝑡 + 30) ∙ 𝑐𝑜𝑠𝜔𝑐 𝑡
= 0.5 𝑚𝑠 (𝑡)[1 + 𝑐𝑜𝑠2𝜔𝑐 𝑡] + 0.5[𝑐𝑜𝑠30 + cos(2𝜔𝑐 𝑡 + 30)]
Assume that 2𝜔𝑐 is removed by filtering and the signal level adjusted to unit
by amplification then:
𝑚𝑏 (𝑡) = 𝑚𝑠 (𝑡) + cos 30
The next stage in the detection provokes the collapse of the spread spectrum
into its original narrowband data. The de-spread signal 𝑚𝑑 (𝑡) is given by
multiplying 𝑚𝑏 (𝑡) by the locally generated code sequence, that is:
𝑚𝑑 (𝑡) = 𝑚𝑏 (𝑡) ∙ 𝐶(𝑡) = [𝑚𝑠 (𝑡) + 𝑐𝑜𝑠30] ∙ 𝐶(𝑡)
= 𝑚(𝑡) ∙ 𝐶(𝑡) ∙ 𝐶(𝑡) + 0.866𝐶(𝑡)
Now C(t) · C(t) is a constant which can be normalized to one. The detector
samples the de-spread signal at the code sequence rate and adds the samples
to be compared with a threshold level. The summation of the sample of C(t)
when sampled at the code rate is
7
∑ 𝐶(𝑘𝑇𝑐 ) = −1 + 1 + 1 − 1 + 1 − 1 − 1 + 1 = 0
𝑘=0
demultiplexed into two parallel streams. Data transported on the in-phase channel is
spread by the code sequence 𝐶𝑖 (𝑡) and data on the quadrature channel is spread by
the code sequence 𝐶𝑞 (𝑡). The two parallel channels are combined to modulate a main
RF carrier.
The quadrature spread-spectrum receiver consists of two binary matched filter
receivers as shown in Figure 5(b). The detection of the data is carried out by each
channel separately in a method identical to the one described for the binary channel.
11