Scribd
Upload
74 views26 pages

Slide On Data Rate

Here are the key steps to solve this problem: 1) Given: Bandwidth (B) = 4.5 kHz, Desired data rate (C) = 120 Kbps 2) Use Shannon capacity formula to find minimum required SNR: C = B log2(1 + SNR) 120,000 = 4500 log2(1 + SNR) SNR = 15.96 3) Convert SNR to dB: SNRdB = 10log10(15.96) = 12 dB 4) Use Nyquist formula to find number of levels: L = 2^(C/2B) L = 2^(120,000/9000) = 16 So

Uploaded by

Md. Khaled Bin Halim 173-33-4276
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
74 views26 pages

Slide On Data Rate

Here are the key steps to solve this problem: 1) Given: Bandwidth (B) = 4.5 kHz, Desired data rate (C) = 120 Kbps 2) Use Shannon capacity formula to find minimum required SNR: C = B log2(1 + SNR) 120,000 = 4500 log2(1 + SNR) SNR = 15.96 3) Convert SNR to dB: SNRdB = 10log10(15.96) = 12 dB 4) Use Nyquist formula to find number of levels: L = 2^(C/2B) L = 2^(120,000/9000) = 16 So

Uploaded by

Md. Khaled Bin Halim 173-33-4276
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 26

DATA RATE

Prepared by

Nusrat Chowdhury

Lecturer, Department of EEE


Lecture Contents

 Noiseless Channel: Nyquist Bit Rate

 Noisy Channel: Shannon Capacity

 Using Both Limits


DATA RATE LIMITS

A very 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 bandwidth available
2. The level of the signals we use
3. The quality of the channel (the level of noise)
Nyquist Theorem

 Nyquist gives the upper bound for the bit rate of a


transmission system by calculating the bit rate
directly from the number of bits in a symbol (or
signal levels) and the bandwidth of the system
(assuming 2 symbols/per cycle and first
harmonic).
 Nyquist theorem states that for a noiseless

channel:
C = 2 B log22n = 2 B log2L
C= capacity in bps
B = bandwidth in Hz
Example 3.34

Consider a noiseless channel with a bandwidth of 3000


Hz transmitting a signal with two signal levels (for each
level, we send 1 bits). Calculate the maximum bit rate.

We know for noiseless channel , Channel capacity or bit rate should be calculated using the

formula below:
Example 3.36

We need to send 265 kbps over a noiseless channel with


a bandwidth of 20 kHz. How many signal levels do we
need? Comment on your answer.
Solution
We can use the Nyquist formula as shown:

L=2^(C/2B)

This is not a valid number. So possible values of n= 6 or 7

If n=6 then L=64, and C= 240 kbps

and if n=7 then L=128, C= 280kbps


Shannon’s Theorem

 Shannon’s theorem gives the capacity of a


system in the presence of noise.

C = B log2(1 + SNR)
Example 3.38

We can calculate the theoretical highest bit rate of a


regular telephone line. A telephone line normally has a
bandwidth of 3000. The signal-to-noise ratio is usually
3162. For this channel calculate the channel capacity.

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.
Example 3.39

The signal-to-noise ratio is often given in decibels.


Assume that SNRdB = 36 and the channel bandwidth is 2
MHz. Calculate the channel capacity.
Example 3.37

Consider an extremely noisy channel in which the value


of the signal-to-noise ratio is almost zero. In other
words, the noise is so strong that the signal is faint. For
this channel the calculate the capacity.

This means that the capacity of this channel is zero


regardless of the bandwidth. In other words, we cannot
receive any data through this channel.
Example 3.40

For practical purposes, when the SNR is very high, we


can assume that SNR + 1 is almost the same as SNR. In
these cases, the theoretical channel capacity can be
simplified to

For example, we can calculate the theoretical capacity of


the previous example as
Example 3.41

We have a channel with a 1-MHz bandwidth. The SNR


for this channel is 63. What are the appropriate bit rate
and signal level?

Solution
First, we use the Shannon formula to find the upper
limit.

L=2^(C/2B)
Example 3.41 (continued)

The Shannon formula gives us 6 Mbps, the upper limit.


For better performance we choose something lower, 4
Mbps, for example. Then we use the Nyquist formula to
find the number of signal levels.
Note

The Shannon capacity gives us the


upper limit; the Nyquist formula tells us
how many signal levels we need.
Practice Problem
Problem: A digital signal has eight levels. How many
bits are needed per level?
Example 3.18

Assume we need to download text documents at the rate of 100

pages per minute. What is the required bit rate of the channel?

Consider each page contains 24 lines and each line contains 30

letters.
Example 3.20

What is the bit rate for high-definition TV (HDTV)? The HDTV Screen is

normally a ratio of 16 :9. There are 1920 by 1080 pixels per screen, and the

screen is renewed 30 times per second. Twenty-four bits represents one

color pixel.
Q.3. We have a channel with 4.5 kHz bandwidth. If we want to send

data at 120 Kbps, what is the minimum SNRdB? What is SNR? Also

calculate the no. of levels.

You might also like