Robust Adaptive Modified Newton Algorithm for Generalized Eigendecomposition and Its Application

<p/> <p>We propose a robust adaptive algorithm for generalized eigendecomposition problems that arise in modern signal processing applications. To that extent, the generalized eigendecomposition problem is reinterpreted as an unconstrained nonlinear optimization problem. Starting from th...

Full description

Bibliographic Details
Main Authors: Yang Jian, Yang Feng, Xi Hong-Sheng, Guo Wei, Sheng Yanmin
Format: Article
Language:English
Published: SpringerOpen 2007-01-01
Series:EURASIP Journal on Advances in Signal Processing
Online Access:http://asp.eurasipjournals.com/content/2007/038341
Description
Summary:<p/> <p>We propose a robust adaptive algorithm for generalized eigendecomposition problems that arise in modern signal processing applications. To that extent, the generalized eigendecomposition problem is reinterpreted as an unconstrained nonlinear optimization problem. Starting from the proposed cost function and making use of an approximation of the Hessian matrix, a robust modified Newton algorithm is derived. A rigorous analysis of its convergence properties is presented by using stochastic approximation theory. We also apply this theory to solve the signal reception problem of multicarrier DS-CDMA to illustrate its practical application. The simulation results show that the proposed algorithm has fast convergence and excellent tracking capability, which are important in a practical time-varying communication environment.</p>
ISSN:1687-6172
1687-6180