0% found this document useful (0 votes)
19 views32 pages

Disadvantages of DSP Compared to ASP

Uploaded by

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

Disadvantages of DSP Compared to ASP

Uploaded by

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

DIGITAL SIGNAL

PROCESSING
TLE 502

Dr. Anthony Ngozichukwuka


Uwaechia
1
Signal
■ Signals constitute an important part of our daily life. Anything that
carries some information is called a signal.
■ A signal is defined as a single-valued function of one or more
independent variables which contain some information.
■ We can also define a signal as a physical quantity that varies with time,
space or any other independent variable. A signal may be represented
in time domain or frequency domain.
■ A signal can be a function of one or more independent variables. That
is, a signal may be a function of time, temperature, position, pressure,
distance etc.
■ If a signal depends on only one independent variable, it is called a one-
dimensional signal (1D), and if a signal depends on two independent
variables, it is called a two- dimensional signal (2D). 2
System
■ A system is defined as an entity that acts on an input signal and
transforms it into an output signal.
■ A system is also defined as a set of elements or fundamental blocks
which are connected together and produces an output in response
to an input signal.
■ Systems may be single-input and single-output systems or multi-
input and multi-output systems. Example of a system includes Filter
or Amplifier.

3
Processing
■The operation performed on the signal by the system is called
Signal Processing. The system is characterized by the type of
operation that it performs on the signal. For example, if the
operation is linear, the system is called linear system.

CLASSIFICATION OF SIGNAL PROCESSING


■We can classify signal processing into the following:
– Analog signal Processing (ASP)
– Digital signal Processing (DSP)

4
Analog signal Processing (ASP)

■ If the input signal given to the system is analog then system does
analog signal processing. Ex Resistor, capacitor or Inductor,
Operational- amplifier (OP-AMP) etc.

Fig 1.1: Analog signal Processing

5
Digital signal Processing (DSP)

■ Digital signal processing (DSP) is the use of


digital processing, such as by computers or more
specialized digital signal processors, to perform a
wide variety of signal processing operations.
■ If the input signal given to the system is digital then system does
digital signal processing. Ex Digital Computer, Digital Logic
Circuits etc.
■ The devices called as ADC (analog to digital Converter) converts
Analog signal into digital and DAC (Digital to Analog Converter)
does vice-versa.

6
Fig 1.2: Digital Signal Processing (DSP)

■ Most of the signals generated are analog in nature. Hence, these signals
are converted to digital form by the analog to digital converter.
■ Thus, Analog to Digital Converter (ADC) generates an array of samples
and gives it to the digital signal processor. This array of samples or
sequence of samples is the digital equivalent of input analog signal.
■ The DSP performs signal processing operations like filtering,
multiplication, transformation or amplification operations over these
digital signals.
■ The digital output signal from the DSP is converted back to analog signal
by using a Digital to Analog Converter (DAC).
7
ADVANTAGES OF DSP OVER ASP

■ Digital signal processing has many advantages over analog signal


processing. Some of these are as follows:
– A digital programmable system allows flexibility in reconfiguring the
digital signal processing operations simply by changing the program.
Reconfiguration of an analog system usually implies a redesign of the
hardware followed by testing and verification
– Tolerances in analog circuit components and power supply make it
extremely difficult to control the accuracy of analog signal processor. A
digital signal processor provides better control of accuracy
requirements in terms of word length, floating – point versus fixed –
point arithmetic, and similar factors.

8
– Implementation in digital is much more cost effective than its
analog counterpart.
– DSP has a high level of accuracy. The filters designed in DSP have
firm control over output accuracy as compared to analog filters.

DISADVANTAGES OF DSP OVER ASP


■ Digital signal processing has many disadvantages over analog
signal processing. Some of these are as follows:
– Unlike ASP, when using DSP, there is a need for using anti-aliasing filter
before ADC as well as using a reconstruction filter after DAC. Due to the
use of this extra two modules (i.e., ADC and DAC), the complexity of
DSP based hardware increases.

9
– Signals having extremely wide bandwidths require fast –
sampling – rate ADCs. Hence, the frequency range of operation
of DSPs is limited by the speed of ADC.
– In analog signal processor, passive elements are used,
which dissipate very less power. In digital signal processor,
active elements like transistors are used, which dissipate
more power.

10
DISCRETE-TIME SIGNALS AND ITS
REPRESENTATION
■ Discrete-time signals are signals which are defined only at discrete
instants of time. For those signals, the amplitude between the two time
instants is just not defined.
■ For discrete- time signal, the independent variable is time n, and it is
represented by .
■ There are following four ways of representing discrete-time signals:
– Graphical representation
– Functional representation
– Tabular representation
– Sequence representation

11
1) Graphical representation

Consider a single with values

This discrete-time single can be represented graphically as shown as below

12
,

2) Functional Representation

 In this, the amplitude of the signal is written against the values of

 The signal given above can be represented using the functional


representation as follows:

{
−3 𝑓𝑜𝑟 𝑛=− 2
2 𝑓𝑜𝑟 𝑛=−1
¿
𝑥 ( 𝑛) = 0 𝑓𝑜𝑟 𝑛=0
3 𝑓𝑜𝑟 𝑛=1
¿ 1 𝑓𝑜𝑟 𝑛=2
¿ 2 𝑓𝑜𝑟 𝑛=3
13
,
3) Tabular Representation
■ In this, the sampling instant and the magnitude of the signal at the
sampling instant are represented in the tabular form.

-2 -1 0 1 2 3
-3 2 0 3 1 2

14
,
4) Sequence Representation

■ A finite duration sequence of the above can be represented as follow

𝑥 ( 𝑛 ) ={ − 3 2 0 3 1 2 }

■ The arrow mark denotes the term. When no arrow is indicated, the
first term corresponds to
■ So a finite duration sequence, that satisfies the condition for can be
represented as:
𝑥 ( 𝑛 ) ={ 3 5 2 1 4 7 }
15
ELEMENTARY DISCRETE-TIME SIGNALS

■ There are several elementary signals which play vital role in the study
of signals and systems
■ The standard discrete-time signals are as follows:
– Unit step sequence
– Unit ramp sequence
– Unit parabolic sequence
– Unit impulse sequence
– Sinusoidal sequence
– Real exponential sequence
– Complex exponential sequence

16
1) Unit Step Sequence

■ The step sequence is an important signal used for analysis of many


discrete-time systems. It exists only for positive time and is zero for
negative time.
■ It is equivalent to applying a signal whose amplitude suddenly
changes and remains constant at the sampling instants forever after
application.
■ In between the discrete instants, it is zero.
■ The discrete-time unit step sequence is defined as:

17
■ The shifted version of the discrete-time unit step sequence is defined as:

2) Unit Ramp Sequence


■ The discrete-time unit ramp
Figure Discrete–time sequence
(a) Unit is (b)
step function that sequence
Shifted unit step which
function starts at
and increases linearly with time and is defined as:

18
{
𝑟 ( 𝑛 ) = ¿ 𝑛 𝑓𝑜𝑟 𝑛 ≥ 0
¿ 0 𝑓𝑜𝑟 𝑛<0
■ It starts at and increases linearly with .
■ The shifted version of the discrete-time unit ramp sequence is defined
as:
{
𝑟 ( 𝑛 −𝑘 )= ¿ 𝑛 − 𝑘 𝑓𝑜𝑟 𝑛 ≥ 𝑘
¿ 0 𝑓𝑜𝑟 𝑛< 𝑘
■ The graphical representation of ) and is shown in Figure below [(a) and
(b)].

Fig.: Discrete–time (a) Unit ramp sequence (b) Shifted ramp sequence.
19
3) Unit Parabolic Sequence

■ The discrete-time unit parabolic sequence is defined as:

■ The shifted version of the discrete-time unit parabolic sequence is


defined as:

{
2
■ The graphical representation
( 𝑛− 𝑘 )
𝑝 (𝑛 − 𝑘 )=of¿ and 2is shown in 𝑛
𝑓𝑜𝑟 Figure
≥ 𝑘 1.5[(a) and
(b)].
¿0 𝑓𝑜𝑟 𝑛<𝑘

20
Fig.: Discrete–time (a) Parabolic sequence (b) Shifted parabolic sequence.
4) Unit Impulse Function or Unit Sample Sequences
■ The discrete-time unit impulse function , also called unit sample sequence, is
defined as:

{
𝛿 ( 𝑛 )= ¿ 1 𝑓𝑜𝑟 𝑛=0
¿ 0 𝑓𝑜𝑟 𝑛≠ 0
■ This means that the unit sample sequence is a signal that is zero everywhere, except at ,
where its value is unity. It is the most widely used elementary signal used for the
analysis of signals and systems. 21
■ The shifted unit impulse functionis defined as:

■ The graphical representation of and is shown in Figure 1.7[(a) and (b)].

Fig. 1.7: Discrete–time (a) Unit sample sequence (b) Delayed unit sample sequence.

22
5) Sinusoidal Sequence

■ The discrete-time sinusoidal sequence is given by

■ Where A is the amplitude, is angular frequency, is phase angle in


radians and is an integer. The period of the discrete-time sinusoidal
sequence is:

Fig. 1.8: 7 Discrete-time sinusoidal signal 23


6) Real Exponential Sequence

■ The discrete-time real exponential sequence a is defined as:


for all n

Fig.1.9: Discrete-time exponential signal for (a) (b) (c) (d).


24
7) Complex Exponential Sequence

■ The discrete-time complex exponential sequence is defined as:

 For , the real and imaginary parts of complex exponential sequence are
sinusoidal.
 For1, the amplitude of the sinusoidal sequence exponentially grows as
shown in Figure 1.10(a).
 For , the amplitude of the sinusoidal sequence exponentially decays as
shown in Figure 1.10(b).
25
Fig. 1.10: complex exponential sequence for (a) (b)

26
EXAMPLE 1.1 Find the following summations:

Solution:
(a) Given
We know that

27
(b) Given
We know that

28
(c) Given
We know that

29
(d) Given
We know that

30
(e) Given
We know that

31
Basic Operations On Sequences

32

You might also like