DCSP
This document describes the course objectives and
organisation, and contains a course timetable. You could download Lecture notes (HERE) .
The course will teach a variety of contemporary
approaches to the
theory and implementation of DCSP, with emphasis
on theory, software and algorithms. It equips students with sufficient
knowledge to enable employment or postgraduate
study involving DCSP.
2. General Information
2.1 Tutors for the course
Jianfeng
Feng
Room 313 DCS email: jianfeng.feng@warwick.ac.uk
Tian GE email:getian107@gmail.com
2.2 Teaching methods
Lectures: 3 per week, held at the following times
Day Time
Place
Tue 11.00-12.00 S0.20
Wed &;
12.00-13.00 S0.17
Thu 10.00-11.00 CS1.01
These lectures will cover the introductory theory
behind the topics above, as well as various topics related to these (e.g.
implementation issues).
All students on this course will have a supervised
exercise class every week, starting from the second week. Details of times, and
which exercise class you should attend are given during lectures.
A lot of the work on the course is based on exercises
that you should do with or without the computer. In addition to the
timetabled exercise classes you are expected to spend many hours a
week both using the computer, and reading supporting material from the
reading list in order to deepen your understanding of the topics being
covered. All students experience problems learning new concepts and
skills and it is important not to be discouraged and give up. If you get stuck
ask other students, a demonstrator, or a tutor for help. As stated
already, various exercises may be set during the course.
Remember that the lectures for this (and any other)
course really aim to provide you with the minimal essential information on a
subject. To get a deeper understanding (and in order to do well in the exams,
and in subsequent courses which build on these) you MUST read around the
subject. The reading list at the end of this handout should provide some
good staring points.
Assessment for this course will be based:
Three-hour examination (80%) Coursework
(20%)
The list below gives a provisional week-by-week list
of topics (note these may change depending on how the course progresses).
Some lectures will incorporate important announcements, including changes in
later lectures, so if you ever miss a lecture make sure you find out from
another student exactly what was said.
Note: I will update the slides below each week after the lecture.
------------------------------------------------------------------------------------------
Week 2 Mon : Introduction [slides-2012]
Wed: Fourier transform I [slides_2012]
Wed: Seminar I: Matlab
--------------------------------------------------------------------------
Week 3 Tue: Fourier transform II [slides_2012]
Wed: Modem [slides_2012]
Thu: Seminar II--Fourier transform [Question] [Solution]
------------------------------------------------------------------------------------------
Week 4 Tue: Noise [slides_2012]
Wed: Data transmission and Information Theory [slides_2012][Revision of Chapter II]
Thu: Seminar III --Noise [Image] [Questions] [Solutions]
------------------------------------------------------------------------------------------
Week 5 Tue: Minimal length coding I [slides_2012]
Wed: Minimal length coding II, Hamming Distance and Encryption [slides_2012]
Thu: Seminar IV-- Coding [seminar notes] [midsummer] [message] [Matlab code for Q1] [Matlab code for Q2]
------------------------------------------------------------------------------------------
Week 6 Tue:
Signal representation [slides_2012]
Wed: DTFT and DFT I [slides_2012] [Revision of
Chapter III]
Thu: Seminar V--
[seminar 5]
------------------------------------------------------------------------------------------
Week 7 Tue:
Applications [slides_2012]
------------------------------------------------------------------------------------------
Week 8 Tue:
Filter II [slides_2012]
------------------------------------------------------------------------------------------
Week 9
Tue : Matched Filter [Slides_2012]
Wed : Wiener Filter [Slides_2012]
Thu: Seminar VIII--Wiener Filter
[Question]
------------------------------------------------------------------------------------------
Week 10 Tue: Stochastic Processes [slides]
Thu: Final Seminar--Assignment help
------------------------------------------------------------------------------------------
Download .doc file here Assignment 2012;
Files for question 2;
You could pick up one of these files for question 2.
Files for question 8:
Download TuneJazz.mat below and try to remove noise as much as you can. The original signal is an excerpt from a piece of Jazz music.
The sampling frequency is 44100 Hz.
Many general DCSP
textbooks have some sections devoted to some of the material covered in this
course.
2. David J. C. MacKay. Information Theory, Inference, and Learning Algorithms Cambridge: Cambridge University Press, 2003.
3. R. Cristi, Modern digital signal processing; Brooks/Cole; 2004
4. On-line materials: Intuitive Guide to Principles of Communications (http://www.complextoreal.com/); slightly advanced but very good