Unit - 1

Fall 2015

Signals - Introduction
Signal: Anything that carries some information can be called as
signal. A signal is also defined as any physical quantity that
varies with time, space or any other independent variable
or variables.
Eg: 1 = 5

Examples of signals:
1. Speech signal

2 = 20 2
2. ECG signal

Types of signals
Types:
1.

Continuous time signals

2. Discrete time signals

Continuous Signal or Analog Signal

Analog Signals are defined for all time values
Eg 1: ECG signal

Eg 2: () = 10(2 50 ) 10(341.4)
x(t) Vs time t

10

Amplitude=10, frequency
=341.4 rad /sec. or 50Hz

value of x(t)

4
2
0
-2
-4
-6
-8
-10

0.005

0.01

0.015
0.02
0.025
time t in Seconds

0.03

0.035

0.04

Discrete Signals
Defined for only discrete values of
time
Eg: value of temperature measured
at every hour inside a room.
25o C 25o C
20o C

25o C

22o C

8a.m 9 a.m 10a.m 11a.m 12 a.m

Basic Sequences
Unit sample (impulse) sequence
0 n 0
[n] =
1 n = 0

Unit step sequence

0 n < 0
u[n] =
1 n 0

1.5
1
0.5
0
-10

10

-5

10

-5

10

1.5
1
0.5
0
-10

Exponential sequences

-5

0.5

x[n] = An
0
-10

Discrete time signals: Sequences

A discrete time signal [n] is a function of an independent variable that is
an integer.

Representation of discrete time signals:

1. Functional representation:
1,
[] = 4,
0,

= 1,3
= 2

2. Tabular representation:
n

x[n] .

-2

-1

..

Discrete time signals: Sequences

3. Sequence representation:
An infinite duration signal or sequence with the time origin
= 0 indicated by symbol is represented as
[] =

. 0, 0, 1, 4, 1, 0, 0, .

A sequence x(n), which is zero for < 0, can be represented as

[] =

0, 1, 4, 1, 0, 0, .

4. Graphical representation:

Simple Manipulations of discrete time Signals

When a signal is processed, the signal undergoes many manipulations
involving both the independent and dependent variable. Some of
these are:
Folding
Shifting
Time scaling

Folding:
This operation is done by replacing the independent variable
n by -n
Shifting:
A signal [] may be shifted in time i.e; the signal can be

either advanced in time axis or delayed in time axis. The

shifted signal is represented by [ ], where k is an
integer.

If k is posotive, the signal is delayed by k units.

If k is negative, the signal is advanced by k units.
Scaling:
This involves to replace the independent variable n by kn,
where k is an integer. Scaling compresses or dilates a signal.

Problem: 1
A discrete time signal is shown in Figure. Sketch and label each of
the following signals.
(a) ( 2)

(b) (2)

(c) ()

(d) ( + 2)

Problem:2

A discrete time signal is defined as

1+ ,
3 1
3
= 1,
03
0,

a) Determine its values and sketch the signal .

b) Sketch the signals that result if we:

(i) First fold and then delay the resulting signal by four samples.

(ii) First delay by four samples and then fold the resulting signal.

c) Sketch the signal + 4 .

d) Compare the results in parts Q1(b) and (c) and derive a rule for obtaining the
signal + 4 from .

e) Express the signal in terms of and

Basic operations on Signals

The basic set of operations are
Addition
Multiplication
Scaling of sequences
Amplitude scaling of a signal by a constant A is accomplished by
multiplying the value of every signal sample by A.
=

< <

The sum of two signals 1 2 is a signal y(n), whose value at

any instant is equal to the sum of the values of those two signals at
that instant.
= 1 + 2 ,

< <

Basic operations on Signals

The product of two signals 1 2 is a signal y(n), whose value

at any instant is equal to the product he values of those two signals at

that instant.
= 1 2 ,

< <

Problem: 3
Using the discrete time signal 1 2 shown in Figure represent
each of the following signals by a graph and by a sequence of numbers.

a) 1 = 1 + 2
b) 2 = 2 1

c) 3 = 1 2

Block Diagram Representation of Discrete Time Systems

Some basic building blocks are used to represent a discrete time
systems.
1. An adder
2. A Constant Multiplier
3. A signal multiplier
4. A unit delay element
5. A unit advance element

An adder:
1 ()
2 ()

A Constant Multiplier:

= 1 + 2 ()

()

= ()

Signal Processing
Signal Processing is a method of extracting
information from the signal which in turn
depends on the type of signal and the nature of
information it carries.

What is a system?
A system is formally defined as an entity that manipulates one or
more signals to accomplish a function, thereby yielding new signals.

input
signal

system

output
signal

Some Interesting Systems

Communication system

Control systems

Remote sensing system

Perspectival view of Mount Shasta (California), derived from a pair of stereo

radar images acquired from orbit with the shuttle Imaging Radar (SIR-B).
(Courtesy of Jet Propulsion Laboratory.)

Biomedical system(biomedical signal

processing)

Classification of discrete time systems

()
Common system properties:
Static

VS

Dynamic

Time - invariant

VS

Time variant

Linear

VS

Nonlinear

Casual

VS

Non-causal

Stable

VS

unstable

Classification of discrete time systems

Why is this so important?
mathematical techniques developed to analyze systems are often
contingent upon the general characteristics of the systems being
considered.
For a system to possess a given property, the property must hold for
every possible input signal to the system.

Classification of discrete time systems

Static Vs Dynamic Systems
A discrete-time system is called static or memory less if its output at any instant n
depends at most on the input sample at the same time, but not on past or future
samples of the input. Otherwise the system is dynamic.
A system is static, if and only if

Example:

Determine whether the following systems are static or dynamic:

a) = 1

b) = 2 + ()

Classification of discrete time systems

Time invariant vs Time variant Systems
Time-invariant system: input-output characteristics do not change with
time
A system is time-invariant if

( )

For every input and every time shift k

Example: Determine if the system shown in Figure is time-invariant or time

variant.

Classification of discrete time systems

Linear vs Nonlinear Systems
Linear system: obeys superposition principle
A system is said to be linear if
1 1 + 2 2

= 1 1

+ 2 [2 ]

For any arbitrary input sequence 1 2 , and any arbitrary

conditions 1 2

Example:

Determine whether the following systems are linear or non linear:

a) = +
b) = 2

c) = ()

1
1

Classification of discrete time systems

Casual vs Non-casual Systems
Causal system: output of system at any time n depends only on present
and past inputs
A system is said to be casual if
= , 1 , 2 ..

For all n
Example:

Test whether the following systems are causal or non causal:

a) = +

b) = + ( 1)

Classification of discrete time systems

Stable vs Unstable Systems
Bounded input Bounded output (BIBO) stable: every bounded input
produces a bounded output
A system is BIBO stable if
for all n

<

<

Block Diagram Representation of Discrete Time Systems

A signal Multiplier:
1 ()

= 1 2 ()

2 ()

A unit Advance:

A unit Delay:
()

= ( 1)

()

= ( + 1)

Problem: 4
Using basic building blocks, sketch the block diagram representation of the
discrete time system described by the input-output relation.
1
1
1
= 1 + + ( 1)
4
2
2

Impulse Response
x(n)=(n)
T[]

h(n)=T[(n)]
h(n)

(n)
0

(n-5)
0

h(n-5)
0 5

Convolution Sum
(n)

h(n)
T[]

y(n)

x(n)
y ( n) =

x(k )h(n k ) = x(n) * h(n)

k =

convolution
A linear shift-invariant system is completely characterized by its
impulse response.

Characterize a System
x(n)

h(n)

x(n)*h(n)

Useful equations to compute

convolution
For geometric series

For arithmetic series

35

Example
x ( n) = u ( n) u ( n N )

0 1 2 3 4 5 6

a n
h( n) =
0

n0
n<0

0 1 2 3 4 5 6

y(n)=?

Example
y ( n) = x ( n) * h( n) =

x(k )h(n k )

k =

x(k)
k
0 1 2 3 4 5 6

h(k)

h(0k)

0 1 2 3 4 5 6

0 1 2 3 4 5 6

Example
y ( n) = x ( n) * h( n) =

x(k )h(n k )

k =

x(k)
k
0 1 2 3 4 5 6

compute y(0)
h(0k)

0 1 2 3 4 5 6

compute y(1)
h(1k)

0 1 2 3 4 5 6

How to computer y(n)?

Example
Two conditions have to be considered.
y ( n) = x ( n) * h( n) =

x(k )h(n k )

k =

n<N and nN.

x(k)
k
0 1 2 3 4 5 6

compute y(0)
h(0k)

0 1 2 3 4 5 6

compute y(1)
h(1k)

0 1 2 3 4 5 6

How to computer y(n)?

Example
y ( n) = x ( n) * h( n) =

x(k )h(n k )

k =

n<N
n

k =0

k =0

N 1

N 1

k =0

k =0

y (n) = a n k =a n a k

( n +1)
1
n
1

a
a

a
=a n
=
1
1 a
1 a 1

nN
y (n) = a n k =a n a k

N
n
n N
a
a
a

1
=a n
=
1
1 a
1 a 1

Example
y ( n) = x ( n) * h( n) =

x(k )h(n k )

k =
5
4
3

n<N
n

y (n) = a n k =a n a k

2
1
0
0

k =0
10

15

k =0
20

( n +1)
1
n
1

a
a
a
=a n
=
1
1 a
1 a 1
25

30

35

40

45

nN
N 1

N 1

k =0

k =0

y (n) = a n k =a n a k

N
n
n N
1

a
a
a
=
=a n
1
1 a
1 a 1

50

Convolution
computation in tabular
form

Problem: 5
Compute the convolution () of the signals by tabulation method.
1, 1, 0, 1, 1
1, 2, 3, 4
and =
=

Solution:

The values of :
=

=
=

=
=

Do by yourself
Determine the convolution () of the signals by analytical method.
1
06
= 3 ,
0,

1,
2 2
=
0,