0% found this document useful (0 votes)
15 views5 pages

Understanding the Sampling Theorem

The document discusses the Sampling Theorem, which states that an analog signal can be accurately reconstructed if sampled at a rate greater than twice its maximum frequency (Nyquist rate). It also explains quantization, the process of converting continuous amplitude signals into discrete values, and the associated quantization error. Additionally, it touches on coding quantized samples with unique binary numbers based on the number of quantization levels.

Uploaded by

Imran Hossen
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
15 views5 pages

Understanding the Sampling Theorem

The document discusses the Sampling Theorem, which states that an analog signal can be accurately reconstructed if sampled at a rate greater than twice its maximum frequency (Nyquist rate). It also explains quantization, the process of converting continuous amplitude signals into discrete values, and the associated quantization error. Additionally, it touches on coding quantized samples with unique binary numbers based on the number of quantization levels.

Uploaded by

Imran Hossen
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd

Sampling Theorem:

Given any analog signal, how should we select the sampling period T or, equivalently,
the sampling rate Fs? To answer this question, we must have some information about the
characteristics of the signal to be sampled, ie., the frequency content of the signal. For
speech we know that the major frequency contents of the signal fall below 3000Hz, for
TV it is about 5MHz. However, if we know the maximum frequency content of the
general class of signals, we can specify the sampling rate necessary to convert the analog
signals to digital signals.

Lets consider an analog signal:

Where N denotes the number of frequency components. Say for speech, max frequency is
Fmax=3000Hz. We should know Fmax prior sampling. We can reconstruct the signal if
we sample the signal at the rate Fs > 2 Fmax.
Sampling theorem:

If the highest frequency contained in an analog signal xa(t) is Fmax. And the signal is
sampled at a rate Fs > 2fmax, then xa(t) can be exactly recovered from its sample values.

The sampling rate FN=2Fmax is called the Nyquist rate.

Example:

Consider the analog signal

What you take the sampling rate?

Sol:

In the signal:

F1=25Hz, F2=150Hz, F3=50Hz

So Fmax=150Hz

According to sampling theorem

Fs > 2Fmax=300 Hz

So sampling rate is FN=2fmax=300Hz.


Quantization:

The process of converting a discrete time continuous amplitude signal in to a digital


signal by expressing each sample values as a finite set of numbers of digits is called
quantization. So, Quantization is the process of converting a continuous range of values
into a finite range of discreet values. In digital signal processing, quantization is the
process of approximating ("mapping") a continuous range of values (or a very large set of
possible discrete values) by a relatively small ("finite") set of ("values which can still take
on continuous range") discrete symbols or integer values. For example, rounding a real
number in the interval [0,100] to an integer

The error introduced in representing the continuous valued signal by a finite set of
discrete value levels is called quantization error or quantization noise.
We denote the quantization operation on the samples x(n) as Q[x(n)] and let xq(n) denote
the sequence of quantized samples at the output of the quantizer. Hence

xq(n)= Q[x(n)]

error, eq(n)= xq(n)-x(n)

Coding of quantized samples:

It is assigned a unique binary number to each quantized level. If we have L levels we


need at least L different binary numbers.

If L=4, then binary bits b, is needs

You might also like