2
Most read
5
Most read
11
Most read
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 5
PPT
Ch3 3 v1
PPT
Chapter 3 Data and Signals fourozan.ppt
PPT
Chapter 7
PPT
Chapter 6
PPT
Chapter 3
PPT
Chapter 8
PPT
2. data and signals
Chapter 5
Ch3 3 v1
Chapter 3 Data and Signals fourozan.ppt
Chapter 7
Chapter 6
Chapter 3
Chapter 8
2. data and signals

What's hot (20)

PPT
Chapter 4 - Digital Transmission
PPT
Chapter 3: Data & Signals
PPT
Chapter 11
PPT
Pulse code modulation
PPT
Data Communication And Networking - DATA RATE LIMITS
PPTX
Channel Capacity and transmission media
PPT
PPTX
Transmission impairment
PPT
Ch4 2 v1
PPT
Data Communications and Networking ch02
PPTX
Data encoding
PPT
Chapter 1
PPT
Operating System Concepts - Ch05
PPT
Chapter 4
PPT
Analog Transmissions
PPT
Chapter 14
PPTX
Digital Communication Techniques
PPTX
Chapter 10
Chapter 4 - Digital Transmission
Chapter 3: Data & Signals
Chapter 11
Pulse code modulation
Data Communication And Networking - DATA RATE LIMITS
Channel Capacity and transmission media
Transmission impairment
Ch4 2 v1
Data Communications and Networking ch02
Data encoding
Chapter 1
Operating System Concepts - Ch05
Chapter 4
Analog Transmissions
Chapter 14
Digital Communication Techniques
Chapter 10
Ad

Viewers also liked (8)

PDF
презентация финансовые и корпоративные расследования
PPT
Ch10 1 v1
PPT
Ch3 2 v1
PPTX
Arq Protocols
PPTX
Go Back N ARQ
PPT
Flow & Error Control
PPTX
GO BACK N PROTOCOL
презентация финансовые и корпоративные расследования
Ch10 1 v1
Ch3 2 v1
Arq Protocols
Go Back N ARQ
Flow & Error Control
GO BACK N PROTOCOL
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

More from bhagavanprasad (20)

PPT
Chapter03
PPT
Chapter03
PPT
Chapter02
PPT
Chapter01
PPT
Chapter01
PPT
Chapter08
PPTX
Chapter07
PPT
Chapter06
PPT
Chapter05
PPTX
Chapter04
PPT
Ch10 2 v1
PPT
Ch7 1 v1
PPT
Ch6 2 v1
PPT
Ch6 1 v1
PPT
Ch5 2 v1
PPT
Ch5 1 v1
PPT
Ch4 1 v1
PPT
Ch3 5 v1
PPT
Ch3 1 v1
PPT
Chapter03
Chapter03
Chapter02
Chapter01
Chapter01
Chapter08
Chapter07
Chapter06
Chapter05
Chapter04
Ch10 2 v1
Ch7 1 v1
Ch6 2 v1
Ch6 1 v1
Ch5 2 v1
Ch5 1 v1
Ch4 1 v1
Ch3 5 v1
Ch3 1 v1

Recently uploaded (20)

PDF
Design Guidelines and solutions for Plastics parts
PDF
20250617 - IR - Global Guide for HR - 51 pages.pdf
PPTX
Graph Data Structures with Types, Traversals, Connectivity, and Real-Life App...
PPTX
Amdahl’s law is explained in the above power point presentations
PDF
Java Basics-Introduction and program control
PDF
Applications of Equal_Area_Criterion.pdf
PPTX
CyberSecurity Mobile and Wireless Devices
PPTX
ASME PCC-02 TRAINING -DESKTOP-NLE5HNP.pptx
PPTX
mechattonicsand iotwith sensor and actuator
PPTX
Building constraction Conveyance of water.pptx
PDF
Prof. Dr. KAYIHURA A. SILAS MUNYANEZA, PhD..pdf
PPTX
Feature types and data preprocessing steps
PDF
LOW POWER CLASS AB SI POWER AMPLIFIER FOR WIRELESS MEDICAL SENSOR NETWORK
PPTX
Management Information system : MIS-e-Business Systems.pptx
PPTX
CN_Unite_1 AI&DS ENGGERING SPPU PUNE UNIVERSITY
PPTX
Chemical Technological Processes, Feasibility Study and Chemical Process Indu...
PDF
Soil Improvement Techniques Note - Rabbi
PDF
Abrasive, erosive and cavitation wear.pdf
PPTX
wireless networks, mobile computing.pptx
PPT
Chapter 1 - Introduction to Manufacturing Technology_2.ppt
Design Guidelines and solutions for Plastics parts
20250617 - IR - Global Guide for HR - 51 pages.pdf
Graph Data Structures with Types, Traversals, Connectivity, and Real-Life App...
Amdahl’s law is explained in the above power point presentations
Java Basics-Introduction and program control
Applications of Equal_Area_Criterion.pdf
CyberSecurity Mobile and Wireless Devices
ASME PCC-02 TRAINING -DESKTOP-NLE5HNP.pptx
mechattonicsand iotwith sensor and actuator
Building constraction Conveyance of water.pptx
Prof. Dr. KAYIHURA A. SILAS MUNYANEZA, PhD..pdf
Feature types and data preprocessing steps
LOW POWER CLASS AB SI POWER AMPLIFIER FOR WIRELESS MEDICAL SENSOR NETWORK
Management Information system : MIS-e-Business Systems.pptx
CN_Unite_1 AI&DS ENGGERING SPPU PUNE UNIVERSITY
Chemical Technological Processes, Feasibility Study and Chemical Process Indu...
Soil Improvement Techniques Note - Rabbi
Abrasive, erosive and cavitation wear.pdf
wireless networks, mobile computing.pptx
Chapter 1 - Introduction to Manufacturing Technology_2.ppt

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