389.167 Adaptive Filters
This course is in all assigned curricula part of the STEOP.
This course is in at least 1 assigned curriculum part of the STEOP.

2013W, VU, 4.0h, 6.0EC

Properties

  • Semester hours: 4.0
  • Credits: 6.0
  • Type: VU Lecture and Exercise

Aim of course

  • The lecture provides a deeper look into the world of adaptive filter algorithms. Starting with classical definitions like Least Mean Square (LMS) and Wiener solutions, low complexity gradient type algorithms for such solutions are developed and analyzed. Numerous application examples will be presented. The contradiction between the stochastic approach to describe LMS and the deterministic approach to describe RLS algorithms is shown. In order to adapt to a permanently changing environment, the tracking nature of adaptive algorithms is studied and the Kalman algorithm is introduced as optimal solution. Finally, robust descriptions as they are common in modern control theory (H00 control) allow to solving the classical contradiction and broaden the theory in order to understand more complex algorithms like adaptive IIR filtering and blind equalization. Applications in the field of hands free telephony, active noise control, car engine control, echo control in communication systems, linear prediction, adaptive equalization and neural networks will be presented and taught by Matlab exercises.
  • This lecture is also addressing Computer Science students and control as well as students of electrical engineering outside of communications whose interests are in signal processing.
  • Improvement of technical English

Subject of course

The lecture provides a deeper look into the world of adaptive filter algorithms. Starting with classical definitions like Least Mean Square (LMS) and Wiener solutions, low complexity gradient type algorithms for such solutions are developed and analyzed. Numerous application examples will be presented. The contradiction between the stochastic approach to describe LMS and the deterministic approach to describe RLS algorithms is shown. In order to adapt to a permanently changing environment, the tracking nature of adaptive algorithms is studied and the Kalman algorithm is introduced as optimal solution. Finally, robust descriptions as they are common in modern control theory (H00 control) allow to solving the classical contradiction and broaden the theory in order to understand more complex algorithms like adaptive IIR filtering and blind equalization. Applications in the field of hands free telephony, active noise control, car engine control, echo control in communication systems, linear prediction, adaptive equalization and neural networks will be presented and taught by Matlab exercises.

Additional information

This course will be given the next time in WS 2014!!!

Lecturers

---

Institute

Examination modalities

 

Part I: written exercises during the semester (math calculus and matlab)

Part II: oral exam at the semester end

Course registration

Not necessary

Curricula

Study CodeObligationSemesterPrecon.Info
066 507 Telecommunications Not specified

Literature

No lecture notes are available.

Previous knowledge

Working knowledge of random variables and deterministic signal processing

Miscellaneous

Language

English