CSCI-1680 Physical Layer Based partly on lecture notes by David Mazières, Phil Levis, John Jannotti Rodrigo Fonseca.

Slides:



Advertisements
Similar presentations
Physical Layer: Signals, Capacity, and Coding
Advertisements

CSCI-1680 Physical Layer Link Layer I Based partly on lecture notes by David Mazières, Phil Levis, John Jannotti Rodrigo Fonseca.
1 Chapter 2 Agenda Announcements / updates Gayle Laakman McDowell, 10/11, 4:30pm, UW2-005 GUIs / IDEs for remotely accessing uw1-320-lab Other references.
Lecture 3, 1Spring 2003, COM1337/3501CCN: Direct Link Networks Direct Link Networks Textbook: Computer Networks: A Systems Approach, L. Peterson, B. Davie,
Chapter 2 Fundamentals of Data and Signals
EE 4272Spring, 2003 Chapter 5 Data Encoding Data Transmission Digital data, digital signal Analog data, digital signal: e.g., voice, and video are often.
Spring 2002CS 4611 Outline Encoding Framing Error Detection Sliding Window Algorithm Point-to-Point Links.
William Stallings Data and Computer Communications 7th Edition
Fundamentals of Computer Networks ECE 478/578 Lecture #3: Encoding and Framing Instructor: Loukas Lazos Dept of Electrical and Computer Engineering University.
1 Physical Layer: Data Encoding & Transmission. 2 Network Interface Card (NIC) LL in part, PL in total are implemented in NIC –Ethernet card, card,
1 Outline Encoding Framing Error Detection Sliding Window Algorithm Point-to-Point Links.
Spring 2004 EE4272 Direct Link Networks (I) Hardware Building Blocks (nodes & links) 5 Issues before Exchanging Packets  Encoding  Framing  Error Detection.
Signal Encoding Lesson 05 NETS2150/2850
Spring 2003CS 4611 Outline Encoding Framing Error Detection Sliding Window Algorithm Point-to-Point Links.
CS 164: Slide Set 3: Chapter 2 Direct Link Networks.
Framing and Encoding EECS 122: Lecture 26 Department of Electrical Engineering and Computer Sciences University of California Berkeley.
Katz, Stoica F04 EE122: Encoding & Framing November 17, 2003.
Analog and Digital Transmission Interfaces and Multiplexing (Physical Layer) Lita Lidyawati 2012.
331: STUDY DATA COMMUNICATIONS AND NETWORKS.  1. Discuss computer networks (5 hrs)  2. Discuss data communications (15 hrs)
1 Physical Layer. 2 Analog vs. Digital  Analog: continuous values over time  Digital: discrete values with sharp change over time.
Review: The application layer. –Network Applications see the network as the abstract provided by the transport layer: Logical full mesh among network end-points.
Lecture 3: Hardware and physical links Chap 1.4, 2 of [PD]
CS 640: Introduction to Computer Networks Aditya Akella Lecture 5 - Encoding and Data Link Basics.
EE 122: Encoding And Framing Ion Stoica September 9, 2002.
ECE 4450:427/527 - Computer Networks Spring 2015
CSCI-1680 Physical Layer Based partly on lecture notes by David Mazières, Phil Levis, John Jannotti Rodrigo Fonseca.
Data Communications Chapter 5 Data Encoding.
CSE331: Introduction to Networks and Security Lecture 3 Fall 2002.
Computer Communication & Networks Lecture # 05 Physical Layer: Signals & Digital Transmission Nadeem Majeed Choudhary
CHAPTER 2 HARDWARE BUILDING BLOCK ENCODING FRAMING ERROR DETECTION.
Advanced Computer Networks Chapter 2: Direct Link Networks.
Lecture 6: Framing and Error Detection-Data Link Layer Functions
27-Oct-15Computer Networks1 Outline Chapter 2: Direct Link Networks Encoding Framing Error Detection Sliding Window Algorithm Point-to-Point Links.
CSE 461: Bits and Bandwidth Next Topic  Focus: How do we send a message across a wire?  The physical / link layers: 1. Different kinds of media 2.
3-2008UP-Copyrights reserved1 ITGD4103 Data Communications and Networks Lecture-11:Data encoding techniques week 12- q-2/ 2008 Dr. Anwar Mousa University.
British Computer Society (BCS)
Physical and Link Layers Brad Karp UCL Computer Science CS 6007/GC15/GA07 23 rd February, 2009.
Fall 2000Datacom 11 Outline Hardware Building Blocks Encoding Framing Error Detection Sliding Window Algorithm Point-to-Point Links.
1 CHAPTER 2 HARDWARE BUILDING BLOCK ENCODING FRAMING ERROR DETECTION.
Link Layer Dr. Mozafar Bag-Mohammadi Ilam University.
ECE 4710: Lecture #13 1 Bit Synchronization  Synchronization signals are clock-like signals necessary in Rx (or repeater) for detection (or regeneration)
Spring 2001CS 5851 Outline Building Blocks Shannon’s Theorem Encoding 11. Physical Layer.
Prof. Hosny Ibrahim Lecture 5. Data Communication IT 221 By: Prof. Hosny M. Ibrahim 2.
9-Jan-164/598N: Computer Networks Overview Performance metrics - Section 1.5 Direct link networks –Hardware building blocks - Section 2.1 –Encoding - Section.
Physical Layer Issues and Methods Outline Physical Layer Overview Non-Return to Zero Manchester 4B/5B.
Line Coding and Binary Keying Modulation
Point-to-Point Links: Framing
T. S. Eugene Ngeugeneng at cs.rice.edu Rice University1 COMP/ELEC 429 Introduction to Computer Networks Lecture 6: Datalink layer problems Slides used.
1 CSCD 433 Network Programming Fall 2013 Lecture 5a Digital Line Coding and other...
Physical Layer Issues and Methods Outline Physical Layer Ethernet Technology Physical Layer Encoding Final Exam Review - ??
1 Chapter 2: Direct Link Networks (Part One) Dr. Rocky K. C. Chang 30 January 2004.
1 Point-to-Point Links: Encoding Encoding: Section 2.2 (Section 2.1 read on your own)
Signal Encoding Techniques. Digital Data, Digital Signal  Digital signal discrete, discontinuous voltage pulses discrete, discontinuous voltage pulses.
Lect-10-2: Physical Layer Computer Networks : An Introduction to Computer Networks Handout #12: Physical Layer Signaling, Coding and Clocking.
CSE 320 Data Communications
1 CSCD 433 Network Programming Fall 2016 Lecture 4 Digital Line Coding and other...
Data Encoding Data Encoding refers the various techniques of impressing data (0,1) or information on an electrical, electromagnetic or optical signal that.
Getting Connected (Chapter 2 Part 1)
Data Link Networks Hardware Building Blocks Nodes & Links CS380
Advanced Computer Networks
CSCI-1680 Physical Layer Link Layer I
Data Encoding Data Encoding refers the various techniques of impressing data (0,1) or information on an electrical, electromagnetic or optical signal that.
Point-to-Point Links Outline Encoding Framing Error Detection
Ion Stoica September 6, 2001 EE 122: Lecture 4 Ion Stoica September 6, 2001.
Fundamentals of Computer Networks
Hardware Building Blocks
CSCI-1680 Physical Layer Link Layer I
Dr. Mozafar Bag-Mohammadi Ilam University
Home work project #1 Develop and fully debug your program on the Cushing 208 lab. Machines - planet lab machines may not have good development environment.
EECS 122: EE122: Error Detection and Reliable Transmission
Presentation transcript:

CSCI-1680 Physical Layer Based partly on lecture notes by David Mazières, Phil Levis, John Jannotti Rodrigo Fonseca

Administrivia Signup for Snowcast milestone –Make sure you signed up Return signed policy sheet –So we can grade you

Today Physical Layer –Modulation and Channel Capacity –Encoding Link Layer I –Framing

Physical Layer (Layer 1) Responsible for specifying the physical medium –Type of cable, fiber, wireless frequency Responsible for specifying the signal (modulation) –Transmitter varies something (amplitude, frequency, phase) –Receiver samples, recovers signal Responsible for specifying the bits (encoding) –Bits above physical layer -> chips

Modulation Specifies mapping between digital signal and some variation in analog signal Why not just a square wave (1v=1; 0v=0)? –Not square when bandwidth limited Bandwidth – frequencies that a channel propagates well –Signals consist of many frequency components –Attenuation and delay frequency-dependent

Use Carriers Idea: only use frequencies that transmit well Modulate the signal to encode bits OOK: On-Off Keying ASK: Amplitude Shift Keying

Use Carriers Idea: only use frequencies that transmit well Modulate the signal to encode bits FSK: Frequency Shift Keying PSK : Phase Shift Keying

How Fast Can You Send? Encode information in some varying characteristic of the signal. If B is the maximum frequency of the signal C = 2B bits/s (Nyquist, 1928)

Can we do better? So we can only change 2B/second, what if we encode more bits per sample? –Baud is the frequency of changes to the physical channel –Not the same thing as bits! Suppose channel passes 1KHz to 2KHz –1 bit per sample: alternate between 1KHz and 2KHz –2 bits per sample: send one of 1, 1.33, 1.66, or 2KHz –Or send at different amplitudes: A/4, A/2, 3A/4, A –n bits: choose among 2 n frequencies! What is the capacity if you can distinguish M levels?

Example Phase Amplitude

Hartley’s Law C = 2B log 2 (M) bits/s Great. By increasing M, we can have as large a capacity as we want! Or can we?

The channel is noisy!

Noise prevents you from increasing M arbitrarily! This depends on the signal/noise ratio (S/N) Shannon: C = B log 2 (1 + S/N) –C is the channel capacity in bits/second –B is the bandwidth of the channel in Hz –S and N are average signal and noise power –Signal-to-noise ratio is measured in dB = 10log 10 (S/N) The channel is noisy!

Putting it all together Noise limits M! 2B log 2 (M) ≤ B log 2 (1 + S/N) M ≤ √1+S/N Example: Telephone Line –3KHz b/w, 30dB S/N = 10ˆ(30/10) = 1000 –C = 3KHz log 2 (1001) ≈ 30Kbps

Encoding Now assume that we can somehow modulate a signal: receiver can decode our binary stream How do we encode binary data onto signals? One approach: 1 as high, 0 as low! –Called Non-return to Zero (NRZ) NRZ (non-return to zero) Clock

Drawbacks of NRZ No signal could be interpreted as 0 (or vice- versa) Consecutive 1s or 0s are problematic Baseline wander problem –How do you set the threshold? –Could compare to average, but average may drift Clock recovery problem –For long runs of no change, could miscount periods

Alternative Encodings Non-return to Zero Inverted (NRZI) –Encode 1 with transition from current signal –Encode 0 by staying at the same level –At least solve problem of consecutive 1s Clock NRZI (non-return to zero intverted)

Manchester Map 0  chips 01; 1  chips 10 –Transmission rate now 1 bit per two clock cycles Solves clock recovery, baseline wander But cuts transmission rate in half Clock Manchester

4B/5B Can we have a more efficient encoding? Every 4 bits encoded as 5 chips Need 16 5-bit codes: –selected to have no more than one leading 0 and no more than two trailing 0s –Never get more than 3 consecutive 0s Transmit chips using NRZI Other codes used for other purposes –E.g., 11111: line idle; 00100: halt Achieves 80% efficiency

Encoding Goals DC Balancing (same number of 0 and 1 chips) Clock synchronization Can recover some chip errors Constrain analog signal patterns to make signal more robust Want near channel capacity with negligible errors –Shannon says it’s possible, doesn’t tell us how –Codes can get computationally expensive In practice –More complex encoding: fewer bps, more robust –Less complex encoding: more bps, less robust

Last Example: Standard for low-power, low-rate wireless PANs –Must tolerate high chip error rates Uses a 4B/32B bit-to-chip encoding

Questions so far? Photo: Lewis Hine

Framing Given a stream of bits, how can we represent boundaries? Break sequence of bits into a frame Typically done by network adaptor

Representing Boundaries Sentinels Length counts Clock-based

Sentinel-based Framing Byte-oriented protocols (e.g. BISYNC, PPP) –Place special bytes (SOH, ETX,…) in the beginning, end of messages What if ETX appears in the body? –Escape ETX byte by prefixing DEL byte –Escape DEL byte by prefixing DEL byte –Technique known as character stuffing

Bit-Oriented Protocols View message as a stream of bits, not bytes Can use sentinel approach as well (e.g., HDLC) –HDLC begin/end sequence Use bit stuffing to escape –Always append 0 after five consecutive 1s in data –After five 1s, receiver uses next two bits to decide if stuffed, end of frame, or error.

Length-based Framing Drawback of sentinel techniques –Length of frame depends on data Alternative: put length in header (e.g., DDCMP) Danger: Framing Errors –What if high bit of counter gets corrupted? –Adds 8K to length of frame, may lose many frames –CRC checksum helps detect error

Clock-based Framing E.g., SONET (Synchronous Optical Network) –Each frame is 125μs long –Look for header every 125μs –Encode with NRZ, but XOR payload with 127-bit string to ensure lots of transitions

Error Detection Basic idea: use a checksum –Compute small checksum value, like a hash of packet Good checksum algorithms –Want several properties, e.g., detect any single-bit error –Details in a later lecture

Coming Up Next week: more link layer –Flow Control and Reliability –Ethernet –Sharing access to a shared medium –Switching Friday 10 th : Snowcast due