Vous êtes sur la page 1sur 29

# Contents

## Manual for K-Notes ................................................................................. 2

Signals ..................................................................................................... 3
LTI Systems ............................................................................................. 5
Continuous Time Fourier series ......................................................... 13
Fourier Transform ................................................................................. 16
Laplace Transform ................................................................................ 19
Z Transform ........................................................................................ 22
Sampling ............................................................................................... 26

1

## Manual for K-Notes

Why K-Notes?
Towards the end of preparation, a student has lost the time to revise all the chapters from his /
her class notes / standard text books. This is the reason why K-Notes is specifically intended for
Quick Revision and should not be considered as comprehensive study material.
What are K-Notes?
A 40 page or less notebook for each subject which contains all concepts covered in GATE
Curriculum in a concise manner to aid a student in final stages of his/her preparation. It is highly
useful for both the students as well as working professionals who are preparing for GATE as it
comes handy while traveling long distances.
When do I start using K-Notes?
It is highly recommended to use K-Notes in the last 2 months before GATE Exam
(November end onwards).
How do I use K-Notes?
Once you finish the entire K-Notes for a particular subject, you should practice the respective
Subject Test / Mixed Question Bag containing questions from all the Chapters to make best use
of it.

2

Signals

In continuous time signals independent variable is continuous and thus these signals are
defined for a continuum of values of independent variable.

Discrete time signals are only defined at discrete times and consequently for these
signals the independent variable takes discrete set of values.

x(t) = sin t

## These signals can be represented as a series of numbers like

x[n] = [5, 4, 5, 7, 9, 2]
Arrow indicates reference point or x 

x[n] = sin n 4

## Energy & Power Signals

Interval ,
Energy of continuous time signal
E

lim

T T

x t dt

x t

dt

E

lim N
2
2
x
n

x n

T nN
n

P

lim

1
T 2T

T x t

dt

## Power of discrete time signals

P

N
lim
2
1
x n

N 2N 1 nN

Signals having non-zero (finite) power and infinite energy are called as Power Signals.
ex.

x(t) = sint

Signals having finite (non-zero) energy and zero power are called as Energy Signals.
ex.

x[n] = [1, 2, 3, 4]

## A signal is said to be even if it satisfies the condition

x(t) = x (t) or x [n] = x[n]

## A signal is said to be odd if it satisfies the condition

x(t) = x(t) or x [n] = x[n]

Any signal (even those which are neither odd nor even) can be broken into odd & even
parts

Odd Part
x0 t

Even Part
xe t

x t x t
2
x t x t
2

; x0 n

x n x n

; xe n

2
x n x n
2

x(t + T) = x(t)
x[n + N] = x[n]

## Otherwise, the signals are said to be aperiodic.

LTI Systems
Classification
(i) Linear & Non-Linear Systems
For Linearity
if x1 t y1 t
x2 t y 2 t

## then, this condition must be true

1x1 t 2 x2 t 1y1 t 2 y 2 t
Example : y(t) = t x (t) is linear
y[n] = 2x [n] + 3 is non-linear
(ii) Time Invariant & Time-variant Systems
For system to be time-invariant the
following condition must hold true
x(t - ) y(t )

## It means that following two realizations must be equivalent

The simplest way to verify this is to check the coefficient of t inside x(t)
eg.

## y(t) = tx(t) is time invariant

but y(t) = tx(2t) is time variant as coefficient of t in side x(t) is not 1

## (iii) Causal & Non-causal Systems

The output should depend only on present & past values of input.

ht 0 V t 0

h[n] = 0 V n < 0

DT :

hk
K

; CT :

h d

## (v) LTI systems with or without memory

The output at any time should depend only on value of input at the same time.

h[n] = 0 V n 0
h[n] = k [n]

h(t) = 0 V t 0
h [t] = k [t]

## (vi) Invertible Systems

The system is invertible if there exists h1(t) such that
Thus h(t) * h1(t) = t

Shifting
Delay
if

if

## shift the waveform left by the amount of advance

Scaling
Compression
if

Replace upper & lower limit by original limit divided by compression factor

Expansion
if

Replace upper & lower limit by original limit multiplied by expansion factor.

## LTI system (Linear Time Invariant Systems)

Any continuous time or discrete time system can be represented in terms of impulses.

x t

x t d

x k n k

x[n]

LTI systems are characterized on the basis of Impulse Response h(t) or h[n]

## Due to time invariance property of LTI system

if n h n
n k h n k

since x n

y n

x k

n k

x k hn k x n * hn = convolution sum

y t

x h t x t * h t

## The condition for causality of system then becomes

h[n] =0 V n < 0 ; h(t) = 0 V t < 0

## Suppose x [n] = u[n]

h[n] = [1, 2, 5, 7, 9]

= convolution integral

## Flip either x[n] or h[n] about y-axis

Here, we flip x[n]

For y

## The only overlapping between the two is at k = 0, 1, 2

y  = x h  + x  h  + x  h 
=1x5+1x2+1x1
=8
For y 

## y  = x  h  + x  h  + x  h  + x  h 

= 1 x 7 + 1 x 5 + 1 x 1 x 1 x 2 = 15
Similarly, we can calculate all values of y[n]
y[n] = [2, 3, 8, 15, 24, 24..]
Calculating Convolution Integral
Assume x (t) = u (t)
h (t) =

10

Step 1
Flip either x(t) or h(t)
Here, we flip h(t)

Step 2
Shift h( ) by amount t to the right to calculate y(t) by calculating overlapping between
h t & x

Overlapping area
1 t

1.1d 1 t

if t < 1
so, overlapping area = 0

if t > 1
overlapping area = 2

11

## Properties of Convolution Sum

1) Commutative Property
x[n] * h[n] = h[n] * x[n]
2) Distributive Property
y1[n] = x[n] * h1[n]
y2[n] = x[n] * h2[n]
y [n] = y1[n] + y2[n] = x[n] * h1[n] + x2[n]*h2[n]
= x[n] * { h1[n] + h2[n] }
3) Associative Property
{x[n] * h1[n] }* h2[n] = { x[n]* h2[n] } * h1 [n]
Same properties will apply for continuous time domain for convolution integral.
Parallel & Cascade structure of LTI systems
Parallel:

## y[n] = x[n] * ([h1 [n] + h2 [n]])

12

Frequency Response
The frequency response of any LTI system is given by its Fourier Transform.

jw

DT: H e

CT: H jw

h n e jwn

ht e

jwt

dt

## Group delay & Phase delay

Assuming transfer function of system is H(s)
jwt
input is x(t)= e
j w
jwt
H jw e e jwt
Output: H jw e

= H jw e

j wt w

w ArgH jw

Group Delay, g w
Phase Delay, w

d w
dw
w
w

## Continuous Time Fourier series

Fourier states that any periodic signal can be represented by a set of complex exponential
signals provided that it satisfies Drichlet Conditions.
Drichlet conditions
(i) Over any period x(t) is absolutely integrable
i.e.,

0 x t dt

(ii) In a finite time interval, x(t) has a finite number of maxima & minima
(iii) It should have finite number of discontinuities in the given interval
Fourier series as generally expressed in 2 forms.

Trigonometric

Exponential

13

## Trigonometric Fourier Series

Analysis equations
T

a0

1
x t dt
T 0

ak

2
x t cos k0 t dt
T 0

bk

2
x t sin k0 t dt
T 0

where 0 2
T

Synthesis equations
x t a0

k -
k 0

ak cosk 0t

k
k 0

bk sink 0t

## Exponential Fourier Series

Analysis equations
Ck

1
jk0t
x t e
dt
T 0

Synthesis equations

x t

CK e

jk0t

where 0 2
T

## Important facts about Trigonometric Fourier series

(i) Any odd signal contains only sine terms in Fourier series.
(ii) Any even signal contains only cosine terms in Fourier series.
(iii) For halfwave symmetric signal
x t T 2 x t

## Only odd harmonics are present

i.e., k = 1, 3, 5.

14

## Properties of complex exponential Fourier Series

(i) Linearity
F.S.
If x t
ak
F.S.
y t
bk
F.S.
A ak + B bk
then Ax (t) + By (t)

(ii)

Time-shifting
F.S.
if x t
ak

-jk0t0

F.S.
x t t0
e

ak where 0 2
T

(iii) Time-Reversal
F.S.
if x t
ak
F.S.
x t
ak

x(t) = x(t)
ak ak

x(t) = x (t)
ak ak

F.S.
if x t
ak
F.S.
x t
ak

## but 0 is replaced by 0 , though Fourier series coefficients remain same.

(v) Multiplication
F.S.
if x t
ak
F.S.
y t
bk
F.S.
z t x t y t
ck

Ck

bp ak p
P

= convolution sum

15

## (vi) Parsevals Relation

Energy in time domain = Energy frequency Domain

2
1
2
x
t
dt

ak

T T
k
F.S.
where x t
ak

IMPORTANT DUALITY
A signal discrete in one domain is periodic in other domain & vice versa.
Example: For continuous Time Fourier Series, x (t) is periodic in time domain & hence Fourier
Series exists where coefficients exist for frequency integral multiple of " 0 " & hence is discrete.

Fourier Transform
Fourier series exists only for periodic signals, Fourier series converges to Fourier Transform
which is continuous as compared to Fourier series which is discrete.
Continuous Time Fourier Transform
Analysis equation
X jw

x t e

jwt

dt

Synthesis equation
x t

1
jwt
X jw e dw
2

16

## Properties of Continuous Time Fourier Transform

Signal
x(t)
y(t)
Ax(t)+By(t)
x(t-t0)

Fourier Transform
X(jw)
Y(jw)
AX(jw)+BY(jw)

x*(t)
x(-t)
x(at)

X*(-w)
X(-w)

x(t)*y(t)
d
x(t)
dt

X(jw)Y(jw)
jwX(jw)

x(t)y(t)

1
X(w) * Y(w)
2

1
X jw X 0 w
jw

x d

tx(t)

Ev{x(t)}
Od{x(t)}
X(t)
j0 t

x t

x t

d
X jw
dw

Re{X(jw)}
jIm{X(jw)}
2x(-w)
X(w-w0)

Parsevals Relation

X w

1 jw
X
a a

jt0

2
1
x w dw

17

## Some common Fourier Transform Pairs

Signal

ak e
K
e

Fourier Transform

jkw0t

ak k0

2 0

jkw0t

cos w 0 t

0 0

sin w 0 t

0
0
j

2
2k

T K
T
2sin T1

t nT
n
1, t T1
x t
0, t T1
(sin wt)/t

1,
x
0,

w
w

1

j

u(t)

t t0

jt0

eatu t ,Re a 0

1
a j

18

Laplace Transform

Laplace Transform is more general than Fourier Transform but can only be computed in
Region of Convergence (ROC), so it cannot be computed V s
S jw; such that
ROC =
t
dt
x t e

## Laplace transform becomes Fourier transform for 0 , if it lies in ROC.

Analysis Equations
for bilateral Laplace Transform
H(s) =

ht e

st

dt

## for unilateral Laplace Transform

H(s) =

ht e

st

dt

Synthesis Equation
j

1
x(t) =
x s est ds
2j j

Properties of ROC
(i) ROC consists of a collection of lines parallel to jwaxis in splane.
such that

x t e

dt

(ii) If X (s) is rational, then ROC does not contain any poles.
(iii) If x(t) is of finite duration & absolutely integrable, then ROC is entire s-plane.
(iv) If x(t) is right sided signal (i.e., it is zero before some time) and if Re(s) = 0 is in the
ROC, then all values of s for which Re(s) > 0 are also in ROC.

19

(v) If x(t) is left sided, (i.e., if it is zero after some time), and if Re (s) = 0 is in ROC, then
all values of s for which Re(s) < 0 are also in ROC.
(vi) If x(t) is twosided signal and if the line Re (S) = 0 is in ROC, then the ROC consists
of a strip in splane include the line Re (S) = 0
(vii) If X(s) is rational, and
x(t) is right sided signal, then ROC is right of right most pole.
x(t) is left sided signal, then ROC is left of left most pole.
Properties of Laplace Transform
Signal
x(t)
x1(t)

Transform
X(s)
X1(s)

ROC
R
R1

x2(t)

X2(s)

R2

ax1(t) + bx2(t)

aX1(s) + bX2(s)

At least R1 R2

x t t0

e 0 x t
st

X s s0

x (at)

1
X s
a
a

x1 t * x2 t

X1 s X2 s

d
x t
dt
tx(t)
t

x d

st0

X s

R
Shifted version R [i.e., s is in
ROC if s s0 is in R]
Scaled ROC i.e., s is ROC if
s
is in R
a
At least R1 R2

sX s

At least R

d
x s
ds
1
X s
s

20

At least R

Signal
t
u(t)
u(t)
tn1
ut
n 1 !

Transform
1
1
s
1
s
1 n
s
1

tn1
u t
n 1 !
eatu t

- eatu t
tn1
eat u t
n 1 !
tn1 at
e ut
n 1 !

t T

cos 0 t u t
sin 0 t u t
eat cos 0 t u t

eat sin 0 t u t

Re {s} > 0
Re {s} < 0
Re {s} > 0
Re {s} < 0

sn

1
sa
1
sa
1

ROC
All s

Re {s} > a
Re {s} < a
Re {s} < a

s a
1

Re {s} > a

s a

esT
s
2
s 20
0
2

All s
Re {s} > 0
Re {s} > 0

s 0
sa

Re {s} > a

s a 20
0

Re {s} > a

s a2 20

21

## Initial and Final Value Theorem

x 0
x

lim
sX s initial value
s

lim
s X s Final value, first stability should be ensured, else final value does
s0
not exist.

Stability

h t dt

## ; ROC of H(s) should include 0 .

Causality
h(t) = 0, t < 0 i.e., right sided signal
ROC should be right sided
ROC should include Right half plane.
but converse is not true.

Z Transform
It is generalization of Discrete Time Fourier Transform
Analysis Equation

H z

h k z k

Synthesis Equation
h[n]

1
H z zn1dz

2j

22

## ROC for Z-Transform

Z Transform also exists only inside ROC

x n r n
n

## Left Half plane is mapped to interior of unit circle.

Properties of ROC
(i) The ROC x(z) consists of a ring in the z plane centered about the origin.
(ii) The ROC does not contain any poles.
(iii) If x[n] is of finite duration, then ROC is the entire z plane except possibility at z = 0
and/or z =
(iv) If x[n] is a right sided sequence and if the circle, | z | = r0 is in the ROC, then all finite
values of z, for which | z | > r0 will also be in ROC.
(v) If x[n] is a left sided sequence, and the circle | z | = r0 is in ROC, then all finite value of
z, for which 0 < | z | < r0 will be in ROC.
(vi) If x[n] is two sided sequence and if circle | z | = r0 is in the ROC. Then ROC will consist
of a ring in z-plane which consist of ring | z | = r0.
(vii) If X (z) is rational and
x[n] is right sided than ROC is outside of outer most pole.
x[n] is left sided then ROC is inside of inner most pole.
(viii) If x[n] is causal, ROC includes z = provided x[n] = 0, n < 0.
If x [n] is anti causal, ROC includes z = 0 provided x [n] = 0, n > 0.
(ix) A causal LTI system with rational system function is stable if all poles inside the unit
circle that is have magnitude, | z | < 1.

23

Properties of zTransform
Signal
x[n]
x1 n

Transform
X(z)

x2 n

X2 z

ax1 n bx2 n

x n n0
e

j0n

x n

X1 z

R1
R2

aX1 z bX2 z
z

n0

X e

j 0

x[n]

X z 1

x k

deletion of origin
Rx

X z
z0

nx[n]

At least R1 R2

X z

zn0 x n

x r , n=rk
w n
0, n rk for some r
x1 n * x2 n

ROC
Rx

X zk

z0R x
z 1 s.t z R x

Rx

k
i.e., z s.t z R x

X1 z X2 z

At least R1 R2

dz

deletion of zero

zdX z

1
1 z

24

X z

Rx

z 1

Signal
n

Transform
1

ROC
All z

u n

|z|>1

1z
u n 1
n m
anun
n

a u n 1
n

na u n

|z|<1
1

1z
z m

## All z except 0 (if m > 0) or

(if m < 0)
|z|>|a|

1
1 az 1
1
1 az

|z|<|a|

az 1

|z|>|a|
2

1 az 1
nanu n 1

az 1

|z|<|a|
2

1 az 1
Initial & Final value Theorem

x 0
x

lim
z

X z Initial value

lim 1
1 X z Final value
z 1 z

In z transform also, stability must be verified before using final value theorem.

25

Sampling
Continuous

Discrete Time

Time signal

signal

## Nyquist Sampling Theorem

It states that if sampling frequency is greater than twice the maximum frequency in the
signal for the signal to be recovered from its samples.
wS 2wM
Note: For this condition signal spectrum should be centered around y-axis.
Band-pass Sampling Theorem
If the signal spectrum is band-pass which means it has minimum & maximum frequency
fL = lower frequency

; fu = upper frequency

f
K u , where indicates Greatest Integer function
fu fL
2f
wS u
K

## xp (t) = x(t) p(t)

p t

t nT
n
T = sampling interval ; xp t Sampled signal

## x(t) = continuous time signal

xp t

x t t nT
n

1
X w * P w
2
2
P w
w kws
T k
XP w

XP w

1
2
X w kw s ; ws

T k
T

26

The spectrum of sampled signal is just repetition of actual spectrum at integral multiples
of ws .

27