Scribd
Upload
352 views

Noiseless Channel: Nyquist Bit Rate Noisy Channel: Shannon Capacity Using Both Limits

This document discusses data rate limits in communications. It introduces the Nyquist bit rate, which gives the maximum bit rate for a noiseless channel based on bandwidth and number of signal levels. It also introduces Shannon capacity, which provides the maximum bit rate for a noisy channel based on bandwidth and signal-to-noise ratio. Examples are provided to demonstrate calculating bit rates using these formulas for different channel parameters and signal levels. The key point is that Nyquist provides the limit for noiseless channels while Shannon provides the limit for noisy channels.

Uploaded by

Sunny Bodiwala
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
352 views

Noiseless Channel: Nyquist Bit Rate Noisy Channel: Shannon Capacity Using Both Limits

This document discusses data rate limits in communications. It introduces the Nyquist bit rate, which gives the maximum bit rate for a noiseless channel based on bandwidth and number of signal levels. It also introduces Shannon capacity, which provides the maximum bit rate for a noisy channel based on bandwidth and signal-to-noise ratio. Examples are provided to demonstrate calculating bit rates using these formulas for different channel parameters and signal levels. The key point is that Nyquist provides the limit for noiseless channels while Shannon provides the limit for noisy channels.

Uploaded by

Sunny Bodiwala
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/ 10

3-5 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)

Topics discussed in this section:


 Noiseless Channel: Nyquist Bit Rate
 Noisy Channel: Shannon Capacity
 Using Both Limits

3.1
Note

Increasing the levels of a signal


increases the probability of an error
occurring, in other words it reduces the
reliability of the system. Why??

3.2
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.3
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.4
Example 3.34

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

3.6
Example 3.35

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

3.7
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?
Solution
We can use the Nyquist formula as shown:

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.8
Shannon’s Theorem

 Shannon’s theorem gives the capacity


of a system in the presence of noise.

C = B log2(1 + SNR)

3.9
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 capacity C is calculated as

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.10
Note

The Shannon capacity gives us the


upper limit; the Nyquist formula tells us
how many signal levels we need.

3.16

You might also like