EEE 6207

Broadband Wireless Communications

Course Instructor: Dr. Md. Forkan Uddin

1
 Spread Spectrum Communications
 Spreads a narrowband communication signal over a wide range
of frequencies
 De-spreads it into the original data bandwidth at the receive
 Signal spreading is done before transmission by using a
spreading sequence
 Same sequence is used at the receiver to retrieve the signal

2
General Model

3
Narrowband vs Spread Spectrum
Narrowband
(High Peak Power)

Power

Spread Spectrum
(Low Peak Power)

Frequency

4
 Narrow Band vs Spread Spectrum
Narrow Band
 Uses only enough frequency spectrum to carry the signal
 High peak power
 Easily jammed
Spread Spectrum
 The bandwidth is much wider than required to send to the signal
 Low peak power
 Hard to detect
 Hard to intercept
 Difficult to jam
5
 Applications
In the 1980s FCC implemented a set of rules making Spread
Spectrum available to the public
 Cordless Telephones
 Global Positioning Systems (GPS)
 Cell Phones
 Personal Communication Systems
 Wireless video cameras
Networks
 Wireless Local Area Networks (WLAN)
 Wireless Personal Area Network (WPAN)
 Wireless Metropolitan Area Network (WMAN)
6

 Wireless Wide Area Network (WWAN)

 Applications
 Unlicensed bands

 Industrial, Scientific, Medical (ISM) band at 2.4 GHz

 Unlicensed National Information Infrastructure (UNII) at 5 GHz

 The Code of Federal Regulations (CFR) Part 15 originally only

described two spread spectrum techniques to be used in ISM band
(IEEE 802.11 and 802.11b)

 Frequency Hopping Spread Spectrum (FHSS)

 Direct Sequence Spread Spectrum (DSSS)

 Orthogonal Frequency Division Multiplexing (OFDM) was not covered

by the CFR and would have required licensing 7
 Applications
 IEEE 802.11a, employing OFDM, was created to work in the
5GHz UNIII band

 In May, 2001 CFR, Part 15 was modified to allow alternative

"digital modulation techniques".

This resulted in IEEE 802.11g which employs OFDM in the

2.4 GHz range

8
DSSS Block Diagram

9
DSSS using BPSK

10
Approximate Spectrum

11
DSSS with BPSK when Jammer exists

12
Frequency response

13
After Filtering

14
 Signals
 Data Signal after modulation with signal power Ps
2E b
s t   d (t ) cos  2 f ct  = 2 Ps d (t ) cos  2 f ct 
Tb
 t  iTb   t  1 0  t  Tb
d(t)=  si   , si {1, 1},     
i  Tb   Tb  0 else
 Data signal after coding:
x t   c t  s t   2 Ps d (t )c  t  cos  2 f ct 
 t  lTc 
c(t )   ci   , ci  {1, 1}
l  Tc 
 Jamming Signal with power Pj

j  t   2Pj cos  2 fct 

15
Received Signal (loss less)
y t   2 Ps d (t ) cos  2 f ct  + 2 Pj cos  2 f ct 

u t   2Ps d (t )c(t )c(t ) cos  2 f ct  + 2Pj c(t ) cos  2 f ct 

16
 Output Signal for a bit s1
u t   2Ps d (t )c(t )c(t ) cos  2 f ct  + 2Pj c(t ) cos  2 f ct 

T
1 b
v   u (t ) cos  2 f c t dt
Tb o
Tb Tb
1 1
  2 Ps s1c (t ) cos  2 f ct  +
2 2
 2 Pj c(t ) cos 2  2 f ct dt
Tb o
Tb 0
Tb
1 2 Pj

2
2 Ps s1 
2Tb  c(t )dt
0

Ps 2 Pj Tc Lc

2
s1 
2Tb
c
l 1
l

Ps 2 Pj Lc

2
s1 
2 Lc
c
l 1
l

17
 Power and SIR
Signal Power Ps For stochastic signal,
2 Rs(τ)≡E[s(t)s(t+τ)];
Ps=Rs(0)
 Interference Power
 2P 
2
   Pj Lc
2

Lc
 2 P   Lc
 Pj
E   cl    2 E   cl    2 
j j

  2 Lc l 1   4 Lc   l 1   2 Lc 2 Lc
 
 

 Signal to (jamming) interference ratio

Ps
2 Ps
SIR   Lc
Pj Pj
2 Lc
18
 SINR
y t   2 Ps d (t ) cos  2 f ct  + 2 Pj cos  2 f ct   w(t )

u t   2Ps d (t )c(t )c(t ) cos  2 f ct  + 2Pj c(t ) cos  2 f ct   w(t )c(t )

Where , w(t) additive white Gaussian noise with zero mean

and two sided PSD N0/2, i.e., E[w(t )w(s)]  N0 / 2 (t  s)
Tb
1
v  u (t ) cos  2 f c t dt
Tb o
Tb Tb
1 1
  2 Ps s1c (t ) cos  2 f ct  +
2 2
 2 Pj c(t ) cos 2  2 f ct dt
Tb o
Tb 0
Tb
1

Tb  w(t )c(t ) cos  2 f t  dt
0
c

19
 SINR
 The variance of the noise component:
T
1 Tb b
Noise Power  E[ 2   w(t )c(t ) cos  2 f ct  w( s)c( s) cos  2 f c s  dtds
Tb 0 0
T
1 Tb b
 2   E[ w(t ) w( s)]E[c(t )c( s)]cos  2 f ct  cos  2 f c s  dtds
Tb 0 0
T
1 Tb b
 2   N 0 / 2 (t  s) E[c(t )c( s)]cos  2 f ct  cos  2 f c s  dtds
Tb 0 0
1 Tb N
 2  N 0 / 2 E[c 2 (t )]cos 2  2 f ct  dt  0
Tb 0 4Tb

Ps
2 Ps
SINR  
Pj N Pj N0
 0 
2 Lc 4Tb Lc 2Tb 20
 Probability of Error
 When jamming exist the probability of error is

 P   P 
 s
  2 Eb   s   
pe  Q  2   Q   Q 
2   Q  Eb 
 N0   N  Pj   Tc Pj 
 0   
 4T   2 L 
 b   c 

1
Q(k ) 
2 kexp( 2 / 2)d 

For BPSK without DSSS

pe  Q( 2 Eb / N 0 )
21
 Probability of Error
When noise and jamming exist the probability of error is

   
 P 
s  
pe  Q  2  Q  2 Eb 
 N0 Pj   2 Pj 
   
 N0  
 4Tb 2 L j   Tc 

22
 Jamming Margin
 Magnitude of additional interference and noise that can be
injected to the channel without hazarding system operation
 Processing Gain,
Lc  W / R  Tb / Tc
W= Bandwidth of transmitted signal
R= bandwidth of the original signal
 Jamming Margin,
Ls= System loss
SNRt= Required signal to noise ratio

M J  Lc  [ Ls  SNRt ]

23
 Example

Lc  30dB,available processing gain

Lsys  2dB,margin for system losses
SNRdesp  10dB,required SNR after despreading (at the RX)
 M j  18dB,additional interference and noise can deteriorate
received SNR by this amount

24
Generating the Spreading (Pseudo-
Noise) Sequence
 The pseudo-noise (PN) sequence is a periodic binary sequence
with a noise like waveform that is generated by means of a
feedback shift register.
 The feedback shift register consists of m-stage shift registers and a
logic circuit that perform modulo-2 (X-OR) arithmetic.
 A sequence with period 2m-1 is called Maximal-Length sequence

25
 PN Sequence: Example

s1 s2 s3
1 0 0
1 1 0
1 1 1
0 1 1
1 0 1
0 1 0
0 0 1
1 0 0

Spreading code  0 0 1 1 1 0 1 0 . . .

26
 Properties of Maximal-Length
Sequences
 In each period of a maximal-length sequence, the number of 1’s
and the number of 0’s in the sequence always differ by 1
 The autocorrelation function of a maximal-length sequence is
periodic and binary valued
Tb
1
Rc    2
T c t  c t   dt
T  b
b 2

 N 1
1  NT    Tc
Rc     c

  1 other time
 N 27
28
 Other Spreading Codes
Walsh codes Orthogonal, used in synchronous systems
H Hn 1 
 Generation recursively: H0  [0] Hn   n 1
 Hn 1 H n 1 
0 0 0 0
0 1 0 1
 All rows and columns of the matrix are orthogonal: H2   
0 0 1 1
 (1)(1)  (1)1  1(1)  1 1  0  
0 1 1 0

Gold codes
 Generated by summing preferred pairs of maximal length codes.
 For N-length code there exists N + 2 codes in a code family
 Walsh and Gold codes are used especially in multiple access
(n: number of stages in the shift register)
systems
 Gold codes are used in asynchronous communications because
their cross-correlation is quite good
29
 Frequency-Hopped (FH) Spread
Spectrum
Information
Sequence
FSK FSK
Encoder Mixer Channel Mixer Decoder
Modulator Modulator

Frequency Time
PN Synthesizer
Sequence Frequency Sync
Generator Synthesizer
PN
Sequence
Generator

 FH/SS is usually used with Binary FSK

 The carrier frequency is determined by the output
sequence from a PN generator

30
 Types of FHSS
 Slow hopping system has a hopping rate that is lower than the
information rate (symbol rate)
 Several information symbols are transmitted by the same
carrier frequency
 Fast hopping system has a hopping rate that is higher than the
information rate
 One information symbol is transmitted by different carrier
frequencies.

31
Slow Frequency Hopping Example

32
Fast Frequency Hopping Example

Generally fast FHSS gives improved performance in

noise (or jamming) 33
 DS and FH comparison
 FH is applicable in environments where there exist
tone jammers that can be overcame by avoiding
hopping on those frequencies
 DS is applicable for multiple access because it allows
statistical multiplexing (resource reallocation) to
other users (power control)
 FH applies usually non-coherent modulation due to
carrier synchronization difficulties -> modulation
method degrades performance
 FH is an avoidance system: does not suffer near-far
effect!
 DSSS has lower cost
 By using hybrid systems some benefits can be
combined: The system can have a low probability of
interception and negligible near-far effect at the same. 34
 Code Division Multiple Access
(CDMA)
• Multiple users can use the same channel as long as
different users are assigned different PN sequence
(code)
– Several users can transmit simultaneously on the
same channel
• The transmissions from other users will look like
interference.
• CDMA main application is wireless communication

35
Code Division Multiple Access (CDMA)

36
Seven Channel CDMA Encoding
and Decoding

37
 MAI in CDMA
 K

u  t  *cos  2 f ct   2Ps d1 (t )c1 (t ) cos  2 f ct    d k (t )ck (t )c1 (t ) cos 2  2 f ct  + w(t)c1 (t ) cos  2 f ct 
2 2

 k 2 
Ps
Signal Power: 2
Noise signal: Gaussian random variable with zero mean
Tb
1
Tb  w(t )c (t ) cos  2 f t dt
o
1 c

38
 Noise Power

 1 Tb Tb 
E  2   w(t )c1 (t ) cos  2 f ct w( s )c1 ( s ) cos  2 f c s dtds 
 Tb o 0 
Tb
1
E  w(t ) w( s )  E  c1 (t )c1 ( s )  cos  2 f ct  cos  2 f c s dtds
Tb
 2
Tb 
o
0

Tb
1 N0
 (t  s ) E  c1 (t )c1 ( s )  cos  2 f ct  cos  2 f c s dtds
Tb
 2
Tb 
o
0 2
Tb
1 N0
 2  E  c1 (t )c1 (t )  cos 2  2 f ct dt
Tb o
2
N0

4Tb

39
 Interference Power
 K

u  t  *cos  2 f ct   2Ps d1 (t )c1 (t ) cos  2 f ct    d k (t )ck (t )c1 (t ) cos 2  2 f ct  + w(t)c1 (t ) cos  2 f ct 
2 2

 k 2 

K Lc
Ps Tc
signal 
2 Tb
 s c
k 2
k ,1
l 1
c
1,l k ,l

Mean zero and variance:

Ps   K Lc
 K Lc
 
2
E    sk ,1  c1,l ck ,l    sk ,1  c1,l ck ,l  
2 Lc   k  2 l 1   k  2 l  1  
Lc
 2  E s 2 k ,1  E c 21,l  E c 21,l 
Ps K
2 Lc k  2 l 1

Ps ( K  1) Lc Ps ( K  1)
 2

2 Lc 2 Lc

40
 SINR and Error Probability
Ps
2 Ps
SINR  
( K  1) Ps N 0 ( K  1) Ps N 0
 
2 Lc 4Tb Lc 2Tb

 Ps   
   
2 Eb
pe  Q  2   Q 
 N 0 ( K  1) Ps   N  2( K  1) Eb 
 4T  2 L   0
Lc 
 b j   

41
Near-far-effect in CDMA

42
Power Control

43
 Time-hopping Spread Spectrum
Time Hopping
 Generating and receiving pulses according to PN
sequence

44
 UWB
• UWB signals are typically modulated pulse trains with
 Very short pulse duration (<1 ns)
 Uniform or non-uniform inter-pulse spacing
• Pulse repetition frequency (PRF) can range from hundreds of
thousands to billions of pulses/second
• Modulation techniques include pulse-position modulation, binary
phase-shift keying and others

Pulse width Inter-pulse spacing: uniform or variable

45
 UWB
Narrowband (30kHz)

Wideband CDMA (5 MHz)

UWB (Several GHz)

Frequency

• UWB is a form of extremely wide spread spectrum where RF

energy is spread over gigahertz of spectrum
 Wider than any narrowband system by orders of magnitude
 Power seen by a narrowband system is a fraction of the total
 UWB signals can be designed to look like imperceptible random
noise to conventional radios

46
 UWB
Simultaneously low power, low cost high data-rate wireless
communications
Well-suited to short-distance applications:
 PAN
 Wireless monitors
 Data from digital camcorders
 Wireless printing
 File transfer between cell phones, portable media players
 Medical imaging

47