+ All Categories
Home > Documents > CSCD 433 Network Programming Fall 2012

CSCD 433 Network Programming Fall 2012

Date post: 15-Mar-2016
Category:
Upload: dawn-bryan
View: 31 times
Download: 0 times
Share this document with a friend
Description:
CSCD 433 Network Programming Fall 2012. Lecture 4a Physical Layer Line Coding. 1. Physical Layer Topics. Physical limits of networks for data Encoding data onto signals. 2. Physical Layer . Looked at physical media for networks Many types of wired and wireless connections - PowerPoint PPT Presentation
Popular Tags:
30
1 CSCD 433 Network Programming Fall 2012 Lecture 4a Physical Layer Line Coding
Transcript
Page 1: CSCD 433 Network Programming Fall 2012

1

CSCD 433Network ProgrammingFall 2012

Lecture 4aPhysical Layer Line Coding

Page 2: CSCD 433 Network Programming Fall 2012

Physical Layer Topics

• Physical limits of networks for data • Encoding data onto signals

2

Page 3: CSCD 433 Network Programming Fall 2012

Physical Layer

Looked at physical media for networks Many types of wired and wireless connections All have different capacities and purposes with

regards to network creation Next, look at some theoretical limits of networks,

encoding schemes for digital modulation and several multiplexing methods

Page 4: CSCD 433 Network Programming Fall 2012

4

Data Rate Limits

Important consideration in data communications is

How fast we can send data, in bits per second, over a channel?

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 5: CSCD 433 Network Programming Fall 2012

5

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 6: CSCD 433 Network Programming Fall 2012

6

Noiseless Channel: Nyquist Bit Rate

Defines theoretical maximum bit rate for Noiseless Channel:

Bit Rate=2 X Bandwidth X log2L L = number of signal levels

Page 7: CSCD 433 Network Programming Fall 2012

7

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 8: CSCD 433 Network Programming Fall 2012

8

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 9: CSCD 433 Network Programming Fall 2012

9

Increasing the levels of a signal may reduce the reliability of the system

Note

Page 10: CSCD 433 Network Programming Fall 2012

10

Claude ShannonNoisy Channel

Claude Shannon developed mathematical theory in the 1940's for noisy channels

He used Entropy in his equation, which is the amount of randomness for a channel

Then, defined the amount of information that a message could carry

This allowed networks to plan for capacity of information

Page 11: CSCD 433 Network Programming Fall 2012

11

Noisy Channel: Shannon Capacity Defines theoretical maximum bit rate for

Noisy Channel:

Capacity=Bandwidth X log2(1+SNR)

Page 12: CSCD 433 Network Programming Fall 2012

12

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 13: CSCD 433 Network Programming Fall 2012

13

ExampleExample

We can calculate the theoretical highest bit rate of a regular telephone lineA telephone line normally has a bandwidth of 4KHzThe 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 14: CSCD 433 Network Programming Fall 2012

14

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 15: CSCD 433 Network Programming Fall 2012

15

Digital Modulation

Page 16: CSCD 433 Network Programming Fall 2012

16

Digital Modulation Process of converting between bits and

signals is called digital modulation Convert voltages into bits

Mostly for wired media Other schemes regulate the phase or

frequency of a carrier signal Mostly for wireless media

Page 17: CSCD 433 Network Programming Fall 2012

17

Line Coding Schemes

Page 18: CSCD 433 Network Programming Fall 2012

18

In unipolar encoding, we use only one voltage level, positive

Note

Page 19: CSCD 433 Network Programming Fall 2012

19

Unipolar Encoding

Page 20: CSCD 433 Network Programming Fall 2012

20

In polar encoding, we use two voltage levels: positive & negative

Note

Page 21: CSCD 433 Network Programming Fall 2012

21

Polar: NRZ-L and NRZ-I Encoding

Page 22: CSCD 433 Network Programming Fall 2012

22

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 23: CSCD 433 Network Programming Fall 2012

23

Polar: RZ Encoding

Page 24: CSCD 433 Network Programming Fall 2012

24

Polar: Manchester Encoding

Page 25: CSCD 433 Network Programming Fall 2012

25

In Manchester and differential Manchester encoding, the transition

at the middle of the bit is used for synchronization.

Note

Page 26: CSCD 433 Network Programming Fall 2012

26

In bipolar encoding, we use three levels: positive, zero, and negative.

Note

Page 27: CSCD 433 Network Programming Fall 2012

27

Bipolar: AMI (Alternative Mark Inversion) Encoding

Page 28: CSCD 433 Network Programming Fall 2012

28

Summary

Page 29: CSCD 433 Network Programming Fall 2012

Summary

• Many types of encoding for sending data over analog types of lines

• Multiplexing allows sharing – More on this later ….

• There are actually limits to how much data can be sent within a network

Page 30: CSCD 433 Network Programming Fall 2012

30

• No new assignment yet ...


Recommended