SlideShare a Scribd company logo
3.1
3-5 DATA RATE LIMITS
3-5 DATA RATE LIMITS
A very important consideration in data communications
A very important consideration in data communications
is how fast we can send data, in bits per second, over a
is how fast we can send data, in bits per second, over a
channel. Data rate depends on three factors:
channel. Data rate depends on three factors:
1.
1. The bandwidth available
The bandwidth available
2.
2. The level of the signals we use
The level of the signals we use
3
3. The quality of the channel (the level of noise)
. The quality of the channel (the level of noise)
 Noiseless Channel: Nyquist Bit Rate
 Noisy Channel: Shannon Capacity
 Using Both Limits
Topics discussed in this section:
Topics discussed in this section:
3.2
Increasing the levels of a signal
increases the probability of an error
occurring, in other words it reduces the
reliability of the system. Why??
Note
3.3
Capacity of a System
 The 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.
3.4
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
C= capacity in bps
B = bandwidth in Hz
3.5
Does the Nyquist theorem bit rate agree with the
intuitive bit rate described in baseband transmission?
Solution
They match when we have only two levels. We said, in
baseband transmission, the bit rate is 2 times the
bandwidth if we use only the first harmonic in the worst
case. However, the Nyquist formula is more general than
what we derived intuitively; it can be applied to baseband
transmission and modulation. Also, it can be applied
when we have two or more levels of signals.
Example 3.33
3.6
Consider a noiseless channel with a bandwidth of 3000
Hz transmitting a signal with two signal levels. The
maximum bit rate can be calculated as
Example 3.34
3.7
Consider the same noiseless channel transmitting a
signal with four signal levels (for each level, we send 2
bits). The maximum bit rate can be calculated as
Example 3.35
3.8
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:
Example 3.36
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 240 kbps.
3.9
Shannon’s Theorem
 Shannon’s theorem gives the capacity
of a system in the presence of noise.
C = B log2(1 + SNR)
3.10
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 capacity C is calculated as
Example 3.37
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.
3.11
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 the capacity is calculated as
Example 3.38
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.
3.12
The signal-to-noise ratio is often given in decibels.
Assume that SNRdB = 36 and the channel bandwidth is 2
MHz. The theoretical channel capacity can be calculated
as
Example 3.39
3.13
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
Example 3.40
For example, we can calculate the theoretical capacity of
the previous example as
3.14
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.
Example 3.41
3.15
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.
Example 3.41 (continued)
3.16
The Shannon capacity gives us the
upper limit; the Nyquist formula tells us
how many signal levels we need.
Note

More Related Content

PPTX
Shannon Capacity.pptx
PPT
Data Rate Limits A class element for university student
PPT
Ch3 2 Data communication and networking
PPTX
Channel capacity data communication pdf download
PPT
data communication slide on data rate and efficiency
PPT
10069380.ppt
PDF
Chp3_Physical Layer computer networking and communication
PDF
Data bit rate_by_abhishek_wadhwa
Shannon Capacity.pptx
Data Rate Limits A class element for university student
Ch3 2 Data communication and networking
Channel capacity data communication pdf download
data communication slide on data rate and efficiency
10069380.ppt
Chp3_Physical Layer computer networking and communication
Data bit rate_by_abhishek_wadhwa

Similar to ch03_DataRateLimitsGUYUHUHHIUHPUI BKH.ppt (20)

PDF
Module-1-DataCommuination-Third Chapter -problems.pdf
PDF
Data Communication & Computer network: Channel capacity
PPT
PPT
Signal data networking and communication
PPT
ch3_2_v1.ppt in farauzen book full ppt__
PPT
Lecture 2 data communication physical layer
PPT
Ch3 2 v1
PPT
Ch3 2 v1
PPT
PPT
Use cases about samples examples illustrations
PPTX
Data Communication Principles
PPT
Data and Signals.ppt
PPTX
DATA RATE LIMITS
PDF
Computer Networks and basics for CSE students
PPT
Ch3 1 Data communication and networking
PPT
ch3-1-v1-14102022-105042pm.ppt
PPT
Bandwidth.ppt
PPT
Networks data and signals
PPT
ch3_2_v1.ppt
PDF
Computer network and its applications.pdf
Module-1-DataCommuination-Third Chapter -problems.pdf
Data Communication & Computer network: Channel capacity
Signal data networking and communication
ch3_2_v1.ppt in farauzen book full ppt__
Lecture 2 data communication physical layer
Ch3 2 v1
Ch3 2 v1
Use cases about samples examples illustrations
Data Communication Principles
Data and Signals.ppt
DATA RATE LIMITS
Computer Networks and basics for CSE students
Ch3 1 Data communication and networking
ch3-1-v1-14102022-105042pm.ppt
Bandwidth.ppt
Networks data and signals
ch3_2_v1.ppt
Computer network and its applications.pdf
Ad

More from adnanshaheen425 (16)

PPTX
UMWBDS_ jfjf tfutf yuftf fPresentation.pptx
PPTX
Blood donation hkekh eio hjqehjq society.pptx
PPTX
lecture_EETRYUIOP[SADSFGHJKLTRWETRY2_fm.pptx
PPT
lecture GDTDFYRDYRDYDYRDYRDYRDR _1_fm.ppt
PPT
HHDUHDUO UOOYYYOIOUG _MultipleAccess.ppt
PPT
ch07_Tra HGH YIGYG G EYGY nsmissionMedia.ppt
PPTX
Ad BW nbkhuohb hugugBHH NQHBMQUWHnan.pptx
PPTX
nETWORKING LEACTURE 2 HGUYI ULec 2A.pptx
PPTX
Networking chapter jkl; dfghyubLec 1.pptx
PPT
ch3_3_v1.ppt networking ertyu ghyt y uuiqf
PPT
ch2_v1.ppt networking tertyui fdcfjgfybvuu
PPT
formal method chapter 1 lecture_3_fm.pptlecture_3_fm.ppt
PPT
formal method chapter 1 lecture_1_fm.ppt
PPT
SD&C chapter software engineeringLec 5A.ppt
PPT
Software designe and constractionLec 4B.ppt
PPTX
Cultural Heritage of Mianwali PPT 28-11-2024.pptx
UMWBDS_ jfjf tfutf yuftf fPresentation.pptx
Blood donation hkekh eio hjqehjq society.pptx
lecture_EETRYUIOP[SADSFGHJKLTRWETRY2_fm.pptx
lecture GDTDFYRDYRDYDYRDYRDYRDR _1_fm.ppt
HHDUHDUO UOOYYYOIOUG _MultipleAccess.ppt
ch07_Tra HGH YIGYG G EYGY nsmissionMedia.ppt
Ad BW nbkhuohb hugugBHH NQHBMQUWHnan.pptx
nETWORKING LEACTURE 2 HGUYI ULec 2A.pptx
Networking chapter jkl; dfghyubLec 1.pptx
ch3_3_v1.ppt networking ertyu ghyt y uuiqf
ch2_v1.ppt networking tertyui fdcfjgfybvuu
formal method chapter 1 lecture_3_fm.pptlecture_3_fm.ppt
formal method chapter 1 lecture_1_fm.ppt
SD&C chapter software engineeringLec 5A.ppt
Software designe and constractionLec 4B.ppt
Cultural Heritage of Mianwali PPT 28-11-2024.pptx
Ad

Recently uploaded (20)

PPT
neurology Member of Royal College of Physicians (MRCP).ppt
PDF
Plant-Based Antimicrobials: A New Hope for Treating Diarrhea in HIV Patients...
PPTX
Reading between the Rings: Imaging in Brain Infections
PDF
Lecture 8- Cornea and Sclera .pdf 5tg year
PPT
HIV lecture final - student.pptfghjjkkejjhhge
PPTX
Enteric duplication cyst, etiology and management
PPT
Rheumatology Member of Royal College of Physicians.ppt
PPT
nephrology MRCP - Member of Royal College of Physicians ppt
PPTX
Cardiovascular - antihypertensive medical backgrounds
PDF
Extended-Expanded-role-of-Nurses.pdf is a key for student Nurses
PDF
OSCE SERIES ( Questions & Answers ) - Set 3.pdf
PPTX
NRP and care of Newborn.pptx- APPT presentation about neonatal resuscitation ...
PPTX
Hearthhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh
PDF
focused on the development and application of glycoHILIC, pepHILIC, and comm...
PPTX
preoerative assessment in anesthesia and critical care medicine
PPT
Dermatology for member of royalcollege.ppt
DOCX
PEADIATRICS NOTES.docx lecture notes for medical students
PPTX
Human Reproduction: Anatomy, Physiology & Clinical Insights.pptx
PPTX
Radiation Dose Management for Patients in Medical Imaging- Avinesh Shrestha
PDF
شيت_عطا_0000000000000000000000000000.pdf
neurology Member of Royal College of Physicians (MRCP).ppt
Plant-Based Antimicrobials: A New Hope for Treating Diarrhea in HIV Patients...
Reading between the Rings: Imaging in Brain Infections
Lecture 8- Cornea and Sclera .pdf 5tg year
HIV lecture final - student.pptfghjjkkejjhhge
Enteric duplication cyst, etiology and management
Rheumatology Member of Royal College of Physicians.ppt
nephrology MRCP - Member of Royal College of Physicians ppt
Cardiovascular - antihypertensive medical backgrounds
Extended-Expanded-role-of-Nurses.pdf is a key for student Nurses
OSCE SERIES ( Questions & Answers ) - Set 3.pdf
NRP and care of Newborn.pptx- APPT presentation about neonatal resuscitation ...
Hearthhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh
focused on the development and application of glycoHILIC, pepHILIC, and comm...
preoerative assessment in anesthesia and critical care medicine
Dermatology for member of royalcollege.ppt
PEADIATRICS NOTES.docx lecture notes for medical students
Human Reproduction: Anatomy, Physiology & Clinical Insights.pptx
Radiation Dose Management for Patients in Medical Imaging- Avinesh Shrestha
شيت_عطا_0000000000000000000000000000.pdf

ch03_DataRateLimitsGUYUHUHHIUHPUI BKH.ppt

  • 1. 3.1 3-5 DATA RATE LIMITS 3-5 DATA RATE LIMITS A very important consideration in data communications A very important consideration in data communications is how fast we can send data, in bits per second, over a is how fast we can send data, in bits per second, over a channel. Data rate depends on three factors: channel. Data rate depends on three factors: 1. 1. The bandwidth available The bandwidth available 2. 2. The level of the signals we use The level of the signals we use 3 3. The quality of the channel (the level of noise) . The quality of the channel (the level of noise)  Noiseless Channel: Nyquist Bit Rate  Noisy Channel: Shannon Capacity  Using Both Limits Topics discussed in this section: Topics discussed in this section:
  • 2. 3.2 Increasing the levels of a signal increases the probability of an error occurring, in other words it reduces the reliability of the system. Why?? Note
  • 3. 3.3 Capacity of a System  The 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.
  • 4. 3.4 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 C= capacity in bps B = bandwidth in Hz
  • 5. 3.5 Does the Nyquist theorem bit rate agree with the intuitive bit rate described in baseband transmission? Solution They match when we have only two levels. We said, in baseband transmission, the bit rate is 2 times the bandwidth if we use only the first harmonic in the worst case. However, the Nyquist formula is more general than what we derived intuitively; it can be applied to baseband transmission and modulation. Also, it can be applied when we have two or more levels of signals. Example 3.33
  • 6. 3.6 Consider a noiseless channel with a bandwidth of 3000 Hz transmitting a signal with two signal levels. The maximum bit rate can be calculated as Example 3.34
  • 7. 3.7 Consider the same noiseless channel transmitting a signal with four signal levels (for each level, we send 2 bits). The maximum bit rate can be calculated as Example 3.35
  • 8. 3.8 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: Example 3.36 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 240 kbps.
  • 9. 3.9 Shannon’s Theorem  Shannon’s theorem gives the capacity of a system in the presence of noise. C = B log2(1 + SNR)
  • 10. 3.10 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 capacity C is calculated as Example 3.37 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.
  • 11. 3.11 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 the capacity is calculated as Example 3.38 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.
  • 12. 3.12 The signal-to-noise ratio is often given in decibels. Assume that SNRdB = 36 and the channel bandwidth is 2 MHz. The theoretical channel capacity can be calculated as Example 3.39
  • 13. 3.13 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 Example 3.40 For example, we can calculate the theoretical capacity of the previous example as
  • 14. 3.14 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. Example 3.41
  • 15. 3.15 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. Example 3.41 (continued)
  • 16. 3.16 The Shannon capacity gives us the upper limit; the Nyquist formula tells us how many signal levels we need. Note

Editor's Notes

  • #4: Harmonic: First/Lowest frequency of bandwidth