Physical Layer Physical Layer Transfers bits through signals overs - - PowerPoint PPT Presentation

physical layer physical layer
SMART_READER_LITE
LIVE PREVIEW

Physical Layer Physical Layer Transfers bits through signals overs - - PowerPoint PPT Presentation

Physical Layer Physical Layer Transfers bits through signals overs links Wires etc. carry analog signals We want to send digital bits 10110 10110 Signal CSE 461 University of Washington 2 Topics 1. Coding and Modulation


slide-1
SLIDE 1

Physical Layer

slide-2
SLIDE 2

Physical Layer

  • Transfers bits through signals overs links
  • Wires etc. carry analog signals
  • We want to send digital bits

CSE 461 University of Washington 2

…10110

10110… Signal

slide-3
SLIDE 3

Topics

1. Coding and Modulation schemes

  • Representing bits, noise

2. Properties of media

  • Wires, fiber optics, wireless, propagation
  • Bandwidth, attenuation, noise

3. Fundamental limits

  • Nyquist, Shannon

CSE 461 University of Washington 3

slide-4
SLIDE 4

Coding and Modulation

slide-5
SLIDE 5

Topic

  • How can we send information across a link?
  • This is the topic of coding and modulation
  • Modem (from modulator–demodulator)

CSE 461 University of Washington 5

…10110

10110…

Signal

slide-6
SLIDE 6

A Simple Coding Scheme

  • Let a high voltage (+V) represent a 1, and low voltage (-V) represent a 0
  • This is called NRZ (Non-Return to Zero)

CSE 461 University of Washington 6

Bits NRZ

1 1 1 1 1 1 1 +V

  • V
slide-7
SLIDE 7

A Simple Coding Scheme (2)

  • Let a high voltage (+V) represent a 1, and low voltage (-V) represent a 0
  • This is called NRZ (Non-Return to Zero)

CSE 461 University of Washington 7

Bits NRZ

1 1 1 1 1 1 1 +V

  • V
slide-8
SLIDE 8

Many Other Schemes

  • Can use more signal levels
  • E.g., 4 levels is 2 bits per symbol
  • Practical schemes are driven by engineering

considerations

  • E.g., clock recovery

CSE 461 University of Washington 8

slide-9
SLIDE 9

Clock Recovery

  • Um, how many zeros was that?
  • Receiver needs frequent signal transitions to decode bits
  • Several possible designs
  • E.g., Manchester coding and scrambling (§2.5.1)

CSE 461 University of Washington 9

1 0 0 0 0 0 0 0 0 0 … 0

slide-10
SLIDE 10

Ideas?

slide-11
SLIDE 11

Answer 1: A Simple Coding

  • Let a high voltage (+V) represent a 1, and low voltage (-V) represent a 0
  • Then go back to 0V for a “Reset”
  • This is called RZ (Return to Zero)

CSE 461 University of Washington 11

Bits RZ

1 1 1 1

  • V

+V

slide-12
SLIDE 12

Answer 2: Clock Recovery – 4B/5B

  • Map every 4 data bits into 5 code bits without long

runs of zeros

  • 0000 à 11110, 0001 à 01001, 1110 à 11100, …

1111 à 11101

  • Has at most 3 zeros in a row
  • Also invert signal level on a 1 to break up long runs of 1s

(called NRZI, §2.5.1)

CSE 461 University of Washington 12

slide-13
SLIDE 13

Answer 2: Clock Recovery – 4B/5B (2)

  • 4B/5B code for reference:
  • 0000à11110, 0001à01001, 1110à11100, …

1111à11101

  • Message bits: 1 1 1 1 0 0 0 0 0 0 0 1

CSE 461 University of Washington 13

Coded Bits: Signal:

slide-14
SLIDE 14

Clock Recovery – 4B/5B (3)

  • 4B/5B code for reference:
  • 0000à11110, 0001à01001, 1110à11100, …

1111à11101

  • Message bits: 1 1 1 1 0 0 0 0 0 0 0 1

CSE 461 University of Washington 14

Coded Bits: Signal: 1 1 1 0 1 1 1 1 1 0 0 1 0 0 1

slide-15
SLIDE 15

Coding vs. Modulation

  • What we have seen so far is called coding
  • Signal is sent directly on a wire
  • These signals do not propagate well as RF
  • Need to send at higher frequencies
  • Modulation carries a signal by modulating a carrier
  • Baseband is signal pre-modulation
  • Keying is the digital form of modulation (equivalent to

coding but using modulation)

CSE 461 University of Washington 15

slide-16
SLIDE 16

Passband Modulation (2)

  • Carrier is simply a signal oscillating at a desired

frequency:

  • We can modulate it by changing:
  • Amplitude, frequency, or phase

CSE 461 University of Washington 16

slide-17
SLIDE 17

Comparisons

CSE 461 University of Washington 17

NRZ signal of bits Amplitude shift keying Frequency shift keying Phase shift keying

slide-18
SLIDE 18

Remember: Everything is ultimately analog

  • Even digital signals
  • Digital information is a discrete concept

represented in an analog physical medium ○ A printed book (analog) vs. ○ Words conveyed in the book (digital)

CSE 461 University of Washington 18

slide-19
SLIDE 19

Media

slide-20
SLIDE 20

Types of Media

  • Media propagate signals that carry bits of

information

  • We’ll look at some common types:
  • Wires
  • Fiber (fiber optic cables)
  • Wireless

CSE 461 University of Washington 20

slide-21
SLIDE 21

Wires – Twisted Pair

  • Very common; used in LANs and telephone lines
  • Twists reduce radiated signal

CSE 461 University of Washington 21

Category 5 UTP cable with four twisted pairs

slide-22
SLIDE 22

Wires – Coaxial Cable

  • Also common. Better shielding for better performance
  • Other kinds of wires too: e.g., electrical power (§2.2.4)

CSE 461 University of Washington 22

slide-23
SLIDE 23

Fiber

  • Long, thin, pure strands of glass
  • Enormous bandwidth (high speed) over long distances

CSE 461 University of Washington 23

Light source (LED, laser) Photo- detector Light trapped by total internal reflection Optical fiber

slide-24
SLIDE 24

Fiber (2)

  • Two varieties: multi-mode (shorter links, cheaper)

and single-mode (up to ~100 km)

CSE 461 University of Washington 24

Fiber bundle in a cable One fiber

slide-25
SLIDE 25

Signals over Fiber

  • Light propagates with very low loss in three very

wide frequency bands

  • Use a carrier to send information

CSE 461 University of Washington 25

Wavelength (μm) Attenuation (dB/km)

By SVG: Sassospicco Raster: Alexwind, CC-BY-SA-3.0, via Wikimedia Commons

slide-26
SLIDE 26

Wireless

  • Sender radiates signal over a region
  • In many directions, unlike a wire, to potentially many

receivers

  • Nearby signals (same freq.) interfere at a receiver; need to

coordinate use

CSE 461 University of Washington 26

slide-27
SLIDE 27

Wireless Interference

slide-28
SLIDE 28

CSE 461 University of Washington 28

WiFi WiFi

slide-29
SLIDE 29

Wireless (2)

  • Unlicensed (ISM) frequencies, e.g., WiFi, are widely

used for computer networking

802.11 b/g/n 802.11a/g/n

slide-30
SLIDE 30

Multipath (3)

  • Signals bounce off objects and take multiple paths
  • Some frequencies attenuated at receiver, varies with

location

CSE 461 University of Washington 30

slide-31
SLIDE 31

Wireless (4)

  • Various other effects too!
  • Wireless propagation is complex, depends on

environment

  • Some key effects are highly frequency dependent,
  • E.g., multipath at microwave frequencies

CSE 461 University of Washington 31

slide-32
SLIDE 32

Limits

slide-33
SLIDE 33

Topic

  • How rapidly can we send information over a link?
  • Nyquist limit (~1924)
  • Shannon capacity (1948)
  • Practical systems attempt to approach these limits

CSE 461 University of Washington 33

slide-34
SLIDE 34

Key Channel Properties

  • The bandwidth (B), signal strength (S), and noise (N)
  • B (in hertz) limits the rate of transitions
  • S and N limit how many signal levels we can distinguish

CSE 461 University of Washington 34

Bandwidth B Signal S, Noise N

slide-35
SLIDE 35

Nyquist Limit

  • The maximum symbol rate is 2B
  • Thus if there are V signal levels, ignoring noise, the

maximum bit rate is:

CSE 461 University of Washington 35

R = 2B log2V bits/sec

1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1

slide-36
SLIDE 36

Claude Shannon (1916-2001)

  • Father of information theory
  • “A Mathematical Theory of

Communication”, 1948

  • Fundamental contributions

to digital computers, security, and communications

CSE 461 University of Washington 36

Credit: Courtesy MIT Museum

Electromechanical mouse that “solves” mazes!

slide-37
SLIDE 37

Shannon Capacity

  • How many levels we can distinguish depends on S/N
  • Or SNR, the Signal-to-Noise Ratio
  • Note noise is random, hence some errors
  • SNR given on a log-scale in deciBels:
  • SNRdB = 10log10(S/N)

CSE 461 University of Washington 37

1 2 3 N S+N

slide-38
SLIDE 38

Shannon Capacity (2)

  • Shannon limit is for capacity (C), the maximum

information carrying rate of the channel:

CSE 461 University of Washington 38

C = B log2(1 + S/N) bits/sec

slide-39
SLIDE 39

Shannon Capacity Takeaways

CSE 461 University of Washington 39

C = B log2(1 + S/N) bits/sec

  • There is some rate at which we can transmit data

without loss over a random channel

  • Assuming noise fixed, increasing the signal power

yields diminishing returns : (

  • Assuming signal is fixed, increasing bandwith

increases capacity linearly!

slide-40
SLIDE 40

Wired/Wireless Perspective (2)

  • Wires, and Fiber
  • Engineer link to have requisite SNR and B

→Can fix data rate

  • Wireless
  • Given B, but SNR varies greatly, e.g., up to 60 dB!

→Can’t design for worst case, must adapt data rate

CSE 461 University of Washington 40

Engineer SNR for data rate Adapt data rate to SNR

slide-41
SLIDE 41

Putting it all together – DSL

  • DSL (Digital Subscriber Line, see §2.6.3) is widely

used for broadband; many variants offer 10s of Mbps

  • Reuses twisted pair telephone line to the home; it has up

to ~2 MHz of bandwidth but uses only the lowest ~4 kHz

CSE 461 University of Washington 41

slide-42
SLIDE 42

DSL (2)

  • DSL uses passband modulation (called OFDM)
  • Separate bands for upstream and downstream (larger)
  • Modulation varies both amplitude and phase (QAM)
  • High SNR, up to 15 bits/symbol, low SNR only 1 bit/symbol

CSE 461 University of Washington 42

Upstream Downstream 26 – 138 kHz 0-4 kHz 143 kHz to 1.1 MHz Telephone Freq. Voice Up to 1 Mbps Up to 12 Mbps

ADSL2:

slide-43
SLIDE 43

Phy Layer Innovation Still Happening!

  • Backscatter “zero power” wireless
  • mm wave 30GHz+ radio equipment
  • Free space optical (FSO)
  • Cooperative interference management
  • Massive MIMO and beamforming
  • Powerline Networking
slide-44
SLIDE 44

Backup

slide-45
SLIDE 45

All distilled to a simple link model

  • Rate (or bandwidth, capacity, speed) in bits/second
  • Delay in seconds, related to length
  • Other important properties:
  • Whether the channel is broadcast, and its error rate

CSE 461 University of Washington 45

Delay D, Rate R Message

slide-46
SLIDE 46

Simple Link Model

  • We’ll end with an abstraction of a physical channel
  • Rate (or bandwidth, capacity, speed) in bits/second
  • Delay in seconds, related to length
  • Other important properties:
  • Whether the channel is broadcast, and its error rate

CSE 461 University of Washington 46

Delay D, Rate R Message

slide-47
SLIDE 47

Message Latency

  • Latency is the delay to send a message over a link
  • Transmission delay: time to put M-bit message “on the wire”
  • Propagation delay: time for bits to propagate across the wire
  • Combining the two terms we have:

CSE 461 University of Washington 47

slide-48
SLIDE 48

Message Latency (2)

  • Latency is the delay to send a message over a link
  • Transmission delay: time to put M-bit message “on the wire”

T-delay = M (bits) / Rate (bits/sec) = M/R seconds

  • Propagation delay: time for bits to propagate across the wire

P-delay = Length / speed of signals = Length / ⅔c = D seconds

  • Combining the two terms we have: L = M/R + D

CSE 461 University of Washington 48

slide-49
SLIDE 49

Latency Examples

  • “Dialup” with a telephone modem:
  • D = 5 ms, R = 56 kbps, M = 1250 bytes
  • Broadband cross-country link:
  • D = 50 ms, R = 10 Mbps, M = 1250 bytes

CSE 461 University of Washington 49

Remembering L = M/R + D

slide-50
SLIDE 50

Latency Examples (2)

  • “Dialup” with a telephone modem:
  • D = 5 ms, R = 56 kbps, M = 1250 bytes
  • L = (1250x8)/(56 x 103) sec + 5ms = 184 ms!
  • Broadband cross-country link:
  • D = 50 ms, R = 10 Mbps, M = 1250 bytes
  • L = (1250x8) / (10 x 106) sec + 50ms = 51 ms
  • A long link or a slow rate means high latency: One component

dominates

CSE 461 University of Washington 50

slide-51
SLIDE 51

Bandwidth-Delay Product

  • Messages take space on the wire!
  • The amount of data in flight is the bandwidth-delay

(BD) product

BD = R x D

  • Measure in bits, or in messages
  • Small for LANs, big for “long fat” pipes

CSE 461 University of Washington 51

slide-52
SLIDE 52

CSE 461 University of Washington 52

Bandwidth-Delay Example

  • Fiber at home, cross-country

R=40 Mbps, D=50 ms

110101000010111010101001011

slide-53
SLIDE 53

CSE 461 University of Washington 53

Bandwidth-Delay Example (2)

  • Fiber at home, cross-country

R=40 Mbps, D=50 ms BD = 40 x 106 x 50 x 10-3 bits = 2000 Kbit = 250 KB

  • That’s quite a lot of data in

the network”!

110101000010111010101001011