1 cscd 433 network programming fall 2013 lecture 5a digital line coding and other
DESCRIPTION
Summary so Far Analog Communication – Objective is to transform waveform – Varies continuously with time – Distortions unavoidable – More difficult to reproduce signal at receiver Digital Communication – Objective is to transmit a symbol – Binary is 0 or 1 – Done by transmitting positive voltage for 1, negative voltage for 0 – Receiver interprets symbol – Can handle a lot of distortion and still discern symbolTRANSCRIPT
![Page 1: 1 CSCD 433 Network Programming Fall 2013 Lecture 5a Digital Line Coding and other](https://reader036.vdocument.in/reader036/viewer/2022081517/5a4d1b717f8b9ab0599b5639/html5/thumbnails/1.jpg)
1
CSCD 433Network ProgrammingFall 2013
Lecture 5aDigital Line Coding and other ...
![Page 2: 1 CSCD 433 Network Programming Fall 2013 Lecture 5a Digital Line Coding and other](https://reader036.vdocument.in/reader036/viewer/2022081517/5a4d1b717f8b9ab0599b5639/html5/thumbnails/2.jpg)
Physical Layer Topics
• Digital transmission of digital data• Physical limits of networks for data • Encoding data onto signals
2
![Page 3: 1 CSCD 433 Network Programming Fall 2013 Lecture 5a Digital Line Coding and other](https://reader036.vdocument.in/reader036/viewer/2022081517/5a4d1b717f8b9ab0599b5639/html5/thumbnails/3.jpg)
Summary so Far Analog Communication
– Objective is to transform waveform– Varies continuously with time– Distortions unavoidable– More difficult to reproduce signal at receiver
Digital Communication– Objective is to transmit a symbol– Binary is 0 or 1– Done by transmitting positive voltage for 1,
negative voltage for 0– Receiver interprets symbol– Can handle a lot of distortion and still discern
symbol
![Page 4: 1 CSCD 433 Network Programming Fall 2013 Lecture 5a Digital Line Coding and other](https://reader036.vdocument.in/reader036/viewer/2022081517/5a4d1b717f8b9ab0599b5639/html5/thumbnails/4.jpg)
Purpose of Digital Transmission Transfer sequence of 0's and 1's from transmitter on left to receiver on right
Interested in bit rate in bits/s Can look at cross section of pipe, R Think of it as pipe diameter As R increases, volume of information flow/s
increases
0110101 0110101
d meters
Channel
transmit receive
R
![Page 5: 1 CSCD 433 Network Programming Fall 2013 Lecture 5a Digital Line Coding and other](https://reader036.vdocument.in/reader036/viewer/2022081517/5a4d1b717f8b9ab0599b5639/html5/thumbnails/5.jpg)
Summary of Analog and Digital Conversions
![Page 6: 1 CSCD 433 Network Programming Fall 2013 Lecture 5a Digital Line Coding and other](https://reader036.vdocument.in/reader036/viewer/2022081517/5a4d1b717f8b9ab0599b5639/html5/thumbnails/6.jpg)
6
Data Rate Limits
Important consideration in data communications is
How fast we can send data, in bits per second, over a channel? Also worry about errors ...
Data rate depends on three factors:1. The available bandwidth2. The number of levels used to represent
signals3. The quality of the channel (the level of noise)
![Page 7: 1 CSCD 433 Network Programming Fall 2013 Lecture 5a Digital Line Coding and other](https://reader036.vdocument.in/reader036/viewer/2022081517/5a4d1b717f8b9ab0599b5639/html5/thumbnails/7.jpg)
7
Nyquist Maximum
1924, Henry Nyquist of AT&T developed
an equation for a perfect channel with finite capacity
His equation expresses– Maximum data rate for a finite
bandwidth noiseless channel
![Page 8: 1 CSCD 433 Network Programming Fall 2013 Lecture 5a Digital Line Coding and other](https://reader036.vdocument.in/reader036/viewer/2022081517/5a4d1b717f8b9ab0599b5639/html5/thumbnails/8.jpg)
8
Fundamental Limits of Digital Transmission Quality measured by: 1. Transmission speed or bit rate 2. Bit error rate in fraction of bits received in error
![Page 9: 1 CSCD 433 Network Programming Fall 2013 Lecture 5a Digital Line Coding and other](https://reader036.vdocument.in/reader036/viewer/2022081517/5a4d1b717f8b9ab0599b5639/html5/thumbnails/9.jpg)
9
Noiseless Channel: Nyquist Bit Rate Defines theoretical maximum bit rate for
Noiseless Channel: Bit Rate = 2 X Bandwidth X log2 L L = number of signal levels
![Page 10: 1 CSCD 433 Network Programming Fall 2013 Lecture 5a Digital Line Coding and other](https://reader036.vdocument.in/reader036/viewer/2022081517/5a4d1b717f8b9ab0599b5639/html5/thumbnails/10.jpg)
10
ExampleExample
Have a noiseless channel Bandwidth of 3000 Hz transmitting a signal with two signal levelsThe maximum bit rate can be calculated as
Bit Rate = 2 Bit Rate = 2 3000 3000 log log22 2 = 6000 bps 2 = 6000 bps
![Page 11: 1 CSCD 433 Network Programming Fall 2013 Lecture 5a Digital Line Coding and other](https://reader036.vdocument.in/reader036/viewer/2022081517/5a4d1b717f8b9ab0599b5639/html5/thumbnails/11.jpg)
11
Example Example
Consider the same noiseless channelTransmitting a signal with four signal levels
– For each level, we send two bitsThe maximum bit rate can be calculated as: Bit Rate = 2 x 3000 x logBit Rate = 2 x 3000 x log22 4 = 12,000 bps 4 = 12,000 bps
![Page 12: 1 CSCD 433 Network Programming Fall 2013 Lecture 5a Digital Line Coding and other](https://reader036.vdocument.in/reader036/viewer/2022081517/5a4d1b717f8b9ab0599b5639/html5/thumbnails/12.jpg)
12
Increasing the levels of a signal may reduce the reliability of the system
Note
![Page 13: 1 CSCD 433 Network Programming Fall 2013 Lecture 5a Digital Line Coding and other](https://reader036.vdocument.in/reader036/viewer/2022081517/5a4d1b717f8b9ab0599b5639/html5/thumbnails/13.jpg)
13
Capacity of a SystemThe bit rate of a system increases with an increase in the number of signal levels we use to denote a symbol.A symbol can consist of a single bit or “n” bits.The number of signal levels = 2n.As the number of levels goes up, the spacing between level decreases -> increasing the probability of an error occurring in the presence of transmission impairments.
![Page 14: 1 CSCD 433 Network Programming Fall 2013 Lecture 5a Digital Line Coding and other](https://reader036.vdocument.in/reader036/viewer/2022081517/5a4d1b717f8b9ab0599b5639/html5/thumbnails/14.jpg)
14
Increasing Levels In theory, can increase the bit rate by
increasing the number of levels Yet, random noise limits the bit rate in
practice Noise causes measurement system to
make mistakes
![Page 15: 1 CSCD 433 Network Programming Fall 2013 Lecture 5a Digital Line Coding and other](https://reader036.vdocument.in/reader036/viewer/2022081517/5a4d1b717f8b9ab0599b5639/html5/thumbnails/15.jpg)
15
What is Communication Channel Noise Noise
Interference from sources like radio waves
Electrical wires, and Bad connections that alter the data
Distortion Alteration in signal caused by
communication channel itself Noise generated by components is
categorized as thermal noise Also known as additive noise.
![Page 16: 1 CSCD 433 Network Programming Fall 2013 Lecture 5a Digital Line Coding and other](https://reader036.vdocument.in/reader036/viewer/2022081517/5a4d1b717f8b9ab0599b5639/html5/thumbnails/16.jpg)
16
Claude ShannonNoisy Channel
Claude Shannon developed mathematical theory in the 1940's for noisy channels
Then, defined the amount of information that a message could carry
This allowed networks to plan for capacity of information
![Page 17: 1 CSCD 433 Network Programming Fall 2013 Lecture 5a Digital Line Coding and other](https://reader036.vdocument.in/reader036/viewer/2022081517/5a4d1b717f8b9ab0599b5639/html5/thumbnails/17.jpg)
17
Noisy Channel: Shannon Capacity
Defines theoretical maximum bit rate for Noisy Channel:
Capacity=Bandwidth X log2(1+SNR)
![Page 18: 1 CSCD 433 Network Programming Fall 2013 Lecture 5a Digital Line Coding and other](https://reader036.vdocument.in/reader036/viewer/2022081517/5a4d1b717f8b9ab0599b5639/html5/thumbnails/18.jpg)
18
ExampleExample
Consider an extremely noisy channel in which the value of the signal-to-noise ratio is almost zeroIn other words, the noise is so strong that the signal is faint For this channel the capacity is calculated as
C = B logC = B log22 (1 + SNR) = B log (1 + SNR) = B log22 (1 + 0) (1 + 0)
= B log= B log22 (1) = B (1) = B 0 = 0 0 = 0
![Page 19: 1 CSCD 433 Network Programming Fall 2013 Lecture 5a Digital Line Coding and other](https://reader036.vdocument.in/reader036/viewer/2022081517/5a4d1b717f8b9ab0599b5639/html5/thumbnails/19.jpg)
19
Result = B logResult = B log22 (1) = B (1) = B 0 = 0 0 = 0This means that the capacity of this channel is zero regardless of the bandwidth
In other words, we cannot receive any data through this channel !!!
![Page 20: 1 CSCD 433 Network Programming Fall 2013 Lecture 5a Digital Line Coding and other](https://reader036.vdocument.in/reader036/viewer/2022081517/5a4d1b717f8b9ab0599b5639/html5/thumbnails/20.jpg)
20
ExampleExample
We can calculate the theoretical highest bit rate of a regular telephone lineA telephone line normally has a bandwidth of 3000 bpsThe signal-to-noise ratio is usually 3162For this channel the capacity is calculated as
C = B logC = B log22 (1 + SNR) = 3000 log (1 + SNR) = 3000 log22 (1 + 3162) (1 + 3162) = 3000 log= 3000 log22 (3163) (3163)
C = 3000 C = 3000 11.62 = 34,860 bps 11.62 = 34,860 bps
![Page 21: 1 CSCD 433 Network Programming Fall 2013 Lecture 5a Digital Line Coding and other](https://reader036.vdocument.in/reader036/viewer/2022081517/5a4d1b717f8b9ab0599b5639/html5/thumbnails/21.jpg)
21
Example continued Result C = 3000 C = 3000 11.62 = 34,860 bps 11.62 = 34,860 bps
This means that the highest bit rate for a telephone line is 34.860 kbps
If we want to send data faster than this, we can either increase the bandwidth of the line or improve the signal-to-noise ratio.
![Page 22: 1 CSCD 433 Network Programming Fall 2013 Lecture 5a Digital Line Coding and other](https://reader036.vdocument.in/reader036/viewer/2022081517/5a4d1b717f8b9ab0599b5639/html5/thumbnails/22.jpg)
22
ExampleExampleWe have a channel with a 1 MHz bandwidthThe SNR for this channel is 63, What is the appropriate bit rate and signal level?
SolutionSolution
C = B logC = B log22 (1 + SNR) = 10 (1 + SNR) = 1066 log log22 (1 + 63) = 10 (1 + 63) = 1066 log log22 (64) = 6 Mbps (64) = 6 Mbps
Then we use the Nyquist formula to find the number of signal levels.
6 Mbps = 2 6 Mbps = 2 1 MHz 1 MHz log log22 L L L = 8 L = 8
First, we use the Shannon formula to find our upper limit
![Page 23: 1 CSCD 433 Network Programming Fall 2013 Lecture 5a Digital Line Coding and other](https://reader036.vdocument.in/reader036/viewer/2022081517/5a4d1b717f8b9ab0599b5639/html5/thumbnails/23.jpg)
23
The Shannon capacity gives us the upper limit; the Nyquist formula tells us
how many signal levels we need.
Note
![Page 24: 1 CSCD 433 Network Programming Fall 2013 Lecture 5a Digital Line Coding and other](https://reader036.vdocument.in/reader036/viewer/2022081517/5a4d1b717f8b9ab0599b5639/html5/thumbnails/24.jpg)
24
Digital Line Coding
![Page 25: 1 CSCD 433 Network Programming Fall 2013 Lecture 5a Digital Line Coding and other](https://reader036.vdocument.in/reader036/viewer/2022081517/5a4d1b717f8b9ab0599b5639/html5/thumbnails/25.jpg)
25
Digital Line Coding Method for converting digital binary
information sequence into digital signal Selecting coding technique involves several
considerations Previously we said ...
– Wanted to maximize bit rate over channels with limited bandwidth
Yet, LAN's have other concerns– Ease of bit timing recovery from signal – So, receiving sample clock can maintain its
synchronization with transmitting clock– Some methods better at noise and interference
![Page 26: 1 CSCD 433 Network Programming Fall 2013 Lecture 5a Digital Line Coding and other](https://reader036.vdocument.in/reader036/viewer/2022081517/5a4d1b717f8b9ab0599b5639/html5/thumbnails/26.jpg)
26
Line Coding Schemes
Unipolar: Uses one voltage level Polar: Uses two voltage levels Bipolar: Uses three or more voltage levels
![Page 27: 1 CSCD 433 Network Programming Fall 2013 Lecture 5a Digital Line Coding and other](https://reader036.vdocument.in/reader036/viewer/2022081517/5a4d1b717f8b9ab0599b5639/html5/thumbnails/27.jpg)
27
In unipolar encoding, we use only one voltage level, positive
Note
![Page 28: 1 CSCD 433 Network Programming Fall 2013 Lecture 5a Digital Line Coding and other](https://reader036.vdocument.in/reader036/viewer/2022081517/5a4d1b717f8b9ab0599b5639/html5/thumbnails/28.jpg)
28
Unipolar Encoding
![Page 29: 1 CSCD 433 Network Programming Fall 2013 Lecture 5a Digital Line Coding and other](https://reader036.vdocument.in/reader036/viewer/2022081517/5a4d1b717f8b9ab0599b5639/html5/thumbnails/29.jpg)
29
In polar encoding, we use two voltage levels: positive & negative
Note
![Page 30: 1 CSCD 433 Network Programming Fall 2013 Lecture 5a Digital Line Coding and other](https://reader036.vdocument.in/reader036/viewer/2022081517/5a4d1b717f8b9ab0599b5639/html5/thumbnails/30.jpg)
30
Polar: NRZ-L and NRZ-I Encoding
![Page 31: 1 CSCD 433 Network Programming Fall 2013 Lecture 5a Digital Line Coding and other](https://reader036.vdocument.in/reader036/viewer/2022081517/5a4d1b717f8b9ab0599b5639/html5/thumbnails/31.jpg)
31
In NRZ-L, level of voltage determines value of the bit
In NRZ-I, inversion or lack of inversion determines value of the bit
Note
![Page 32: 1 CSCD 433 Network Programming Fall 2013 Lecture 5a Digital Line Coding and other](https://reader036.vdocument.in/reader036/viewer/2022081517/5a4d1b717f8b9ab0599b5639/html5/thumbnails/32.jpg)
32
Polar: RZ Encoding
![Page 33: 1 CSCD 433 Network Programming Fall 2013 Lecture 5a Digital Line Coding and other](https://reader036.vdocument.in/reader036/viewer/2022081517/5a4d1b717f8b9ab0599b5639/html5/thumbnails/33.jpg)
33
Polar: Manchester Encoding
![Page 34: 1 CSCD 433 Network Programming Fall 2013 Lecture 5a Digital Line Coding and other](https://reader036.vdocument.in/reader036/viewer/2022081517/5a4d1b717f8b9ab0599b5639/html5/thumbnails/34.jpg)
34
In Manchester and differential Manchester encoding, the transition
at the middle of the bit is used for synchronization.
Note
![Page 35: 1 CSCD 433 Network Programming Fall 2013 Lecture 5a Digital Line Coding and other](https://reader036.vdocument.in/reader036/viewer/2022081517/5a4d1b717f8b9ab0599b5639/html5/thumbnails/35.jpg)
35
Reception ErrorsTiming mismatch between sending and receiving computers
![Page 36: 1 CSCD 433 Network Programming Fall 2013 Lecture 5a Digital Line Coding and other](https://reader036.vdocument.in/reader036/viewer/2022081517/5a4d1b717f8b9ab0599b5639/html5/thumbnails/36.jpg)
36
In bipolar encoding, we use three levels: positive, zero, and negative.
Note
![Page 37: 1 CSCD 433 Network Programming Fall 2013 Lecture 5a Digital Line Coding and other](https://reader036.vdocument.in/reader036/viewer/2022081517/5a4d1b717f8b9ab0599b5639/html5/thumbnails/37.jpg)
37
Bipolar: AMI (Alternative Mark Inversion) Encoding
![Page 38: 1 CSCD 433 Network Programming Fall 2013 Lecture 5a Digital Line Coding and other](https://reader036.vdocument.in/reader036/viewer/2022081517/5a4d1b717f8b9ab0599b5639/html5/thumbnails/38.jpg)
38
Summary
![Page 39: 1 CSCD 433 Network Programming Fall 2013 Lecture 5a Digital Line Coding and other](https://reader036.vdocument.in/reader036/viewer/2022081517/5a4d1b717f8b9ab0599b5639/html5/thumbnails/39.jpg)
Summary• Looked at digital data over digital
channels• Theoretical maximum limits of
transmitting bits in presence of noise and without
• Line encoding makes it possible to send more data as efficiency of coding increases
![Page 40: 1 CSCD 433 Network Programming Fall 2013 Lecture 5a Digital Line Coding and other](https://reader036.vdocument.in/reader036/viewer/2022081517/5a4d1b717f8b9ab0599b5639/html5/thumbnails/40.jpg)
40
• New Assignment is up !!!