Reduced Complexity Adaptive Filtering Algorithms with Applications to Communications Systems.pdf

文档介绍：Helsinki University of Technology Signal Processing Laboratory
Teknillinen korkeakoulu Signaalinkäsittelytekniikan laboratorio
Espoo 2002 Report 37










PLEXITY ADAPTIVE FILTERING ALGORITHMS
WITH APPLICATIONS MUNICATIONS SYSTEMS

Stefan Werner

Dissertation for the degree of Doctor of Science in Technology to be presented with due
permission for public examination and debate in Auditorium S3 at Helsinki University of
Technology (Espoo, Finland) on the 15th of November, 2002, at 12 o’clock noon.





















Helsinki University of Technology
Department of Electrical munications Engineering
Signal Processing Laboratory


Teknillinen korkeakoulu
Sähkö- ja ekniikan osasto
Signaalinkäsittelytekniikan laboratorio
Distribution:
Helsinki University of Technology
Signal Processing Laboratory
. Box 3000
FIN-02015 HUT
Tel. [phone]
Fax. [phone]
E-mail: Mirja.******@

 Stefan Werner

ISBN 951-22-6175-8
ISSN 1458-6401

Otamedia Oy
Espoo 2002
Abstract
This thesis develops new adaptive filtering algorithms suitable munications applica-
tions with the aim of reducing plexity of the implementation. Low
plexity of the adaptive filtering algorithm can, for example, reduce the
required power consumption of the implementation. A low power consumption is important
in wireless applications, particularly at the mobile terminal side, where the physical size
of the mobile terminal and long battery life are crucial. We focus on the implementation
of two types of adaptive filters: linearly-constrained minimum-variance (LCMV) adaptive
filters and conventional training-based adaptive filters.
For LCMV adaptive filters, normalized data-reusing algorithms are proposed which can
trade off convergence speed plexity by varying the number of data-
reuses in the coefficient update. Furthermore, we propose a transformation of the i