General Block LMS Algorithm

Domínguez Jiménez, María Elena, Hernández Perdomo, Wilmar ORCID: https://orcid.org/0000-0003-4643-8377 and Sansigre Vidal, Gabriela ORCID: https://orcid.org/0000-0001-7248-0814 (2009). General Block LMS Algorithm. En: "35th Annual Conference of IEEE Industrial Electronics, 2009. IECON '09", 03/11/2009 - 05/11/2009, Oporto, Portugal. ISBN 978-1-4244-4648-3.

Descripción

Título: General Block LMS Algorithm
Autor/es:
Tipo de Documento: Ponencia en Congreso o Jornada (Artículo)
Título del Evento: 35th Annual Conference of IEEE Industrial Electronics, 2009. IECON '09
Fechas del Evento: 03/11/2009 - 05/11/2009
Lugar del Evento: Oporto, Portugal
Título del Libro: Proceedings of 35th Annual Conference of IEEE Industrial Electronics, 2009. IECON '09
Fecha: 2009
ISBN: 978-1-4244-4648-3
Materias:
ODS:
Escuela: E.U.I.T. Telecomunicación (UPM) [antigua denominación]
Departamento: Ingeniería de Circuitos y Sistemas [hasta 2014]
Licencias Creative Commons: Reconocimiento - Sin obra derivada - No comercial

Texto completo

[thumbnail of INVE_MEM_2009_65447.pdf]
Vista Previa
PDF (Portable Document Format) - Se necesita un visor de ficheros PDF, como GSview, Xpdf o Adobe Acrobat Reader
Descargar (342kB) | Vista Previa

Resumen

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.

Más información

ID de Registro: 5552
Identificador DC: https://oa.upm.es/5552/
Identificador OAI: oai:oa.upm.es:5552
URL Oficial: http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumb...
Depositado por: Memoria Investigacion
Depositado el: 23 Dic 2010 11:38
Ultima Modificación: 21 Jun 2025 06:51