General block LMS algorithm
Abstract:
In this paper, we analyze the conventional Block-Least-Mean-Square (BLMS) algorithm. Usual constraints such as real input data, steady-state analysis and positive adaptive step-size parameter are discarded. Some modifications are introduced in order that the new complex frequency-domain BLMS algorithm equals the former versions in case any of the constraints are imposed. Furthermore, if the steady-state analysis is considered, the proposed algorithm avoids the inversion of the autocorrelation matrix of the transformed input. ©2009 IEEE.
Año de publicación:
2009
Keywords:
Fuente:
scopus
googleTipo de documento:
Conference Object
Estado:
Acceso restringido
Áreas de conocimiento:
- Algoritmo
- Algoritmo
- Algoritmo
Áreas temáticas de Dewey:
- Ciencias de la computación
Objetivos de Desarrollo Sostenible:
- ODS 9: Industria, innovación e infraestructura
- ODS 17: Alianzas para lograr los objetivos
- ODS 4: Educación de calidad