SlideShare a Scribd company logo
3.1
3-5 DATA RATE LIMITS3-5 DATA RATE LIMITS
A very important consideration in data communicationsA very important consideration in data communications
is how fast we can send data, in bits per second, over ais 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 availableThe bandwidth available
2.2. The level of the signals we useThe level of the signals we use
33. 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

PPT
Chapter 3 Data and Signals fourozan.ppt
PPTX
Shannon Capacity Theorem
PPTX
Digital Modulation Techniques ppt
PPTX
Cdma2000
PPT
Error Detection and Correction
PPTX
TCP/IP 3-way Handshake
PPT
Chapter 6m
Chapter 3 Data and Signals fourozan.ppt
Shannon Capacity Theorem
Digital Modulation Techniques ppt
Cdma2000
Error Detection and Correction
TCP/IP 3-way Handshake
Chapter 6m

What's hot (20)

PPTX
Presentation on Transmission Media
PPTX
Unit 4 UDP
PPT
Switching systems lecture1
PPT
Chapter 6
PPTX
Channel Capacity and transmission media
PDF
Companding & Pulse Code Modulation
PPTX
Lec1 :- Data communication and network
PPT
Digital to analog conversion
PPSX
Token ring
PDF
Physical Layer Numericals - Data Communication & Networking
PPT
Manchester Encoding
PPT
Data Encoding
PPTX
Computer network switches & their structures
PPT
Network administration and Management
PPT
Chapter 3: Data & Signals
PPTX
Public Switched Telephone Network
PDF
Data Communication Networking Issues in Real World
PDF
Digital communication systems
Presentation on Transmission Media
Unit 4 UDP
Switching systems lecture1
Chapter 6
Channel Capacity and transmission media
Companding & Pulse Code Modulation
Lec1 :- Data communication and network
Digital to analog conversion
Token ring
Physical Layer Numericals - Data Communication & Networking
Manchester Encoding
Data Encoding
Computer network switches & their structures
Network administration and Management
Chapter 3: Data & Signals
Public Switched Telephone Network
Data Communication Networking Issues in Real World
Digital communication systems
Ad

Similar to Ch3 4 v1 (20)

PPT
ch3_4_v1.ppt11111111111111111111111111111111111111111111111
PPT
signal data communication and networking
PPT
Physical Layer and Data rate concepts.ppt
PPTX
Shannon Capacity.pptx
PPT
Data Rate Limits A class element for university student
PPTX
Channel capacity data communication pdf download
PPT
Ch3 2 Data communication and networking
PPT
data communication slide on data rate and efficiency
PDF
Data bit rate_by_abhishek_wadhwa
PPTX
DATA RATE LIMITS
PDF
Data Communication & Computer network: Channel capacity
PDF
Introduction to Channel Capacity | DCNIT-LDTalks-1
PPT
Lecture 2 data communication physical layer
PPTX
Channel capacity
PPT
Communication systems week 2
PPTX
Datarateincommunicationnetworking 1.pptx
PPTX
Mixed presenration
PPTX
3-Bandwidth.pptx
PPTX
Channel capacity
PDF
Chp3_Physical Layer computer networking and communication
ch3_4_v1.ppt11111111111111111111111111111111111111111111111
signal data communication and networking
Physical Layer and Data rate concepts.ppt
Shannon Capacity.pptx
Data Rate Limits A class element for university student
Channel capacity data communication pdf download
Ch3 2 Data communication and networking
data communication slide on data rate and efficiency
Data bit rate_by_abhishek_wadhwa
DATA RATE LIMITS
Data Communication & Computer network: Channel capacity
Introduction to Channel Capacity | DCNIT-LDTalks-1
Lecture 2 data communication physical layer
Channel capacity
Communication systems week 2
Datarateincommunicationnetworking 1.pptx
Mixed presenration
3-Bandwidth.pptx
Channel capacity
Chp3_Physical Layer computer networking and communication
Ad

More from sayyed sabir (20)

PDF
Workbreakdownstructureppt 130410021152-phpapp02
PPTX
Automatic door using arduino
PPTX
Importance of coal water slurry
PPTX
(Week 15)
PPTX
(Week 14)
PPTX
(Week 13)
PPTX
(Week 12)
PPTX
(Week 11)
PPTX
(Week 10)
PPTX
(Week 9)
PPTX
(Week 8)
PPTX
(Week 7)
PPTX
(Week 6)
PPTX
(Week 5)
PPTX
(Week 4)
PPTX
(Week 3)
PPTX
(Week 2)
PPTX
(Week 1)
PPTX
Transmission modes
PPT
Osi model
Workbreakdownstructureppt 130410021152-phpapp02
Automatic door using arduino
Importance of coal water slurry
(Week 15)
(Week 14)
(Week 13)
(Week 12)
(Week 11)
(Week 10)
(Week 9)
(Week 8)
(Week 7)
(Week 6)
(Week 5)
(Week 4)
(Week 3)
(Week 2)
(Week 1)
Transmission modes
Osi model

Recently uploaded (20)

PDF
MIND Revenue Release Quarter 2 2025 Press Release
PDF
Microsoft Solutions Partner Drive Digital Transformation with D365.pdf
PDF
Encapsulation_ Review paper, used for researhc scholars
PDF
Hindi spoken digit analysis for native and non-native speakers
PDF
Univ-Connecticut-ChatGPT-Presentaion.pdf
PPTX
1. Introduction to Computer Programming.pptx
PDF
Zenith AI: Advanced Artificial Intelligence
PPTX
Digital-Transformation-Roadmap-for-Companies.pptx
PPTX
Group 1 Presentation -Planning and Decision Making .pptx
PDF
Getting Started with Data Integration: FME Form 101
PPTX
cloud_computing_Infrastucture_as_cloud_p
PDF
Profit Center Accounting in SAP S/4HANA, S4F28 Col11
PDF
Transform Your ITIL® 4 & ITSM Strategy with AI in 2025.pdf
PDF
Assigned Numbers - 2025 - Bluetooth® Document
PDF
Unlocking AI with Model Context Protocol (MCP)
PPTX
A Presentation on Artificial Intelligence
PPTX
A Presentation on Touch Screen Technology
PDF
Video forgery: An extensive analysis of inter-and intra-frame manipulation al...
PDF
Encapsulation theory and applications.pdf
PDF
Enhancing emotion recognition model for a student engagement use case through...
MIND Revenue Release Quarter 2 2025 Press Release
Microsoft Solutions Partner Drive Digital Transformation with D365.pdf
Encapsulation_ Review paper, used for researhc scholars
Hindi spoken digit analysis for native and non-native speakers
Univ-Connecticut-ChatGPT-Presentaion.pdf
1. Introduction to Computer Programming.pptx
Zenith AI: Advanced Artificial Intelligence
Digital-Transformation-Roadmap-for-Companies.pptx
Group 1 Presentation -Planning and Decision Making .pptx
Getting Started with Data Integration: FME Form 101
cloud_computing_Infrastucture_as_cloud_p
Profit Center Accounting in SAP S/4HANA, S4F28 Col11
Transform Your ITIL® 4 & ITSM Strategy with AI in 2025.pdf
Assigned Numbers - 2025 - Bluetooth® Document
Unlocking AI with Model Context Protocol (MCP)
A Presentation on Artificial Intelligence
A Presentation on Touch Screen Technology
Video forgery: An extensive analysis of inter-and intra-frame manipulation al...
Encapsulation theory and applications.pdf
Enhancing emotion recognition model for a student engagement use case through...

Ch3 4 v1

  • 1. 3.1 3-5 DATA RATE LIMITS3-5 DATA RATE LIMITS A very important consideration in data communicationsA very important consideration in data communications is how fast we can send data, in bits per second, over ais 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 availableThe bandwidth available 2.2. The level of the signals we useThe level of the signals we use 33. 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