SGN-9306
SIGNAL PROCESSING GRADUATE SEMINAR III, 3-8 cr
Topics: Algorithmic Information Theory: Mathematics Of Digital
Information Processing
Time
and Place:
Per III: Wednesdays
12:15-15, TB 224
Per IV: Wednesdays
12:15-15, TB 219
First
meeting: January 13, 2010
Instructors: Ioan Tabus, Ciprian Doru Giurcaneanu,
Bogdan Dumitrescu
Textbook: Algorithmic Information Theory: Mathematics Of Digital Information Processing, Peter Seibt, Springer, 444 pages,2006 (book available
online at http://www.springerlink.com/content/uu2137/?p=36472dffc87a4f5694ccdafb51b6dba5&pi=6
)
Requirements:
Typically two presentations (including solving
of book problems), participation as opponent to two presentations, and active
participation in more than 70% of presentations are awarded 5cr. A significant
project work related to the topic of the seminar will be awarded additional
credits.
Contents
(Publisher’s presentation): This book treats the Mathematics of many important
areas in digital information processing.
It covers, in a unified presentation, five topics: Data Compression,
Cryptography, Sampling (Signal Theory), Error Control Codes, Data Reduction.
The thematic choices are practice-oriented. So, the important final part of the
book deals with the Discrete Cosine Transform and the Discrete Wavelet
Transform, acting in image compression. The presentation is dense, the examples
and numerous exercises are concrete. The pedagogic architecture follows
increasing mathematical complexity. A read-and-learn book on Concrete
Mathematics, for teachers, students and practitioners in Electronic Engineering,
Computer Science and Mathematics.
Written for:
Graduate students
and scientists of information technology, engineers and mathematicians
Keywords:
Algebra, Cryptogrphy, Data Compression, Data Reduction, Error
Control Codes, Sampling (Signal Theory)
Registration: By e-mail to tabus@cs.tut.fi
or at the first lecture. Topics will be decided during the first lecture.
Homepage: http://www.cs.tut.fi/~tabus/Seminar_09_10.html
· The presentations will
include also discussions with the opponent and audience. Every participant
should serve at least once as opponent.
· The main goal is to
introduce the topic to the other participants and convey the personal opinions
regarding the open issues, connections to other methods, practical conclusions.
· Project work consists of some
experiments, using simulations or real data, performed in connection with at
least one practical aspect of the subject.
Presentations
Schedule:
|
Date |
Special |
Presentations |
|
13.01 |
Organization |
|
|
20.01 |
|
|
|
27.01 |
|
1. Data Compaction Payman Aflaki |
|
3.02 |
|
|
|
10.02 |
|
|
|
17.02 |
Exam week |
No presentation |
|
24.02 |
|
5.1 DFT, Passband Filtering and Digital Filtering 5.2 The Discrete Cosine Transform Septimia Sarbu |
|
3.03 |
|
5.3.1 Two Channel Filter Banks Bogdan
Dumitrescu |
|
10.03 |
|
No presentation |
|
17.03 |
|
2. (2.1 &2.2) Cryptography Vinod Kumar |
|
24.03 |
|
4 Error Control Codes JenniHukkanen 2.3 Cryptography Florin
Ghido |
|
31.03 |
|
2.4 Cryptography Florin
Ghido 3. Information Theory and Signal Theory: Sampling and Reconstruction Alexandru Onose |