Format

Send to

Choose Destination
See comment in PubMed Commons below
Neural Netw. 2010 Apr;23(3):396-405. doi: 10.1016/j.neunet.2009.11.004. Epub 2009 Dec 11.

A fast algorithm for AR parameter estimation using a novel noise-constrained least-squares method.

Author information

1
College of Mathematics and Computer Science, Fuzhou University, China. ysxia2001@yahoo.com

Abstract

In this paper, a novel noise-constrained least-squares (NCLS) method for online autoregressive (AR) parameter estimation is developed under blind Gaussian noise environments, and a discrete-time learning algorithm with a fixed step length is proposed. It is shown that the proposed learning algorithm converges globally to an AR optimal estimate. Compared with conventional second-order and high-order statistical algorithms, the proposed learning algorithm can obtain a robust estimate which has a smaller mean-square error than the conventional least-squares estimate. Compared with the learning algorithm based on the generalized least absolute deviation method, instead of minimizing a non-smooth linear L(1) function, the proposed learning algorithm minimizes a quadratic convex function and thus is suitable for online parameter estimation. Simulation results confirm that the proposed learning algorithm can obtain more accurate estimates with a fast convergence speed.

PMID:
20005072
DOI:
10.1016/j.neunet.2009.11.004
[Indexed for MEDLINE]
PubMed Commons home

PubMed Commons

0 comments
How to join PubMed Commons

    Supplemental Content

    Full text links

    Icon for Elsevier Science
    Loading ...
    Support Center