---

This thesis deals with adaptive algorithms and their application in echo cancelation. It tries to tackle the ever-lasting problem of computational complexity vs. rate of convergence. It describes some well-known adaptive methods as well as a novel concept which has been entitled Optimal Step-Size (OSS). In the first part of the thesis, two common methods, the Normalized Least Mean Squares (NLMS) and the Recursive Least Mean Squares (RLS), are described and their properties analyzed. It is shown what deficiencies they have when applied for echo cancelation. In the second part of the thesis it is shown that, by modifying the NLMS and the RLS, better results can be achieved. In the last part of the thesis a novel approach is described, called OSS. The proposed method possesses certain features that make it robust in non-stationary Environment. Experimental evaluations show that its performance is comparable with the conventional methods and in certain cases it outperforms them.

---

has finished his M.Sc. studies in 2001 and Ph.D. studies in 2006 at Brno University of Technology. He has worked as research engineer in ASTP ltd. in Brno for one year. In 2005 he joined the Speech and Audio Processing Group at the University of Sherbrooke in Canada. His research interests are primarily in the area of speech coding.

---