EEE6209 Advanced Digital Signal Processing (ADSP) : DR Charith Abhayaratne (CA)

EEE6209
Advanced Digital Signal Processing (ADSP)

Dr Charith Abhayaratne (CA)
Tel: 0114 222 5893
Email: [email protected]
Office: Portobello C11
Course Delivery:
Lectures: 2 hours/week From Week 3 Semester 1 to Week 8 Semester 2
In Semester 1 Wednesday @ 11 am (CA) & Thursday @ 1 pm (WL)
In Semester 2 Monday @ 2pm (CA) & Thursday @ 2pm (WL)
This unit aims to

provide an understanding of filter design concepts
extend the filter design into scenarios where sampling rate
conversions, filter bank and adaptive filtering are required.
introduce the concept of transforms and wavelet theory.
introduce the concept of random signals and their analysis.
Introduce array signal processing and beamforming
provide hands-on experience in advanced signal
processing.
By the end of the unit, students will be able to

demonstrate the ability to
carry out filter design and implementation for sampling rate
conversions including decimation (d), interpolation (i) and a rational
factor (i/d). (CA)
understand the poly-phase representations of filter banks, formulate
different filter bank design and provide the corresponding solutions;
(CA)
perform simple analysis and compute statistics of random signals;
(WL)
understand the Wiener filter solution and the Least Mean Square
type adaptive algorithms and apply them to solve adaptive filtering
problems; (WL)
design, implement and use simple signal transforms in various
applications. (CA)
Have a general knowledge about the area of array signal processing
and understand some basic beamforming techniques (WL)
use MATLAB in designing and implementing the above concepts and
using them in suitable applications (CA &WL)
3
Syllabus for CAs Lectures (Part A)

Filters
How information is represented in signals

Time-domain /frequency domain parameters
Low-pass/high-pass, band-pass filters
Moving average/ recursive filetrs
Filter Banks
Sampling rate conversions

Poly-phase representation
Multirate filtering
Filter-bank design
Transforms
Introduction to signal transforms

Discrete Cosine transform
Wavelet transform
Lifting
Transform-domain processing
4
Assessment
Final exam 70% in May/June
2 hours
Two parts (35% each)
Part A: CA lectures
Part B: WL lectures
For each part

Answer 2 questions from 3
Coursework (30%)
Two coursework exercises
from Part (A) in around Semester 1 week 12 Semester 2
week 3
from Part (B) on around Semester 2 week 4 week 8
5
Prerequisites
Basic Signal Processing Concepts
http://hercules.shef.ac.uk/eee/teach/resources/eee309/eee309.html
Discrete time signals & systems

z-transform Sampling of continuous-time signals
Transform analysis of linear time-invariant (LTI) systems
Structures for discrete-time Systems
Discrete Fourier Transform
IIR & FIR Filter Design
If not familiar with above,

Revise ASAP
EEE6440
Reference Books (for background reading only)

Digital Signal Processing
J. Proakis & D. Manalokis (Prentice Hall).
Wavelets & Subband coding
M. Vetterli & J. Kovacavic.
(available online at
http://www.waveletsandsubbandcoding.org/)
Topic 01: Revision Background knowledge

Signal Processing Preliminaries
Discrete time signals & systems
Convolution
Impulse & Frequency response
Filters (low pass and high pass)
Transforms
Background reading: Digital Signal Processing (Proakis / Manolakis)

Chapters 1 and 2.
(Or Introduction and Discrete time systems and
signals chapters on any DSP text book)
Discrete time signals

A discrete time signal x(n) is a function of an independent
variable that is an integer.
We can assume that x(n) is defined for all integer values of
n for < n <
We refer x(n) as the nth sample of the signal.
x( n) xa ( nT ) , where xa is the analogue signal, T is the
sampling interval and n is the sampling index.
Commonly used signals:
Unit impulse function ---------- ?
Unit step signal ------------ ?
Discrete time signals

Simple manipulations of discrete time signals
What is x(n)?
6
x(n) =
5
4
Time shifting ---- x(n-k)

x(n-3)?
x(n)
3
2
1
0
-1
x(n+2)?
-2
-6
-4
-2
0
n
Folding ----- x(-n)

Time scaling ---- x(mn)
x(2n)?
10
Discrete time systems

A discrete time system is an operation or a set of
operations performed on a discrete time input signal x(n)
to produce the discrete time output signal y(n).
We can also say x(n) is transformed to y(n) by the system.
x(n)
Discrete time
system
y(n)
y(n) T[ x(n)]
The output when the input is the impulse function is called
the impulse response of a system . h(n, k ) = T [ (n k )]
11

Time (shift or translation) invariant systems
A system is called time invariant if its input-output
characteristics do not change with time.
That means for a system
x(n) y(n)
x(n-k) y(n-k), for every input signal x(n)
and every time shift k.
How to check? Check whether the shifted output (y(n-k)) is

the same as the output computed using the shifted input
(T[x(n-k)]).
12

Time (shift or translation) invariant systems
Determine the following are time invariant or not
y(n)=x(n)-x(n-1)
y(n)=nx(n)
y(n)=x(-n)
y(n)=x(2n)
y(n)=x(n)cos(wn)
13

Linear systems
A system is called linear if it satisfies the superposition
principle.
The response of the system to a weighted sum of signals
is the same as the corresponding weighted sum of the
responses of the system to each of the individual input
signals.
T[a1x1(n) + a2x2(n)] = a1T[x1(n)] + a2T[x2(n)]
This is due to scaling and additive properties of a linear
system.
14

Linear systems
Determine the following are linear or non-linear
y(n)=nx(n)
y(n)=x(n2)
y(n)=x2(n)
y(n)=x(2n)
15

Causal systems
A system is called causal if the output of the system at any
time [y(n)] depends only on the present [x(n)] and past
inputs [x(n-1), x(n-2),6.], but not the future inputs [x(n+1),
x(n+2),6.].
Otherwise the system is called non-causal.
What are the practical implications?
16

Interconnection of systems
Determine the combined system (T) of two systems (T1
and T2) interconnected:
(a) in cascade or
(b) in parallel
For cascade interconnections, is the order of performance

(T1 followed by T2 or T2 followed by T1) important?
17
Convolution
Response of a linear time invariant (LTI) system to an
arbitrary input x(n).
We know: y ( n ) = T [ x ( n )]
h ( n ) = T [ ( n )]
An arbitrary signal x(n) can be expressed as a sum of

weighted impulses:
x(n) =
x(k) (n k)
k =
Now we can write the output y(n):
y(n) = T [ x(n)] = T k = x(k ) (n k )
= k = x(k )T [ (n k )]
= k = x(k )h(n k )
= xh
18
Convolution
Response of a linear time invariant (LTI) system to an
arbitrary input x(n).
Steps:
1) folding: fold h(k) about k=0 to get h(-k)
2) Shifting: shift h(-k) by n0 to the right if n is positive to get
h(n0-k)
3) Multiplication: multiply x(k) by h(n0-k) to get the product
sequence
4) Summation: sum all the values of the product sequence.
Repeat the above steps 2 to 4 for all n.
19
Convolution
Computation by hand
A good way to compute h*x is to arrange it as an ordinary
multiplication. But dont carry digits from one column to
the other.
e.g., consider {x(0), x(1), x(2)} & {h(0), h(1), h(2)}
x(2)
h(2)
(2)
(3) (2)
(4) (3) (2)
y(4) y(3) y(2)
x(1)
h(1)
(1)
(1)
x(0)
h(0)
(0)
y(1) y(0)
Compute the convolution for x(n)={4,2,3} and h(n)={2,5,1}

20
Convolution
Convolution of x(n) by h(n) in time domain becomes
multiplication of X by H in frequency domain, where X &
H are the Fourier transform of h.
( ) = x(n)e
Xe
jn
= X ( )
H (e ) = h(n)e
j
jn
= H ( )
Y () = H () X ( )
Similarly in the z-transfom domain
X ( z) = x(n) z n
H ( z) = h(n) z n
Y ( z ) = H ( z) X ( z )
21
Filters
A filter is a linear time-invariant operator.
It acts on input signal x and the output signal y is the
convolution sum of x with the fixed vector h, which is the
impulse response of the system.
The values of the vector h are known as the filter
coefficients. E.g., h(0), h(1),66
Low pass filters & High pass filters (later in detail)

22
Transforms
A transform of a signal is a new representation of that signal.
Consider the following system of equations:
y(0)= x(0) + x(1)
y(1)= x(0) - x(1)
y(2)= x(2) + x(3)
y(3)= x(2) - x(3)
This transforms x into y using a 4-point transform.
In other words the signal is represented in y-domain using
the linear combinations of signal components in the x
domain.
What is the inverse transform for the above transform?
23
Homework: MATLAB
Exercise 1:
Create the time axis values for 10 cycles with 512 data
points using t=linspace(0,10, 512);
Consider the signal x=3sin(5t)-6cos(9t)
Plot x
Add random noise n to obtain a noisy signal y=x+n
Consider you are using a 3 point moving average filter.
What is h for this filter?
Use convolution to find the cleaned signal z
Check the size of the output z
Plot all x, y and z in the SAME figure
Think of an alternative approach for de-noising using the
Fourier Transform and implement it using MATLAB
24

EEE6209 Advanced Digital Signal Processing (ADSP) : DR Charith Abhayaratne (CA)

Uploaded by

Copyright:

Available Formats

EEE6209 Advanced Digital Signal Processing (ADSP) : DR Charith Abhayaratne (CA)

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

EEE6209 Advanced Digital Signal Processing (ADSP) : DR Charith Abhayaratne (CA)

Uploaded by

Copyright:

Available Formats

EEE6209

Advanced Digital Signal Processing (ADSP)

This unit aims to

By the end of the unit, students will be able to

Syllabus for CAs Lectures (Part A)

How information is represented in signals

Sampling rate conversions

Introduction to signal transforms

For each part

Discrete time signals & systems

If not familiar with above,

Reference Books (for background reading only)

Topic 01: Revision Background knowledge

Background reading: Digital Signal Processing (Proakis / Manolakis)

Discrete time signals

Discrete time signals

Time shifting ---- x(n-k)

Folding ----- x(-n)

Discrete time systems

Discrete time systems

How to check? Check whether the shifted output (y(n-k)) is

Discrete time systems

Discrete time systems

Discrete time systems

Discrete time systems

Discrete time systems

For cascade interconnections, is the order of performance

An arbitrary signal x(n) can be expressed as a sum of

Now we can write the output y(n):

y(n) = T [ x(n)] = T k = x(k ) (n k )

Compute the convolution for x(n)={4,2,3} and h(n)={2,5,1}

Similarly in the z-transfom domain

Low pass filters & High pass filters (later in detail)

You might also like