SlideShare a Scribd company logo
1 of 16
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)
 Noiseless Channel: Nyquist Bit Rate
 Noisy Channel: Shannon Capacity
 Using Both Limits
Topics discussed in this section:
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
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.
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
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
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
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
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.
Shannon’s Theorem
 Shannon’s theorem gives the capacity
of a system in the presence of noise.
C = B log2(1 + SNR)
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.
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.
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
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
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
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)
The Shannon capacity gives us the
upper limit; the Nyquist formula tells us
how many signal levels we need.
Note

More Related Content

What's hot

Operating System Concepts - Ch05
Operating System Concepts - Ch05Operating System Concepts - Ch05
Operating System Concepts - Ch05Wayne Jones Jnr
 
Circuit switching packet switching
Circuit switching  packet  switchingCircuit switching  packet  switching
Circuit switching packet switchingSneha Dalvi
 
Baud rate is the number of change in signal
Baud rate is the number of change in signalBaud rate is the number of change in signal
Baud rate is the number of change in signalAbhishek Pathak
 
TCP congestion control
TCP congestion controlTCP congestion control
TCP congestion controlShubham Jain
 
Forouzan-ch19-Network-Layer-Logical-Addressing.ppt
Forouzan-ch19-Network-Layer-Logical-Addressing.pptForouzan-ch19-Network-Layer-Logical-Addressing.ppt
Forouzan-ch19-Network-Layer-Logical-Addressing.pptJayaprasanna4
 
Border Gateway Protocol
Border Gateway ProtocolBorder Gateway Protocol
Border Gateway ProtocolKashif Latif
 
Switching
Switching Switching
Switching Abid Ali
 
3a data link layer
3a data link layer 3a data link layer
3a data link layer kavish dani
 
Data Communication & Computer Networks : Unipolar & Polar coding
Data Communication & Computer Networks : Unipolar & Polar codingData Communication & Computer Networks : Unipolar & Polar coding
Data Communication & Computer Networks : Unipolar & Polar codingDr Rajiv Srivastava
 
Chapter 4 - Digital Transmission
Chapter 4 - Digital TransmissionChapter 4 - Digital Transmission
Chapter 4 - Digital TransmissionWayne Jones Jnr
 

What's hot (20)

Operating System Concepts - Ch05
Operating System Concepts - Ch05Operating System Concepts - Ch05
Operating System Concepts - Ch05
 
Spanning tree protocol
Spanning tree protocolSpanning tree protocol
Spanning tree protocol
 
Ch 03
Ch 03Ch 03
Ch 03
 
Circuit switching packet switching
Circuit switching  packet  switchingCircuit switching  packet  switching
Circuit switching packet switching
 
Baud rate is the number of change in signal
Baud rate is the number of change in signalBaud rate is the number of change in signal
Baud rate is the number of change in signal
 
TCP congestion control
TCP congestion controlTCP congestion control
TCP congestion control
 
Hspa and hsdpa
Hspa and hsdpaHspa and hsdpa
Hspa and hsdpa
 
Ethernet
EthernetEthernet
Ethernet
 
IPV4 Frame Format
IPV4 Frame FormatIPV4 Frame Format
IPV4 Frame Format
 
Forouzan-ch19-Network-Layer-Logical-Addressing.ppt
Forouzan-ch19-Network-Layer-Logical-Addressing.pptForouzan-ch19-Network-Layer-Logical-Addressing.ppt
Forouzan-ch19-Network-Layer-Logical-Addressing.ppt
 
Border Gateway Protocol
Border Gateway ProtocolBorder Gateway Protocol
Border Gateway Protocol
 
Switching
Switching Switching
Switching
 
3a data link layer
3a data link layer 3a data link layer
3a data link layer
 
Chapter 10
Chapter 10Chapter 10
Chapter 10
 
Chapter 4
Chapter 4Chapter 4
Chapter 4
 
Congestion control in TCP
Congestion control in TCPCongestion control in TCP
Congestion control in TCP
 
Ch20
Ch20Ch20
Ch20
 
Lecture 13
Lecture 13Lecture 13
Lecture 13
 
Data Communication & Computer Networks : Unipolar & Polar coding
Data Communication & Computer Networks : Unipolar & Polar codingData Communication & Computer Networks : Unipolar & Polar coding
Data Communication & Computer Networks : Unipolar & Polar coding
 
Chapter 4 - Digital Transmission
Chapter 4 - Digital TransmissionChapter 4 - Digital Transmission
Chapter 4 - Digital Transmission
 

Similar to DATA RATE LIMITS KEY FACTORS

Data Rate Limits A class element for university student
Data Rate Limits A class element  for university studentData Rate Limits A class element  for university student
Data Rate Limits A class element for university studenttarekrahat
 
Data Communication And Networking - DATA RATE LIMITS
Data Communication And Networking - DATA RATE LIMITSData Communication And Networking - DATA RATE LIMITS
Data Communication And Networking - DATA RATE LIMITSAvijeet Negel
 
Data Communication & Computer network: Channel capacity
Data Communication & Computer network: Channel capacityData Communication & Computer network: Channel capacity
Data Communication & Computer network: Channel capacityDr Rajiv Srivastava
 
Data Communication Principles
Data Communication PrinciplesData Communication Principles
Data Communication PrinciplesKamal Acharya
 
Data bit rate_by_abhishek_wadhwa
Data bit rate_by_abhishek_wadhwaData bit rate_by_abhishek_wadhwa
Data bit rate_by_abhishek_wadhwaAbhishek Wadhwa
 
DATA RATE LIMITS
DATA RATE LIMITSDATA RATE LIMITS
DATA RATE LIMITSChAwais15
 
Ch4 1 Data communication and networking by neha g. kurale
Ch4 1 Data communication and networking by neha g. kuraleCh4 1 Data communication and networking by neha g. kurale
Ch4 1 Data communication and networking by neha g. kuraleNeha Kurale
 
TeleCom Lecture 07.ppt
TeleCom Lecture 07.pptTeleCom Lecture 07.ppt
TeleCom Lecture 07.pptRiyaBatool
 
Mixed presenration
Mixed presenrationMixed presenration
Mixed presenrationazim khan
 
COMPUTER NETWORKS DATAS AND SIGNALS.pptx
COMPUTER NETWORKS DATAS AND SIGNALS.pptxCOMPUTER NETWORKS DATAS AND SIGNALS.pptx
COMPUTER NETWORKS DATAS AND SIGNALS.pptxKALPANAC20
 

Similar to DATA RATE LIMITS KEY FACTORS (20)

Shannon Capacity.pptx
Shannon Capacity.pptxShannon Capacity.pptx
Shannon Capacity.pptx
 
Data Rate Limits A class element for university student
Data Rate Limits A class element  for university studentData Rate Limits A class element  for university student
Data Rate Limits A class element for university student
 
Ch3 4 v1
Ch3 4 v1Ch3 4 v1
Ch3 4 v1
 
Ch3 4 v1
Ch3 4 v1Ch3 4 v1
Ch3 4 v1
 
Data Communication And Networking - DATA RATE LIMITS
Data Communication And Networking - DATA RATE LIMITSData Communication And Networking - DATA RATE LIMITS
Data Communication And Networking - DATA RATE LIMITS
 
10069380.ppt
10069380.ppt10069380.ppt
10069380.ppt
 
Data Communication & Computer network: Channel capacity
Data Communication & Computer network: Channel capacityData Communication & Computer network: Channel capacity
Data Communication & Computer network: Channel capacity
 
Data Communication Principles
Data Communication PrinciplesData Communication Principles
Data Communication Principles
 
Data bit rate_by_abhishek_wadhwa
Data bit rate_by_abhishek_wadhwaData bit rate_by_abhishek_wadhwa
Data bit rate_by_abhishek_wadhwa
 
DATA RATE LIMITS
DATA RATE LIMITSDATA RATE LIMITS
DATA RATE LIMITS
 
Chap3
Chap3Chap3
Chap3
 
2. data and signals
2. data and signals2. data and signals
2. data and signals
 
Ch4 1 Data communication and networking by neha g. kurale
Ch4 1 Data communication and networking by neha g. kuraleCh4 1 Data communication and networking by neha g. kurale
Ch4 1 Data communication and networking by neha g. kurale
 
Ch3 2 v1
Ch3 2 v1Ch3 2 v1
Ch3 2 v1
 
Ch3 2 v1
Ch3 2 v1Ch3 2 v1
Ch3 2 v1
 
TeleCom Lecture 07.ppt
TeleCom Lecture 07.pptTeleCom Lecture 07.ppt
TeleCom Lecture 07.ppt
 
Mixed presenration
Mixed presenrationMixed presenration
Mixed presenration
 
COMPUTER NETWORKS DATAS AND SIGNALS.pptx
COMPUTER NETWORKS DATAS AND SIGNALS.pptxCOMPUTER NETWORKS DATAS AND SIGNALS.pptx
COMPUTER NETWORKS DATAS AND SIGNALS.pptx
 
Analog_to_Digital.pdf
Analog_to_Digital.pdfAnalog_to_Digital.pdf
Analog_to_Digital.pdf
 
3-Bandwidth.pptx
3-Bandwidth.pptx3-Bandwidth.pptx
3-Bandwidth.pptx
 

More from Neha Kurale

Ch7 Data communication and networking by neha g. kurale
Ch7 Data communication and networking by neha g. kuraleCh7 Data communication and networking by neha g. kurale
Ch7 Data communication and networking by neha g. kuraleNeha Kurale
 
Ch6 2 Data communication and networking by neha g. kurale
Ch6 2 Data communication and networking by neha g. kuraleCh6 2 Data communication and networking by neha g. kurale
Ch6 2 Data communication and networking by neha g. kuraleNeha Kurale
 
Ch6 1 Data communication and networking by neha g. kurale
Ch6 1 Data communication and networking by neha g. kuraleCh6 1 Data communication and networking by neha g. kurale
Ch6 1 Data communication and networking by neha g. kuraleNeha Kurale
 
Ch5 1 Data communication and networking by neha g. kurale
Ch5 1 Data communication and networking by neha g. kuraleCh5 1 Data communication and networking by neha g. kurale
Ch5 1 Data communication and networking by neha g. kuraleNeha Kurale
 
Ch5 Data communication and networking by neha g. kurale
Ch5 Data communication and networking by neha g. kuraleCh5 Data communication and networking by neha g. kurale
Ch5 Data communication and networking by neha g. kuraleNeha Kurale
 
Ch4 Data communication and networking by neha g. kurale
Ch4 Data communication and networking by neha g. kuraleCh4 Data communication and networking by neha g. kurale
Ch4 Data communication and networking by neha g. kuraleNeha Kurale
 
Ch3 3 Data communication and networking
Ch3 3  Data communication and networking Ch3 3  Data communication and networking
Ch3 3 Data communication and networking Neha Kurale
 
Ch3 1 Data communication and networking
Ch3 1 Data communication and networkingCh3 1 Data communication and networking
Ch3 1 Data communication and networkingNeha Kurale
 
Ch3Data communication and networking by neha g. kurale
Ch3Data communication and networking by neha g. kuraleCh3Data communication and networking by neha g. kurale
Ch3Data communication and networking by neha g. kuraleNeha Kurale
 
Application layer
Application layerApplication layer
Application layerNeha Kurale
 
Application layer
Application layerApplication layer
Application layerNeha Kurale
 
Computer funda bsc_hs
Computer funda bsc_hsComputer funda bsc_hs
Computer funda bsc_hsNeha Kurale
 
Unit1 three part secondary storage devices
Unit1 three part secondary storage devicesUnit1 three part secondary storage devices
Unit1 three part secondary storage devicesNeha Kurale
 
Unit1 four part basic computer organization
Unit1 four part basic computer organizationUnit1 four part basic computer organization
Unit1 four part basic computer organizationNeha Kurale
 
Unit 1 two part hw sw os app sw
Unit 1 two part hw sw os app swUnit 1 two part hw sw os app sw
Unit 1 two part hw sw os app swNeha Kurale
 
Unit 1 one part introduction to computers
Unit 1 one part introduction to computersUnit 1 one part introduction to computers
Unit 1 one part introduction to computersNeha Kurale
 
Unit 1 four part pocessor and memory
Unit 1 four part pocessor and memoryUnit 1 four part pocessor and memory
Unit 1 four part pocessor and memoryNeha Kurale
 
Introduction to computer_networks (unit1)
Introduction to computer_networks (unit1)Introduction to computer_networks (unit1)
Introduction to computer_networks (unit1)Neha Kurale
 

More from Neha Kurale (20)

Ch7 Data communication and networking by neha g. kurale
Ch7 Data communication and networking by neha g. kuraleCh7 Data communication and networking by neha g. kurale
Ch7 Data communication and networking by neha g. kurale
 
Ch6 2 Data communication and networking by neha g. kurale
Ch6 2 Data communication and networking by neha g. kuraleCh6 2 Data communication and networking by neha g. kurale
Ch6 2 Data communication and networking by neha g. kurale
 
Ch6 1 Data communication and networking by neha g. kurale
Ch6 1 Data communication and networking by neha g. kuraleCh6 1 Data communication and networking by neha g. kurale
Ch6 1 Data communication and networking by neha g. kurale
 
Ch5 1 Data communication and networking by neha g. kurale
Ch5 1 Data communication and networking by neha g. kuraleCh5 1 Data communication and networking by neha g. kurale
Ch5 1 Data communication and networking by neha g. kurale
 
Ch5 Data communication and networking by neha g. kurale
Ch5 Data communication and networking by neha g. kuraleCh5 Data communication and networking by neha g. kurale
Ch5 Data communication and networking by neha g. kurale
 
Ch4 Data communication and networking by neha g. kurale
Ch4 Data communication and networking by neha g. kuraleCh4 Data communication and networking by neha g. kurale
Ch4 Data communication and networking by neha g. kurale
 
Ch3 3 Data communication and networking
Ch3 3  Data communication and networking Ch3 3  Data communication and networking
Ch3 3 Data communication and networking
 
Ch3 1 Data communication and networking
Ch3 1 Data communication and networkingCh3 1 Data communication and networking
Ch3 1 Data communication and networking
 
Ch3Data communication and networking by neha g. kurale
Ch3Data communication and networking by neha g. kuraleCh3Data communication and networking by neha g. kurale
Ch3Data communication and networking by neha g. kurale
 
Ch2
Ch2Ch2
Ch2
 
Ch1
Ch1Ch1
Ch1
 
Application layer
Application layerApplication layer
Application layer
 
Application layer
Application layerApplication layer
Application layer
 
Computer funda bsc_hs
Computer funda bsc_hsComputer funda bsc_hs
Computer funda bsc_hs
 
Unit1 three part secondary storage devices
Unit1 three part secondary storage devicesUnit1 three part secondary storage devices
Unit1 three part secondary storage devices
 
Unit1 four part basic computer organization
Unit1 four part basic computer organizationUnit1 four part basic computer organization
Unit1 four part basic computer organization
 
Unit 1 two part hw sw os app sw
Unit 1 two part hw sw os app swUnit 1 two part hw sw os app sw
Unit 1 two part hw sw os app sw
 
Unit 1 one part introduction to computers
Unit 1 one part introduction to computersUnit 1 one part introduction to computers
Unit 1 one part introduction to computers
 
Unit 1 four part pocessor and memory
Unit 1 four part pocessor and memoryUnit 1 four part pocessor and memory
Unit 1 four part pocessor and memory
 
Introduction to computer_networks (unit1)
Introduction to computer_networks (unit1)Introduction to computer_networks (unit1)
Introduction to computer_networks (unit1)
 

Recently uploaded

VIP Call Girls Service Kondapur Hyderabad Call +91-8250192130
VIP Call Girls Service Kondapur Hyderabad Call +91-8250192130VIP Call Girls Service Kondapur Hyderabad Call +91-8250192130
VIP Call Girls Service Kondapur Hyderabad Call +91-8250192130Suhani Kapoor
 
HARMONY IN THE NATURE AND EXISTENCE - Unit-IV
HARMONY IN THE NATURE AND EXISTENCE - Unit-IVHARMONY IN THE NATURE AND EXISTENCE - Unit-IV
HARMONY IN THE NATURE AND EXISTENCE - Unit-IVRajaP95
 
Introduction to IEEE STANDARDS and its different types.pptx
Introduction to IEEE STANDARDS and its different types.pptxIntroduction to IEEE STANDARDS and its different types.pptx
Introduction to IEEE STANDARDS and its different types.pptxupamatechverse
 
APPLICATIONS-AC/DC DRIVES-OPERATING CHARACTERISTICS
APPLICATIONS-AC/DC DRIVES-OPERATING CHARACTERISTICSAPPLICATIONS-AC/DC DRIVES-OPERATING CHARACTERISTICS
APPLICATIONS-AC/DC DRIVES-OPERATING CHARACTERISTICSKurinjimalarL3
 
HARDNESS, FRACTURE TOUGHNESS AND STRENGTH OF CERAMICS
HARDNESS, FRACTURE TOUGHNESS AND STRENGTH OF CERAMICSHARDNESS, FRACTURE TOUGHNESS AND STRENGTH OF CERAMICS
HARDNESS, FRACTURE TOUGHNESS AND STRENGTH OF CERAMICSRajkumarAkumalla
 
Decoding Kotlin - Your guide to solving the mysterious in Kotlin.pptx
Decoding Kotlin - Your guide to solving the mysterious in Kotlin.pptxDecoding Kotlin - Your guide to solving the mysterious in Kotlin.pptx
Decoding Kotlin - Your guide to solving the mysterious in Kotlin.pptxJoão Esperancinha
 
Microscopic Analysis of Ceramic Materials.pptx
Microscopic Analysis of Ceramic Materials.pptxMicroscopic Analysis of Ceramic Materials.pptx
Microscopic Analysis of Ceramic Materials.pptxpurnimasatapathy1234
 
main PPT.pptx of girls hostel security using rfid
main PPT.pptx of girls hostel security using rfidmain PPT.pptx of girls hostel security using rfid
main PPT.pptx of girls hostel security using rfidNikhilNagaraju
 
High Profile Call Girls Nagpur Meera Call 7001035870 Meet With Nagpur Escorts
High Profile Call Girls Nagpur Meera Call 7001035870 Meet With Nagpur EscortsHigh Profile Call Girls Nagpur Meera Call 7001035870 Meet With Nagpur Escorts
High Profile Call Girls Nagpur Meera Call 7001035870 Meet With Nagpur EscortsCall Girls in Nagpur High Profile
 
Gfe Mayur Vihar Call Girls Service WhatsApp -> 9999965857 Available 24x7 ^ De...
Gfe Mayur Vihar Call Girls Service WhatsApp -> 9999965857 Available 24x7 ^ De...Gfe Mayur Vihar Call Girls Service WhatsApp -> 9999965857 Available 24x7 ^ De...
Gfe Mayur Vihar Call Girls Service WhatsApp -> 9999965857 Available 24x7 ^ De...srsj9000
 
Call for Papers - African Journal of Biological Sciences, E-ISSN: 2663-2187, ...
Call for Papers - African Journal of Biological Sciences, E-ISSN: 2663-2187, ...Call for Papers - African Journal of Biological Sciences, E-ISSN: 2663-2187, ...
Call for Papers - African Journal of Biological Sciences, E-ISSN: 2663-2187, ...Christo Ananth
 
OSVC_Meta-Data based Simulation Automation to overcome Verification Challenge...
OSVC_Meta-Data based Simulation Automation to overcome Verification Challenge...OSVC_Meta-Data based Simulation Automation to overcome Verification Challenge...
OSVC_Meta-Data based Simulation Automation to overcome Verification Challenge...Soham Mondal
 
Model Call Girl in Narela Delhi reach out to us at 🔝8264348440🔝
Model Call Girl in Narela Delhi reach out to us at 🔝8264348440🔝Model Call Girl in Narela Delhi reach out to us at 🔝8264348440🔝
Model Call Girl in Narela Delhi reach out to us at 🔝8264348440🔝soniya singh
 
MANUFACTURING PROCESS-II UNIT-2 LATHE MACHINE
MANUFACTURING PROCESS-II UNIT-2 LATHE MACHINEMANUFACTURING PROCESS-II UNIT-2 LATHE MACHINE
MANUFACTURING PROCESS-II UNIT-2 LATHE MACHINESIVASHANKAR N
 
(MEERA) Dapodi Call Girls Just Call 7001035870 [ Cash on Delivery ] Pune Escorts
(MEERA) Dapodi Call Girls Just Call 7001035870 [ Cash on Delivery ] Pune Escorts(MEERA) Dapodi Call Girls Just Call 7001035870 [ Cash on Delivery ] Pune Escorts
(MEERA) Dapodi Call Girls Just Call 7001035870 [ Cash on Delivery ] Pune Escortsranjana rawat
 
Call Girls Service Nagpur Tanvi Call 7001035870 Meet With Nagpur Escorts
Call Girls Service Nagpur Tanvi Call 7001035870 Meet With Nagpur EscortsCall Girls Service Nagpur Tanvi Call 7001035870 Meet With Nagpur Escorts
Call Girls Service Nagpur Tanvi Call 7001035870 Meet With Nagpur EscortsCall Girls in Nagpur High Profile
 
(SHREYA) Chakan Call Girls Just Call 7001035870 [ Cash on Delivery ] Pune Esc...
(SHREYA) Chakan Call Girls Just Call 7001035870 [ Cash on Delivery ] Pune Esc...(SHREYA) Chakan Call Girls Just Call 7001035870 [ Cash on Delivery ] Pune Esc...
(SHREYA) Chakan Call Girls Just Call 7001035870 [ Cash on Delivery ] Pune Esc...ranjana rawat
 
What are the advantages and disadvantages of membrane structures.pptx
What are the advantages and disadvantages of membrane structures.pptxWhat are the advantages and disadvantages of membrane structures.pptx
What are the advantages and disadvantages of membrane structures.pptxwendy cai
 

Recently uploaded (20)

VIP Call Girls Service Kondapur Hyderabad Call +91-8250192130
VIP Call Girls Service Kondapur Hyderabad Call +91-8250192130VIP Call Girls Service Kondapur Hyderabad Call +91-8250192130
VIP Call Girls Service Kondapur Hyderabad Call +91-8250192130
 
HARMONY IN THE NATURE AND EXISTENCE - Unit-IV
HARMONY IN THE NATURE AND EXISTENCE - Unit-IVHARMONY IN THE NATURE AND EXISTENCE - Unit-IV
HARMONY IN THE NATURE AND EXISTENCE - Unit-IV
 
Introduction to IEEE STANDARDS and its different types.pptx
Introduction to IEEE STANDARDS and its different types.pptxIntroduction to IEEE STANDARDS and its different types.pptx
Introduction to IEEE STANDARDS and its different types.pptx
 
APPLICATIONS-AC/DC DRIVES-OPERATING CHARACTERISTICS
APPLICATIONS-AC/DC DRIVES-OPERATING CHARACTERISTICSAPPLICATIONS-AC/DC DRIVES-OPERATING CHARACTERISTICS
APPLICATIONS-AC/DC DRIVES-OPERATING CHARACTERISTICS
 
HARDNESS, FRACTURE TOUGHNESS AND STRENGTH OF CERAMICS
HARDNESS, FRACTURE TOUGHNESS AND STRENGTH OF CERAMICSHARDNESS, FRACTURE TOUGHNESS AND STRENGTH OF CERAMICS
HARDNESS, FRACTURE TOUGHNESS AND STRENGTH OF CERAMICS
 
Decoding Kotlin - Your guide to solving the mysterious in Kotlin.pptx
Decoding Kotlin - Your guide to solving the mysterious in Kotlin.pptxDecoding Kotlin - Your guide to solving the mysterious in Kotlin.pptx
Decoding Kotlin - Your guide to solving the mysterious in Kotlin.pptx
 
Microscopic Analysis of Ceramic Materials.pptx
Microscopic Analysis of Ceramic Materials.pptxMicroscopic Analysis of Ceramic Materials.pptx
Microscopic Analysis of Ceramic Materials.pptx
 
main PPT.pptx of girls hostel security using rfid
main PPT.pptx of girls hostel security using rfidmain PPT.pptx of girls hostel security using rfid
main PPT.pptx of girls hostel security using rfid
 
High Profile Call Girls Nagpur Meera Call 7001035870 Meet With Nagpur Escorts
High Profile Call Girls Nagpur Meera Call 7001035870 Meet With Nagpur EscortsHigh Profile Call Girls Nagpur Meera Call 7001035870 Meet With Nagpur Escorts
High Profile Call Girls Nagpur Meera Call 7001035870 Meet With Nagpur Escorts
 
Gfe Mayur Vihar Call Girls Service WhatsApp -> 9999965857 Available 24x7 ^ De...
Gfe Mayur Vihar Call Girls Service WhatsApp -> 9999965857 Available 24x7 ^ De...Gfe Mayur Vihar Call Girls Service WhatsApp -> 9999965857 Available 24x7 ^ De...
Gfe Mayur Vihar Call Girls Service WhatsApp -> 9999965857 Available 24x7 ^ De...
 
Call for Papers - African Journal of Biological Sciences, E-ISSN: 2663-2187, ...
Call for Papers - African Journal of Biological Sciences, E-ISSN: 2663-2187, ...Call for Papers - African Journal of Biological Sciences, E-ISSN: 2663-2187, ...
Call for Papers - African Journal of Biological Sciences, E-ISSN: 2663-2187, ...
 
OSVC_Meta-Data based Simulation Automation to overcome Verification Challenge...
OSVC_Meta-Data based Simulation Automation to overcome Verification Challenge...OSVC_Meta-Data based Simulation Automation to overcome Verification Challenge...
OSVC_Meta-Data based Simulation Automation to overcome Verification Challenge...
 
Roadmap to Membership of RICS - Pathways and Routes
Roadmap to Membership of RICS - Pathways and RoutesRoadmap to Membership of RICS - Pathways and Routes
Roadmap to Membership of RICS - Pathways and Routes
 
Model Call Girl in Narela Delhi reach out to us at 🔝8264348440🔝
Model Call Girl in Narela Delhi reach out to us at 🔝8264348440🔝Model Call Girl in Narela Delhi reach out to us at 🔝8264348440🔝
Model Call Girl in Narela Delhi reach out to us at 🔝8264348440🔝
 
MANUFACTURING PROCESS-II UNIT-2 LATHE MACHINE
MANUFACTURING PROCESS-II UNIT-2 LATHE MACHINEMANUFACTURING PROCESS-II UNIT-2 LATHE MACHINE
MANUFACTURING PROCESS-II UNIT-2 LATHE MACHINE
 
(MEERA) Dapodi Call Girls Just Call 7001035870 [ Cash on Delivery ] Pune Escorts
(MEERA) Dapodi Call Girls Just Call 7001035870 [ Cash on Delivery ] Pune Escorts(MEERA) Dapodi Call Girls Just Call 7001035870 [ Cash on Delivery ] Pune Escorts
(MEERA) Dapodi Call Girls Just Call 7001035870 [ Cash on Delivery ] Pune Escorts
 
Call Girls Service Nagpur Tanvi Call 7001035870 Meet With Nagpur Escorts
Call Girls Service Nagpur Tanvi Call 7001035870 Meet With Nagpur EscortsCall Girls Service Nagpur Tanvi Call 7001035870 Meet With Nagpur Escorts
Call Girls Service Nagpur Tanvi Call 7001035870 Meet With Nagpur Escorts
 
(SHREYA) Chakan Call Girls Just Call 7001035870 [ Cash on Delivery ] Pune Esc...
(SHREYA) Chakan Call Girls Just Call 7001035870 [ Cash on Delivery ] Pune Esc...(SHREYA) Chakan Call Girls Just Call 7001035870 [ Cash on Delivery ] Pune Esc...
(SHREYA) Chakan Call Girls Just Call 7001035870 [ Cash on Delivery ] Pune Esc...
 
What are the advantages and disadvantages of membrane structures.pptx
What are the advantages and disadvantages of membrane structures.pptxWhat are the advantages and disadvantages of membrane structures.pptx
What are the advantages and disadvantages of membrane structures.pptx
 
★ CALL US 9953330565 ( HOT Young Call Girls In Badarpur delhi NCR
★ CALL US 9953330565 ( HOT Young Call Girls In Badarpur delhi NCR★ CALL US 9953330565 ( HOT Young Call Girls In Badarpur delhi NCR
★ CALL US 9953330565 ( HOT Young Call Girls In Badarpur delhi NCR
 

DATA RATE LIMITS KEY FACTORS

  • 1. 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)  Noiseless Channel: Nyquist Bit Rate  Noisy Channel: Shannon Capacity  Using Both Limits Topics discussed in this section:
  • 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. 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. 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. 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. 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. 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. 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. Shannon’s Theorem  Shannon’s theorem gives the capacity of a system in the presence of noise. C = B log2(1 + SNR)
  • 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. 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. 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. 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. 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. 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. The Shannon capacity gives us the upper limit; the Nyquist formula tells us how many signal levels we need. Note