Data Communication Networks

Lecture: 3
Instructor: Naveed Akram
APCOMS
Spring 2012
ANALOG / DIGITAL SIGNALS
To be transmitted, data must be transformed to
electromagnetic signals.

Signal

Analog Digital
PERIODIC / APERIODIC SIGNALS
Periodic signals
Repetition of a fixed pattern after a time
period T
Simple: cannot be decomposed into simpler
sine waves e.g. sin(2ft)
Composite: combination of multiple
sinusoidal tones
Aperiodic signals
No fixed repetition pattern
The time-domain and frequency-
domain plots of a sine wave
Freq Domain Representation
The frequency domain is more compact
and useful when we are dealing with
more than one sine wave.
Composite Signals
A single-frequency sine wave is not useful in
data communications;
Composite signals required
Fourier analysis: any composite signal is a
combination of multiple simple sine waves
DIGITAL SIGNALS

Number of biter per symbol/level = log2L

Where L is the number of symbols/levels
Example
Assume we need to down load text documents at
the rate of 100 pages per second. What is the
required bit rate of the channel?
Solution
A page is an average of 24 lines with 80
characters in each line. If we assume that one
character requires 8 bits, the bit rate is
Example:
A digitized voice channel, is made by digitizing a
4-kHz band width analog voice signal. We need to
sample the signal at twice the highest
frequency(two samples per hertz). We assume
that each sample requires 8 bits.
What is the required bit rate?
Solution
The bit rate can be calculated as:
TRANSMISSION IMPAIRMENT
ATTENUATION
DISTORTION
NOISE

Signal to Noise Ratio(SNR)= Average Signal Power /

Average Noise Power
SNRdB= 10log10SNR
DATA RATE LIMITS
WHY DO YOU THINK IT IS IMPORTANT TO
KNOW THE DATA RATE LIMITS OF A
SYSTEM?
1. KNOW THE PERFORMANCE LIMITS OF THE SYSTEM
2. COMPARE AND CONTRAST DIFFERENT
SYSTEMS/TECHNIQUES/PROTOCOLS IN TERMS OF
PERFORMANCE
Data rate depends on three factors:
The band width available
The level of the signals we use
The quality of the channel (the level of noise)
FUNDAMENTAL PERFORMANCE LIMIT
SHANNON LIMIT (Noisy Channel):
Capacity=Blog2(1+SNR)
NYQUIST LIMIT (Noiseless Channel):
Bit rate = 2 * bandwidth * log2L
Example :
Consider a noise less channel with a band width of 3000Hz
transmitting a signal with two signal levels. The maximum bit rate
can be calculated as
Example:
We need to send 265 kbps over a noiseless channel with a bandwidth of
20 kHz. How many signal levels do we need?
Solution
We can use the Nyquist formula as shown:

Since this result is not a power of 2, we need to either

increase the number of levels or reduce the bit rate. If we
have 128 levels, the bit rate is 280 kbps. If we have 64 levels,
the bit rate is 140 kbps.
PERFORMANCE METRICS
Bandwidth - Hz range of frequencies
that the channel can pass
- bps speed of bits on a link

Throughput How fast can we actually

send the bits!
PERFORMANCE METRICS
Latency (Delay)
The latency (delay) defines how long it takes for an
entire message to completely arrive at the destination
from the time the first bit is sent out from the source.
Latency = propagation time +
transmission time + queuing time +
processing delay
LATENCY
PROPAGATION
The time required for a bit to travel from the source to the
destination
Propagation time = Distance/Propagation Speed

TRANSMISSION TIME
The time to take the first bit leaving the sender and the
last bit arriving at the receiver
Transmission time=Message Size/Bandwidth
LATENCY
QUEUING TIME
The time to take for each in termediate or end devices to
hold the message before it can be processed

PROCESSING DELAY
BANDWIDTH-DELAY PRODUCT
The bandwidth-delay product defines the
number of bits that can fill the link
Thank You