Unit1 1SS1
Unit1 1SS1
Unit1 1SS1
Signal:
Any time varying physical phenomenon that can convey information is called signal. Some
examples of signals are human voice, electrocardiogram, sign language, videos etc. There are
several classifications of signals such as Continuous time signal, discrete time signal and digital
Ex: voice, television picture, telegraph.
Continuous Time signal – If the signal is defined over continuous-time, then the signal is a
continuous-time signal.
Discrete Time signal – If the time t can only take discrete values, such as t=kTs is called
Discrete Time signal
The signals that are discrete in time and quantized in amplitude are called digital signal. The
term "digital signal" applies to the transmission of a sequence of values of a discrete-time signal
in the form of some digits in the encoded form.
Elementary CT signals
1 if t 0
u (t )
0 if t<0
Graphically it is given by
Ramp Signal:
t if t 0
r(t)=
0 if t <0
Graphically it is given by
Pulse Signal:
A signal is having constant amplitude over a particular interval and for the remaining
interval the amplitude is zero.
Impulse Signal:
1 if t=0
δ(t)=
0 if t 0
Exponential Signal:
Exponential signal is of two types. These two type of signals are real exponential signal and
complex exponential signalwhich are given below.
x(t)=Aeat
Several basic operations by which new signals are formed from given signals are familiar from
the algebra and calculus of functions.
1. Amplitude Scaling :
y(t)= a x(t)
where a is a real (or possibly complex) constant. ax(t) is a amplitude scaled version of
x(t) whose amplitude is scaled by a factor a.
2. Amplitude Shift:
y(t)= x(t)+ b
The even xe(t)and odd xo(t) parts of a signal x(t) are given by
1
xe(t)= [ x(t ) x(t )]
2
1
xo(t)= [ x(t ) x(t )]
2
Proof:
Eq 1 + Eq 2
Eq 1 - Eq 2
Deterministic Signal:
Deterministic signals are those signals whose values are completely specified for any
given time. Thus, a deterministic signals can be modeled exactly by a mathematical
formula are known as deterministic signals.
Nondeterministic signals and events are either random or irregular. Random signals are also
called non deterministic signals are those signals that take random values at any given time and
must be characterized statistically.Random signals, on the other hand, cannot be described by a
mathematical equation they are modeled in probabilistic terms.
Fig.Random signal
Periodic signal:
A signal is said to be periodic if it repeats itself after some amount of time x(t+T)=x(t), for some
value of T. The period of the signal is the minimum value of time for which it exactly repeats
itself.
Fig. Periodic signal Fig.2Aperiodic signal
Signal which does not repeat itself after a certain period of time is called aperiodic signal. The
periodic and aperiodic signals are shown in Figure
A CT signal x(t) is said to be periodic if it satisfies the following property: x(t)=x(t+T) at all
time t, where T=Fundamental Time Interval (T=2π/ω)
Ex:
Energy Signal:
E x(t ) 2dt
Power Signal:
1 T
T 2T T
P lim1 x(t ) 2dt
If 0<E<∞ then the signal x(t) is called as Energy signal. However there are signals where this
condition is not satisfied. For such signals we consider the power. If 0<P<∞ then the signal is
called a power signal.Note that the power for an energy signal is zero (P=0) and that the
energy for a power signal is infinite
Problem 1:
Determine if the following signal is Energy signal, Power signal, or neither, and evaluate E and P
for the signal a(t)=3 sin(2πt) ,-∞<t<∞
So, the energy of that signal is infinite and its average power is finite (9/2). This means that it is
a power signal as expected. It is a power signal.\
Signal that are zero for all negative time, that type of signals are called causal signals, while the
signals that are zero for all positive value of time are called anti-causal signal.
A non-causal signal is one that has non zero values in both positive and negative time. Causal,
non-causal and anti-causal signals are shown below in the Figure 4(a), 4(b) and 4(c) respectively.
The maximum frequency component of g(t) is fm. To recover the signal g(t) exactly from its
samples it has to be sampled at a rate fs ≥ 2fm.
Proof: Let g(t) be a band limited signal whose bandwidth is fm (ωm = 2πfm).
• Let gs(t) be the sampled signal. Its Fourier Transform Gs(ω) is given by
Aliasing
Aliasing is a phenomenon where the high frequency components of the sampled signal
interfere with each other because of inadequate sampling ωs < 2ωm.
What is DSP?
DSP is a technique of performing the mathematical operations on the signals in digital
domain. As real time signals are analog in nature we need first convert the analog signal to
digital, then we have to process the signal in digital domain and again converting back to analog
domain. Thus ADC is required at the input side whereas a DAC is required at the output end. A
typical DSP system is as shown in figure
we can have two kinds of signals-continuous time and discrete time. And then we also
emphasized the need for processing: why should one process a signal? This is to obtain a better
quality signal than the original one. It could be for example, noise filtering or improving the
quality of a picture in terms of brightness or contrast or whatever it is.
Even if the signal is analog, one prefers to use DSP. The reasons are many. DSP has many
advantages over ASP or Analog Signal Processing. And many a times it happens to be a less
costly proposition. Digital IC’s are available off the shelf at very low cost and therefore in many
cases, analog signal processing gives way to Digital Signal Processing even if the original signal
is analog.
How it is done is represented by this block diagram where the input is analog CT; then we have a
sample and hold device which basically consists of a switch which samples the analog signal and
holds the samples for some time so that it can be converted to a digital form, because conversion
from analog to digital requires time. During that time the signal must be held. After the A to D,
you get a coded signal, whose usual form is binary. This is then processed by a digital processor.
What basically the DSP does is to combine signals by multiplication, addition and by recalling
past signals, through delays. There are basically three operations: delay, multiplication, and
addition. So this is what the digital processor does. It is a very simple device, it simply performs
3 operations. Multiplication is repeated addition, with only two signals at a time; subtraction is
also a form of addition with one of these signals negated or the sign bit changed. So, there is no
integration, there is no differentiation; there are no complicated operations which limits the
usefulness of analog processing. The output of the digital processor is also digital, a sequence of
numbers, and in order that output will be useful, you must convert it back to analog form. So you
have a D to A or digital to analog converter. The output of the digital to analog converter is in
the form of stair cases.
The signal changes from one level to the next and then stays. The abrupt change gives rise to
high frequencies in the signal. These high frequencies present in the signal have to be gotten rid
of by an analog low pass filter, and finally this analog output is the output that is to be used. It
could be, for example, a piece of music which has to be filtered from surrounding noise and
perhaps mixed with other signals, and finally it has to be played. It has to be heard on the loud
speaker and therefore you do require an analog output. Pictorially this slide represents the basic
operations.
Linear/Nonlinear
• A system is said to be linear if the following two properties hold:
1. If x(t) → y(t), then αx(t) → αy(t) for any real number α
2. If x1(t) → y1(t) and x2(t) → y2(t), then
(x1(t)+x2(t)) → (y1(t)+y2(t)).
Memoryless/With Memory
• A system is said to be memoryless if the value of the output signal at any time depends only on
the value of the input signal at that time, i.e., if x is the input and y the output, then y(t0) depends
only on x(t0) for any t0.
• A system is said to have memory if it is not memoryless, i.e., a system is said to have memory
if the value of the output signal at some time depends on the values of the input signal at other
time instants also.
Causal/Noncausal
• A system is said to be causal if y(t0), i.e., the value of the output signal at time t0, does not
depend on the values of the input signal at any time instants t > t0, i.e., the value of the output
signal at any time does not depend on future values of the input signal.
• Equivalently, a system is said to be causal if the following property
holds:
If x1(t) → y1(t) and x2(t) → y2(t), and if x1(t) = x2(t) for all t ≤ t0,
then y1(t) = y2(t) for all t ≤ t0.
• A system which is not causal is said to be noncausal
If a system is both linear (L) and time-invariant (TI), then it is said to be LTI. We will mainly
focus on LTI systems.
BIBO Stability
BIBO stands for bounded input, bounded output. BIBO stable is a condition such that any
bounded input yields a bounded output. This is to say that as long as we input a stable signal, we
are guaranteed to have a stable output.
Continuous-Time Condition for BIBO Stability is
Definition of the Laplace Transform
The (bilateral) Laplace transform of the function x(t) is denoted as L{x(t)} or X(s) and is defined
as
where s = Re{s}. We refer to x(t) and X(s) as a Laplace transform pair and denote this
relationship as
Two different versions of the Laplace transform are commonly used. The first is the bilateral
version, as introduced above. The second is the unilateral version. The unilateral Laplace
transform is most frequently used to solve systems of linear differential equations with nonzero
initial conditions. As it turns out, the only difference between the definitions of the bilateral and
unilateral Laplace transforms is in the lower limit of integration. In the bilateral case, the lower
limit is −¥, whereas in the unilateral case, the lower limit is 0.
Laplace Transform Examples
Example 1. Find the Laplace transform X(s) of the signal x(t) = e−atu(t).
Solution. Let s =s + jw where s and w are real. From the definition of the Laplace transform, we
have
At this point, we substitute s = s + jw in order to more easily determine when the above
expression converges to a finite value. This yields
Example 2. Find the inverse Laplace transform of
Taking the inverse Laplace transform of both sides of this equation, we have