Partial Update Least-Square Adaptive Filtering

Idioma: inglés

Editorial: Springer Nature Switzerland, 2014

3031005538 / 9783031005534

  • Tapa blanda
  • Nuevo
Ver todos los detalles

Librería: AHA-BUCH GmbH, Einbeck, AlemaniaAHA-BUCH GmbH

Vendedor de 5 estrellas

Vendedor de IberLibro desde 14 de agosto de 2006

Tapa blanda

Condición: Nuevo

EUR 43,59

Envío por EUR 35,00 
Se envía de Alemania a Estados Unidos de America

Cantidad disponible: 1 disponible

Añadir al carrito
Devoluciones gratuitas de 30 días

Descripción del artículo del vendedor

Druck auf Anfrage Neuware - Printed after ordering - Adaptive filters play an important role in the fields related to digital signal processing and communication, such as system identification, noise cancellation, channel equalization, and beamforming. In practical applications, the computational complexity of an adaptive filter is an important consideration. The Least Mean Square (LMS) algorithm is widely used because of its low computational complexity ($O(N)$) and simplicity in implementation. The least squares algorithms, such as Recursive Least Squares (RLS), Conjugate Gradient (CG), and Euclidean Direction Search (EDS), can converge faster and have lower steady-state mean square error (MSE) than LMS. However, their high computational complexity ($O(N^2)$) makes them unsuitable for many real-time applications. A well-known approach to controlling computational complexity is applying partial update (PU) method to adaptive filters. A partial update method can reduce the adaptive algorithm complexity by updating part of the weight vector instead of the entire vector or by updating part of the time. In the literature, there are only a few analyses of these partial update adaptive filter algorithms. Most analyses are based on partial update LMS and its variants. Only a few papers have addressed partial update RLS and Affine Projection (AP). Therefore, analyses for PU least-squares adaptive filter algorithms are necessary and meaningful.This monograph mostly focuses on the analyses of the partial update least-squares adaptive filter algorithms. Basic partial update methods are applied to adaptive filter algorithms including Least Squares CMA (LSCMA), EDS, and CG. The PU methods are also applied to CMA1-2 and NCMA to compare with the performance of the LSCMA. Mathematical derivation and performance analysis are provided including convergence condition, steady-state mean and mean-square performance for a time-invariant system. The steady-state mean and mean-square performance are also presented for a time-varying system. Computational complexity is calculated for each adaptive filter algorithm. Numerical examples are shown to compare the computational complexity of the PU adaptive filters with the full-update filters. Computer simulation examples, including system identification and channel equalization, are used to demonstrate the mathematical analysis and show the performance of PU adaptive filter algorithms. They also show the convergence performance of PU adaptive filters. The performance is compared between the original adaptive filter algorithms and different partial-update methods. The performance is also compared among similar PU least-squares adaptive filter algorithms, such as PU RLS, PU CG, and PU EDS. In addition to the generic applications of system identification and channel equalization, two special applications of using partial update adaptive filters are also presented. One application uses PU adaptive filters to detect Global System for Mobile Communication (GSM) signals in a local GSM system using the Open Base Transceiver Station (OpenBTS) and Asterisk Private Branch Exchange (PBX). The other application uses PU adaptive filters to do image compression in a system combining hyperspectral image compression and classification.…

N° de ref. del artículo 9783031005534

Título
Partial Update Least-Square Adaptive Filtering
Autor
Bei Xie
Editorial
Springer Nature Switzerland
Año de publicación
2014
Estado
Neu
Encuadernación
Taschenbuch
Idioma
inglés
ISBN 10
3031005538
ISBN 13
9783031005534
Peso del artículo
241 gramos
Dimensiones
235x191x7 mm

AHA-BUCH GmbH

Einbeck, Alemania

Vendedor de 5 estrellas

Vendedor de IberLibro desde 14 de agosto de 2006

Tarifas de envío de Alemania a Estados Unidos de America

ArtículoDe 7 a 10 días hábilesDe 5 a 7 días hábiles
Primer artículoEUR 35,00EUR 45,00
Los plazos de entrega los establecen los vendedores y varían según el transportista y la ubicación. Los pedidos que pasan por la aduana pueden sufrir retrasos y los compradores son responsables de los aranceles o tarifas asociadas. Los vendedores pueden ponerse en contacto con usted en relación con cargos adicionales para cubrir cualquier aumento en los costes de envío de los artículos.

Métodos de pago

  • Visa
  • Mastercard
  • American Express
  • Carte Bleue
  • Apple Pay
  • Google Pay
  • Cheque
  • Giro bancario
  • PayPal

Descripción de la tienda

Das Unternehmen AHA-BUCH GmbH: Seit der Gründung von AHA-BUCH im Juli 2005 ist unser Hauptziel, zufriedenen Kunden so schnell und so preisgünstig wie möglich ihren Bücherwunsch zu erfüllen. Unsere Firma beschäftigt 16 Mitarbeiter, die nur ein Ziel kennen: den Kunden und seine Wünsche! Auf über 3700 m2 Fläche haben wir über 100.000 Bücher, Modernes Antiquariat und Spiele auf Lager.

Especialidad

Kinderbücher & Kinderhör Casetten, German Books, Software, Natur & Tiere, Ratgeber, Sachbücher, Englische Bücher, Medizin & Gesundheit, Universität & Studium

Información empresarial del vendedor

AHA-BUCH GmbH

Garlebsen 48
Einbeck, Alemania 37574

IImprint

Información del vendedor

AHA-BUCH GmbH
representado por el director gerente Christel Glass
Garlebsen 48
37574 Einbeck
Alemania
Teléfono: 055639996039
Fax: 055639995974
E-Mail: abebooks@aha-buch.de
USt-IdNr.: DE261904229
Inscrita en el Registro Mercantil Amtsgerichtes Göttingen
Handelsregisternummer HRB 200691

Resolución alternativa de conflictos:
La Comisión Europea proporciona una plataforma para la resolución extrajudicial de litigios en línea (plataforma ODR), a la que se puede acceder en https://ec.europa.eu/odr.

Somos miembros de la iniciativa "FairCommerce" desde el 25.05.2018.
Para obtener más información, consulte www.fair-commerce.de.