TISE Course on Development of Methods and Techniques in Computing and Signal Processing, October 22-25 TUT

 

The course is organized in five meetings devoted to the following topics

 

1.      What can we learn from the History of Computing?

 

2.      Classical Foundations of Signal Processing

a.       Fourier Analysis

b.      Sampling theorem

c.       Abstract Harmonic Analysis

 

3.      Foundations of modern computing

a.       Abstract Logic 

b.      Logic Design and Switching theory

c.       Fast algorithms, especially FFT

 

The selection of these topics is motivated by the following reasoning.

 

In the first lecture, we give a brief overview of the developments during the last several hundred years that have led to the current amazing power of computational methods in science and everyday life. We discuss why this knowledge is useful to an engineer both in his/her professional work and forming a mature perspective of science and engineering.

 

In other lectures we focus on how certain critical methodologies have born and what kind of conceptual and experimental knowledge has been essential in these processes. The methodologies that we discuss, some of which been around for centuries are still the core of many modern technologies. The study of the key steps in the formulations of the methods allows the student to see them from several viewpoints and do give a deepened understanding of the method. From these studies several general tendencies become visible. When sufficient knowledge about a critical problem has been generated different formulations solution may emerge independently by several scientists around the world and which one of them becomes the widely accepted one, depends sometimes not only on scientific superiority but also on political, cultural, and sometimes even random events. It also reveals that the development of modern science and technology is by no means obvious or inevitable but different major historical events might have delayed it for centuries or even prevented it.

 


 

Instuctor: Prof. Radomir Stankovic

 

Schedule:

Tue 22.10 TB219, 12-16 lectures

Wed 23.10 TB219, 12-16 lectures

Thu 24.10 TB220, 12-16 lectures

Fri 25.10 TB219, 12-16 student presentations and discussion

 

Credits: 2-4 cr,

2cr requirements: Attendance, report on a particular topic agreed with the instructor, and short presentation on the last day, report to be submitted within two weeks.

1-2 additional credits: A more extensive study on a particular topic agreed with the instructor,

and short presentation on the last day, report to be submitted within three weeks.

 

Grading: pass/fail

 

Registration: Susanna Anttila  susanna.anttila@tut.fi

Preferably by October 16, you can also register at the first lecture

 

Additional Information: Jaakko Astola jaakko.astola@tut.fi

 

TISE students have preference if participation needs to be limited and non-TISE students are admitted in order of registration. 

 

Course Material

 

Slides:

Why learn history of computing

Some history of Fourier transform

Some history of FFT

Some remarks on the history of sampling theorem

Some remarks on switching theory

 

Related material  (to be added)

Remarks-combined

 

Links to related material (to be added)