Spread Spectrum Wireless Networks Fall 2007 Spread Spectrum
![Spread Spectrum Wireless Networks Fall 2007 Spread Spectrum Wireless Networks Fall 2007](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-1.jpg)
![Spread Spectrum q Input is fed into a channel encoder o Produces analog signal Spread Spectrum q Input is fed into a channel encoder o Produces analog signal](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-2.jpg)
![Spread Spectrum Wireless Networks Fall 2007 Spread Spectrum Wireless Networks Fall 2007](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-3.jpg)
![Spread Spectrum q What can be gained from apparent waste of spectrum? o Immunity Spread Spectrum q What can be gained from apparent waste of spectrum? o Immunity](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-4.jpg)
![Frequency Hoping Spread Spectrum (FHSS) q Signal is broadcast over seemingly random series of Frequency Hoping Spread Spectrum (FHSS) q Signal is broadcast over seemingly random series of](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-5.jpg)
![Frequency Hoping Spread Spectrum q Channel sequence dictated by spreading code q Receiver, hopping Frequency Hoping Spread Spectrum q Channel sequence dictated by spreading code q Receiver, hopping](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-6.jpg)
![Frequency Hopping Spread Spectrum Wireless Networks Fall 2007 Frequency Hopping Spread Spectrum Wireless Networks Fall 2007](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-7.jpg)
![FHSS Using MFSK q MFSK signal is translated to a new frequency every Tc FHSS Using MFSK q MFSK signal is translated to a new frequency every Tc](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-8.jpg)
![FHSS Performance Considerations q Large number of frequencies used q Results in a system FHSS Performance Considerations q Large number of frequencies used q Results in a system](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-9.jpg)
![Direct Sequence Spread Spectrum (DSSS) q Each bit in original signal is represented by Direct Sequence Spread Spectrum (DSSS) q Each bit in original signal is represented by](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-10.jpg)
![Direct Sequence Spread Spectrum (DSSS) Wireless Networks Fall 2007 Direct Sequence Spread Spectrum (DSSS) Wireless Networks Fall 2007](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-11.jpg)
![DSSS Using BPSK q Multiply BPSK signal, sd(t) = A d(t) cos(2 fct) by DSSS Using BPSK q Multiply BPSK signal, sd(t) = A d(t) cos(2 fct) by](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-12.jpg)
![Wireless Networks Fall 2007 Wireless Networks Fall 2007](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-13.jpg)
![Code-Division Multiple Access (CDMA) q Basic Principles of CDMA o D = rate of Code-Division Multiple Access (CDMA) q Basic Principles of CDMA o D = rate of](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-14.jpg)
![CDMA Example q If k=6 and code is a sequence of 1 s and CDMA Example q If k=6 and code is a sequence of 1 s and](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-15.jpg)
![CDMA Example q User A code = <1, – 1, 1> o To send CDMA Example q User A code = <1, – 1, 1> o To send](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-16.jpg)
![CDMA for Direct Sequence Spread Spectrum Wireless Networks Fall 2007 CDMA for Direct Sequence Spread Spectrum Wireless Networks Fall 2007](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-17.jpg)
![Categories of Spreading Sequences q Spreading Sequence Categories o PN sequences o Orthogonal codes Categories of Spreading Sequences q Spreading Sequence Categories o PN sequences o Orthogonal codes](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-18.jpg)
![PN Sequences q PN generator produces periodic sequence that appears to be random q PN Sequences q PN generator produces periodic sequence that appears to be random q](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-19.jpg)
![Important PN Properties q Randomness o Uniform distribution • Balance property • Run property Important PN Properties q Randomness o Uniform distribution • Balance property • Run property](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-20.jpg)
![Linear Feedback Shift Register Implementation Wireless Networks Fall 2007 Linear Feedback Shift Register Implementation Wireless Networks Fall 2007](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-21.jpg)
![Properties of M-Sequences q Property 1: o Has 2 n-1 ones and 2 n-1 Properties of M-Sequences q Property 1: o Has 2 n-1 ones and 2 n-1](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-22.jpg)
![Properties of M-Sequences q Property 4: o The periodic autocorrelation of a ± 1 Properties of M-Sequences q Property 4: o The periodic autocorrelation of a ± 1](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-23.jpg)
![Definitions q Correlation o The concept of determining how much similarity one set of Definitions q Correlation o The concept of determining how much similarity one set of](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-24.jpg)
![Advantages of Cross Correlation q The cross correlation between an m-sequence and noise is Advantages of Cross Correlation q The cross correlation between an m-sequence and noise is](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-25.jpg)
![Gold Sequences q Gold sequences constructed by the XOR of two m-sequences with the Gold Sequences q Gold sequences constructed by the XOR of two m-sequences with the](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-26.jpg)
![Gold Sequences Wireless Networks Fall 2007 Gold Sequences Wireless Networks Fall 2007](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-27.jpg)
![Orthogonal Codes q Orthogonal codes o All pairwise cross correlations are zero o Fixed- Orthogonal Codes q Orthogonal codes o All pairwise cross correlations are zero o Fixed-](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-28.jpg)
![Walsh Codes q Set of Walsh codes of length n consists of the n Walsh Codes q Set of Walsh codes of length n consists of the n](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-29.jpg)
![Typical Multiple Spreading Approach q Spread data rate by an orthogonal code (channelization code) Typical Multiple Spreading Approach q Spread data rate by an orthogonal code (channelization code)](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-30.jpg)
- Slides: 30
![Spread Spectrum Wireless Networks Fall 2007 Spread Spectrum Wireless Networks Fall 2007](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-1.jpg)
Spread Spectrum Wireless Networks Fall 2007
![Spread Spectrum q Input is fed into a channel encoder o Produces analog signal Spread Spectrum q Input is fed into a channel encoder o Produces analog signal](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-2.jpg)
Spread Spectrum q Input is fed into a channel encoder o Produces analog signal with narrow bandwidth q Signal is further modulated using sequence of digits o Spreading code or spreading sequence o Generated by pseudonoise, or pseudo-random number generator q Effect of modulation is to increase bandwidth of signal to be transmitted q On receiving end, digit sequence is used to demodulate the spread spectrum signal q Signal is fed into a channel decoder to recover data Wireless Networks Fall 2007
![Spread Spectrum Wireless Networks Fall 2007 Spread Spectrum Wireless Networks Fall 2007](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-3.jpg)
Spread Spectrum Wireless Networks Fall 2007
![Spread Spectrum q What can be gained from apparent waste of spectrum o Immunity Spread Spectrum q What can be gained from apparent waste of spectrum? o Immunity](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-4.jpg)
Spread Spectrum q What can be gained from apparent waste of spectrum? o Immunity from various kinds of noise and multipath distortion o Can be used for hiding and encrypting signals o Several users can independently use the same higher bandwidth with very little interference Wireless Networks Fall 2007
![Frequency Hoping Spread Spectrum FHSS q Signal is broadcast over seemingly random series of Frequency Hoping Spread Spectrum (FHSS) q Signal is broadcast over seemingly random series of](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-5.jpg)
Frequency Hoping Spread Spectrum (FHSS) q Signal is broadcast over seemingly random series of radio frequencies o A number of channels allocated for the FH signal o Width of each channel corresponds to bandwidth of input signal q Signal hops from frequency to frequency at fixed intervals o Transmitter operates in one channel at a time o Bits are transmitted using some encoding scheme o At each successive interval, a new carrier frequency is selected Wireless Networks Fall 2007
![Frequency Hoping Spread Spectrum q Channel sequence dictated by spreading code q Receiver hopping Frequency Hoping Spread Spectrum q Channel sequence dictated by spreading code q Receiver, hopping](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-6.jpg)
Frequency Hoping Spread Spectrum q Channel sequence dictated by spreading code q Receiver, hopping between frequencies in synchronization with transmitter, picks up message q Advantages o Eavesdroppers hear only unintelligible blips o Attempts to jam signal on one frequency succeed only at knocking out a few bits Wireless Networks Fall 2007
![Frequency Hopping Spread Spectrum Wireless Networks Fall 2007 Frequency Hopping Spread Spectrum Wireless Networks Fall 2007](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-7.jpg)
Frequency Hopping Spread Spectrum Wireless Networks Fall 2007
![FHSS Using MFSK q MFSK signal is translated to a new frequency every Tc FHSS Using MFSK q MFSK signal is translated to a new frequency every Tc](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-8.jpg)
FHSS Using MFSK q MFSK signal is translated to a new frequency every Tc seconds by modulating the MFSK signal with the FHSS carrier signal q For data rate of R: o duration of a bit: T = 1/R seconds o duration of signal element: Ts = LT seconds q Tc Ts - slow-frequency-hop spread spectrum o Cheaper to implement but less protection against noise/jamming o Popular technique for wireless LANs q Tc < Ts - fast-frequency-hop spread spectrum o More expensive to implement, provides more protection against noise/jamming Wireless Networks Fall 2007
![FHSS Performance Considerations q Large number of frequencies used q Results in a system FHSS Performance Considerations q Large number of frequencies used q Results in a system](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-9.jpg)
FHSS Performance Considerations q Large number of frequencies used q Results in a system that is quite resistant to jamming o Jammer must jam all frequencies o With fixed power, this reduces the jamming power in any one frequency band Wireless Networks Fall 2007
![Direct Sequence Spread Spectrum DSSS q Each bit in original signal is represented by Direct Sequence Spread Spectrum (DSSS) q Each bit in original signal is represented by](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-10.jpg)
Direct Sequence Spread Spectrum (DSSS) q Each bit in original signal is represented by multiple bits in the transmitted signal q Spreading code spreads signal across a wider frequency band o Spread is in direct proportion to number of bits used q One technique combines digital information stream with the spreading code bit stream using exclusive-OR Wireless Networks Fall 2007
![Direct Sequence Spread Spectrum DSSS Wireless Networks Fall 2007 Direct Sequence Spread Spectrum (DSSS) Wireless Networks Fall 2007](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-11.jpg)
Direct Sequence Spread Spectrum (DSSS) Wireless Networks Fall 2007
![DSSS Using BPSK q Multiply BPSK signal sdt A dt cos2 fct by DSSS Using BPSK q Multiply BPSK signal, sd(t) = A d(t) cos(2 fct) by](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-12.jpg)
DSSS Using BPSK q Multiply BPSK signal, sd(t) = A d(t) cos(2 fct) by c(t) [takes values +1, -1] to get s(t) = A d(t)c(t) cos(2 fct) • A = amplitude of signal • fc = carrier frequency • d(t) = discrete function [+1, -1] q At receiver, incoming signal multiplied by c(t) o Since, c(t) x c(t) = 1, incoming signal is recovered Wireless Networks Fall 2007
![Wireless Networks Fall 2007 Wireless Networks Fall 2007](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-13.jpg)
Wireless Networks Fall 2007
![CodeDivision Multiple Access CDMA q Basic Principles of CDMA o D rate of Code-Division Multiple Access (CDMA) q Basic Principles of CDMA o D = rate of](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-14.jpg)
Code-Division Multiple Access (CDMA) q Basic Principles of CDMA o D = rate of data signal o Break each bit into k chips • Chips are a user-specific fixed pattern o Chip data rate of new channel = k. D Wireless Networks Fall 2007
![CDMA Example q If k6 and code is a sequence of 1 s and CDMA Example q If k=6 and code is a sequence of 1 s and](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-15.jpg)
CDMA Example q If k=6 and code is a sequence of 1 s and -1 s o For a ‘ 1’ bit, A sends code as chip pattern • <c 1, c 2, c 3, c 4, c 5, c 6> o For a ‘ 0’ bit, A sends complement of code • <-c 1, -c 2, -c 3, -c 4, -c 5, -c 6> q Receiver knows sender’s code and performs electronic decode function o <d 1, d 2, d 3, d 4, d 5, d 6> = received chip pattern o <c 1, c 2, c 3, c 4, c 5, c 6> = sender’s code Wireless Networks Fall 2007
![CDMA Example q User A code 1 1 1 o To send CDMA Example q User A code = <1, – 1, 1> o To send](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-16.jpg)
CDMA Example q User A code = <1, – 1, 1> o To send a 1 bit = <1, – 1, 1> o To send a 0 bit = <– 1, 1, 1, – 1> q User B code = <1, 1, – 1, 1, 1> o To send a 1 bit = <1, 1, – 1, 1, 1> q Receiver receiving with A’s code o (A’s code) x (received chip pattern) • User A ‘ 1’ bit: 6 -> 1 • User A ‘ 0’ bit: -6 -> 0 • User B ‘ 1’ bit: 0 -> unwanted signal ignored Wireless Networks Fall 2007
![CDMA for Direct Sequence Spread Spectrum Wireless Networks Fall 2007 CDMA for Direct Sequence Spread Spectrum Wireless Networks Fall 2007](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-17.jpg)
CDMA for Direct Sequence Spread Spectrum Wireless Networks Fall 2007
![Categories of Spreading Sequences q Spreading Sequence Categories o PN sequences o Orthogonal codes Categories of Spreading Sequences q Spreading Sequence Categories o PN sequences o Orthogonal codes](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-18.jpg)
Categories of Spreading Sequences q Spreading Sequence Categories o PN sequences o Orthogonal codes q For FHSS systems o PN sequences most common q For DSSS systems not employing CDMA o PN sequences most common q For DSSS CDMA systems o PN sequences o Orthogonal codes Wireless Networks Fall 2007
![PN Sequences q PN generator produces periodic sequence that appears to be random q PN Sequences q PN generator produces periodic sequence that appears to be random q](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-19.jpg)
PN Sequences q PN generator produces periodic sequence that appears to be random q PN Sequences o Generated by an algorithm using initial seed o Sequence isn’t statistically random but will pass many test of randomness o Sequences referred to as pseudorandom numbers or pseudonoise sequences o Unless algorithm and seed are known, the sequence is impractical to predict Wireless Networks Fall 2007
![Important PN Properties q Randomness o Uniform distribution Balance property Run property Important PN Properties q Randomness o Uniform distribution • Balance property • Run property](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-20.jpg)
Important PN Properties q Randomness o Uniform distribution • Balance property • Run property o Independence o Correlation property q Unpredictability Wireless Networks Fall 2007
![Linear Feedback Shift Register Implementation Wireless Networks Fall 2007 Linear Feedback Shift Register Implementation Wireless Networks Fall 2007](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-21.jpg)
Linear Feedback Shift Register Implementation Wireless Networks Fall 2007
![Properties of MSequences q Property 1 o Has 2 n1 ones and 2 n1 Properties of M-Sequences q Property 1: o Has 2 n-1 ones and 2 n-1](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-22.jpg)
Properties of M-Sequences q Property 1: o Has 2 n-1 ones and 2 n-1 -1 zeros q Property 2: o For a window of length n slid along output for N (=2 n-1) shifts, each n -tuple appears once, except for the all zeros sequence q Property 3: o o o Sequence contains one run of ones, length n One run of zeros, length n-1 One run of ones and one run of zeros, length n-2 Two runs of ones and two runs of zeros, length n-3 2 n-3 runs of ones and 2 n-3 runs of zeros, length 1 Wireless Networks Fall 2007
![Properties of MSequences q Property 4 o The periodic autocorrelation of a 1 Properties of M-Sequences q Property 4: o The periodic autocorrelation of a ± 1](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-23.jpg)
Properties of M-Sequences q Property 4: o The periodic autocorrelation of a ± 1 m-sequence is Wireless Networks Fall 2007
![Definitions q Correlation o The concept of determining how much similarity one set of Definitions q Correlation o The concept of determining how much similarity one set of](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-24.jpg)
Definitions q Correlation o The concept of determining how much similarity one set of data has with another o Range between – 1 and 1 • 1 The second sequence matches the first sequence • 0 There is no relation at all between the two sequences • -1 The two sequences are mirror images q Cross correlation o The comparison between two sequences from different sources rather than a shifted copy of a sequence with itself Wireless Networks Fall 2007
![Advantages of Cross Correlation q The cross correlation between an msequence and noise is Advantages of Cross Correlation q The cross correlation between an m-sequence and noise is](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-25.jpg)
Advantages of Cross Correlation q The cross correlation between an m-sequence and noise is low o This property is useful to the receiver in filtering out noise q The cross correlation between two different m-sequences is low o This property is useful for CDMA applications o Enables a receiver to discriminate among spread spectrum signals generated by different m-sequences Wireless Networks Fall 2007
![Gold Sequences q Gold sequences constructed by the XOR of two msequences with the Gold Sequences q Gold sequences constructed by the XOR of two m-sequences with the](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-26.jpg)
Gold Sequences q Gold sequences constructed by the XOR of two m-sequences with the same clocking q Codes have well-defined cross correlation properties q Only simple circuitry needed to generate large number of unique codes q In following example (Figure 7. 16 a) two shift registers generate the two m-sequences and these are then bitwise XORed Wireless Networks Fall 2007
![Gold Sequences Wireless Networks Fall 2007 Gold Sequences Wireless Networks Fall 2007](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-27.jpg)
Gold Sequences Wireless Networks Fall 2007
![Orthogonal Codes q Orthogonal codes o All pairwise cross correlations are zero o Fixed Orthogonal Codes q Orthogonal codes o All pairwise cross correlations are zero o Fixed-](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-28.jpg)
Orthogonal Codes q Orthogonal codes o All pairwise cross correlations are zero o Fixed- and variable-length codes used in CDMA systems o For CDMA application, each mobile user uses one sequence in the set as a spreading code • Provides zero cross correlation among all users q Types o Walsh codes o Variable-Length Orthogonal codes Wireless Networks Fall 2007
![Walsh Codes q Set of Walsh codes of length n consists of the n Walsh Codes q Set of Walsh codes of length n consists of the n](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-29.jpg)
Walsh Codes q Set of Walsh codes of length n consists of the n rows of an n X n Walsh matrix: o W 1 = (0) • n = dimension of the matrix o Every row is orthogonal to every other row and to the logical not of every other row o Requires tight synchronization • Cross correlation between different shifts of Walsh sequences is not zero Wireless Networks Fall 2007
![Typical Multiple Spreading Approach q Spread data rate by an orthogonal code channelization code Typical Multiple Spreading Approach q Spread data rate by an orthogonal code (channelization code)](https://slidetodoc.com/presentation_image/54c47f7eaa751806f97c5964843d6303/image-30.jpg)
Typical Multiple Spreading Approach q Spread data rate by an orthogonal code (channelization code) o Provides mutual orthogonality among all users in the same cell q Further spread result by a PN sequence (scrambling code) o Provides mutual randomness (low cross correlation) between users in different cells Wireless Networks Fall 2007
What are wireless devices and the wireless revolution
Gast 802 11 wireless networks "torrent"
Wireless wide area network
Wireless networks
Wireless networking definition
Single node architecture in wsn
Understanding wired and wireless networks
Local wireless networks
Wireless sensor networks for habitat monitoring
Habitat monitoring sensor
Game theory in wireless and communication networks
Advantages and disadvantages of wired and wireless networks
Virtual circuit tables
Basestore iptv
Stevenson and black 2007 inclusion spectrum
Frequency-hopping spread spectrum
How to spread cold butter
Src spread spectrum
Frequency hopping spread spectrum
Absorption spectrum
Chromium orbital configuration
Fundamentals of wireless communications
Wireless security training
(y+z)p+(z+x)q=x+y
Wireless lan 802
Wireless geolocation system
Constrained nodes and constrained networks
Srrc certification
Udea ısıtıcı
Wireless problems
Advantages of wireless communication