1. Data and Computer Communications Ninth Edition by William Stallings Chapter 9 – Spread Spectrum Data and Computer Communications, Ninth Edition by William Stallings, (c) Pearson Education - Prentice Hall, 2011

2. Spread Spectrum All creative people want to do the unexpected. —Ecstasy and Me: My Life as a Woman, Hedy Lamarr

3. Spread Spectrum important encoding method for wireless communications analog & digital data with analog signal spreads data over wide bandwidth makes jamming and interception harder two approaches, both in use: Frequency Hopping Direct Sequence

4. Pseudorandom Numbers http://www.math.utah.edu/~pa/Random/Random.html see also rand() and srand() functions http://www.math.utah.edu/~pa/Random/Random.htmlrand() and srand() http://www.math.utah.edu/~pa/Random/Random.htmlrand() and srand() only receiver can decode signal need to know algorithm and seed to predict sequence starting from an initial seed generated by a deterministic algorithm not actually random if algorithm good, results pass reasonable tests of randomness

5. General Model of Spread Spectrum System

6. Spread Spectrum Advantages  immunity from noise and multipath distortion  can hide / encrypt signals  several users can share same higher bandwidth with little interference CDM/CDMA Mobile telephones CDM/CDMA Mobile telephones

7. Frequency Hopping Spread Spectrum (FHSS) signal is broadcast over seemingly random series of frequencies receiver hops between frequencies in sync with transmitter eavesdroppers hear unintelligible blips jamming on one frequency affects only a few bits

8. Frequency Hopping Example

9. FHSS (Transmitter)

10. Frequency Hopping Spread Spectrum System (Receiver)

11. Slow and Fast FHSS  commonly use multiple FSK (MFSK)  have frequency shifted every T c seconds  duration of signal element is T s seconds  Slow FHSS has T c  T s  Fast FHSS has T c < T s  FHSS quite resistant to noise or jamming with fast FHSS giving better performance with fast FHSS giving better performance

12. Slow MFSK FHSS (PN: pseudo noise)

13. Fast MFSK FHSS (PN: pseudo noise)

14. Direct Sequence Spread Spectrum (DSSS)  each bit is represented by multiple bits using a spreading code  this spreads signal across a wider frequency band  has performance similar to FHSS

15. Direct Sequence Spread Spectrum Example

16. Direct Sequence Spread Spectrum System

17. DSSS Example Using BPSK

18. Approximate Spectrum of DSSS Signal

19. Code Division Multiple Access (CDMA) Allocating frequency channels on-demand in a multi-users environnement is inefficient (need complex circuitry and protocol). More efficient to give each user all the bandwith and give him a « key » to encode his transmission.

20. Code Division Multiple Access (CDMA) a multiplexing technique used with spread spectrum given a data signal rate D break each bit into k chips according to a fixed chipping code specific to each user resulting new channel has chip data rate kD chips per second can have multiple channels superimposed

21. CDMA Example

22. CDMA “chip” Orthogonality : http://en.wikipedia.org/wiki/Chip_(CDMA)http://en.wikipedia.org/wiki/Chip_(CDMA) Or not…

23. CDMA Example Not perfectly orthogonal codes

24. CDMA for DSSS

25. Summary  concept of spread spectrum  FHSS FHSS using MFSK FHSS using MFSK  DSSS DSSS using BPSK DSSS using BPSK  Code Division Multiple Access CDMA for Direct Sequence Spread Spectrum CDMA for Direct Sequence Spread Spectrum