CONTENTS

Basic Signals
Convolution of continuous and discrete time signals
Fourier analysis and Fourier Transforms of
continuous time signals
Fourier analysis of discrete-time signals and
systems


BASIC CONTINUOUS SIGNALS
The Impulse
The unit impulse , also called the delta function. Defined by



Step and Ramp Functions
The unit-step function , is defined by,


The unit-ramp function ,is defined by,

( )
t o
( )
( )
0, 0
1 0
t
t
d
c
c
o
o c

=

= >

}
( )
u t
( )
0, 0
1, 0
t
u t
t
<

=

>

( )
0, 0
, 0
t
r t
t t
<

=

>

( )
r t
DISCRETE TIME SIGNALS
The Impulse
The unit -pulse , is defined by



Step and Ramp Functions
The unit-step function , is defined by,


The unit-ramp function ,is defined by,

| |
n o
| |
0, 0
1, 0
n
n
n
o
=

=

=

| |
u n
| |
1, 0,1,...
0, 1, 2...
n
u n
n
=

=

=

| |
, 0,1,...
0, 1, 2,...
n n
r n
n
=

=

=

| |
r n
SYSTEMS
A system is process in which input signals are
transformed to output signals.
Two important types of systems are:
o Continuous Time systems(CTS):
A system which takes in continuous time input
signals and generates continuous time output signals
are called CTS.
o Discrete Time systems(DTS):
A system which takes in discrete time input signals
and generates discrete time output signals are called
DTS.


PROPERTIES OF SYSTEM
Causality
A system is causal if for any time t
1
, the output response is does not
depend on values of the input
Linearity
Time Invariance
A system is time invariant if the input is time shifted the output also is
time shifted i.e,



Stability
A system is BIBO stable if bounded input results in a bounded
output.
1
t t <
( ) ( )
( ) ( )
1 1
x t y t
x t t y t t

LTI-SYSTEMS
The Convolution-Sum Representation of Discrete
LTI-Systems:
If an input , is applied to a LTI system, then its output can be
represented as a convolution sum given by,


The Convolution-Sum Representation of
Continuous LTI-Systems:
If an input , is applied to a LTI system, then its
output can be represented as a convolution sum
given by,



| |
x n
| |
y n
| | | | | | | | | |
*
k
y n x k h n k x n h n
+
=
= =

( )
x t
( ) ( ) ( ) ( ) ( )
* y t x h t d x t h t t t t

= =
}
PROPERTIES OF CONVOLUTION
The Commutative Property:



The Distributive Property:



The Associative Property:

| | | | | | | | | | | |
( ) ( ) ( ) ( ) ( ) ( )
* *
* *
k
x n h n h n x n h k x n k
x t h t h t x t h t x t d t t
+
=

= =
= =

}
| | | | | | ( ) | | | | | | | |
( ) ( ) ( ) ( ) ( ) ( ) ( ) ( )
1 2 1 2
1 2 1 2
* * *
* * *
x n h n h n x n h n x n h n
x t h t h t x t h t x t h t
+ = +
+ = +
| | | | | | ( ) | | | | ( ) | |
( ) ( ) ( ) ( ) ( ) ( ) ( ) ( )
1 2 1 2
1 2 1 2
* * *
* * * *
x n h n h n x n h n h n
x t h t h t x t h t h t
=
=
FOURIER ANALYSIS
Fourier found that a periodic signal can be expressed as a
sum of infinite sum of harmonically related sinusoids. This
expression of the function in terms of sinusoids came to be
known as Fourier Series
If a signal is periodic with period , then the function
can be expressed as Fourier Series of the Form






0
T ( )
f t ( )
f t
( )
( ) ( ) ( )
( ) ( ) ( )
( ) ( ) ( )
0 1 0 2 0 0
1 0 2 0 0
0 0 0
1
cos 2 cos 2 2 cos 2
sin 2 sin 2 2 sin 2
Or
cos 2 sin 2
n
n
n n
n
dc
ac
a a f t a f t a nf t
f t
b f t b f t b nf t
f t a a nf t b nf t
t t t
t t t
t t

=
+ + + + + (
=
(
+ + +
(

= + +

FOURIER COEFFICIENTS
The Fourier Series Coefficients for any periodic
waveform can be obtained by the equations:






( )
( )
( )
0
0
0
0
0
0
2
0
0 2
2
0 0 2
2
0 0 2
1
2 2
cos
2 2
sin
T
T
T
T n
T
T n
a f t dt
T
nt
a f t dt
T T
nt
b f t dt
T T
t
t

=
| |
=
|
\ .
| |
=
|
\ .
}
}
}
( )
f t
ALTERNATE FORM OF FOURIER SERIES
Alternate form of Fourier Series:






The plot of versus is called the amplitude
spectrum
The plot of versus is called the phase
spectrum

( ) ( ) ( )
0 1 0 1 0
1
2 2 1
cos 2 ... cos 2
where,
and tan
n n
n
dc
ac
n
n n n n
n
f t A A f t A nf t
b
A a b
a
t | t |
|

= + + + + +
| |

= + =
|
\ .

n
A
0
nf

n
|
0
nf
FOURIER TRANSFORMS
Fourier transforms of a waveform , is defined
by the integral


The Inverse Fourier transforms are defined by the
integral


( )
f t
( ) ( )
F f t dt e

=
}
( ) ( )
1
2
j t
f t F e dt
e
e
t

=
}
BASIC FOURIER TRANSFORM PROPERTIES
( ) ( ) ( ) ( )
( )
( )
( )
( )
( ) ( )
( ) ( )
( ) ( )
( ) ( )
( ) ( )
1 2 1 2
Property Time Domain Frequency Domain
Linearity
Differentiation
Integration 0
Reversal
Duality 2
Time Shift
Frequency Shift
Scaling
t
j T
j t
Af t Bf t AF BF
df t
j F
dt
F
f x dx F
j
f t F
F t F
f t T e F
e f t F
a f
e
|
e e
e e
e
t o e
e
e
t e
e
e |

+ +
+

}
( )
at F
a
e
| |
|
\ .
DISCRETE-TIME FOURIER TRANSFORM
The Fourier transform of a continuous-time signal


Discrete signal the Fourier transform is


A sufficient condition for to have DTFT is that it
should be absolutely summable.

( ) ( )
j t
X x t e dt
e
e

=
}
( ) | |
j n
n
X x n e

O
=
O =

| |
x n
| |
0
n
x n

=
<

SIGNAL THEORY PART 2

Circular Convolution
Z-transfroms
Introduction to Filters
QUESTIONS?