1 / 26

Data and Computer Communications

Data and Computer Communications. Chapter 9 – Spread Spectrum. 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:

yonah
Download Presentation

Data and Computer Communications

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Data and Computer Communications Chapter 9 – Spread Spectrum

  2. 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

  3. General Model of Spread Spectrum System

  4. 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

  5. Pseudorandom Numbers • generated by a deterministic algorithm • not actually random • but if algorithm good, results pass reasonable tests of randomness • starting from an initial seed • need to know algorithm and seed to predict sequence • hence only receiver can decode signal

  6. 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

  7. Frequency Hopping Example

  8. FHSS (Transmitter)

  9. Frequency Hopping Spread Spectrum System (Receiver)

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

  11. Slow MFSK FHSS

  12. Fast MFSK FHSS

  13. 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

  14. Direct Sequence Spread Spectrum Example

  15. Direct Sequence Spread Spectrum System

  16. DSSS Example Using BPSK

  17. ApproximateSpectrum of DSSS Signal

  18. 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

  19. CDMA Example

  20. CDMA for DSSS

  21. # Consider the seven-channel CDMA shown in the following figure. Enlist the user code for each channel. A positive sum is decoded (at the receiver) as ‘1’ and a negative sum is decoded as ‘0’. If all the channels are transmitting as shown, determine whether the receiver detects the correct bit of channel 1. Problem

  22. Problem

  23. Orthogonal Sequence Sequence is generated by Walsh Table: W1 = [+1] W2 = W1 W1 W1 !W1 W4 = W2 W2 W2 !W2

  24. Summary • looked at use of spread spectrum techniques: • FHSS • DSSS • CDMA

More Related