• DocumentCode
    1810446
  • Title

    Comparison of the stochastic iteration algorithm and the dual sign algorithm in nonstationary environments

  • Author

    Kwong, C.P.

  • Author_Institution
    Dept. of Electron., Chinese Univ. of Hong Kong, Shatin, Hong Kong
  • fYear
    1988
  • fDate
    7-9 Jun 1988
  • Firstpage
    519
  • Abstract
    An adaptive algorithm, called the dual sign algorithm (DSA), has been proposed recently to simplify the implementation of the widely-used stochastic iteration algorithm (SIA). Previous study has shown that, in stationary environments, the DSA, although simpler, exhibits faster convergence compared with the SIA, Here, computer simulation is used to compare the performance of the two algorithms in identifying some typical time-varying models. The results show that if both algorithms are designed to attain the same steady-state accuracy, the DSA always has a better tracking capability
  • Keywords
    convergence of numerical methods; iterative methods; stochastic processes; computer simulation; convergence; dual sign algorithm; nonstationary environments; stochastic iteration algorithm; time-varying models; tracking capability; Adaptive algorithm; Adaptive signal processing; Algorithm design and analysis; Computer simulation; Convergence; Quantization; Signal processing algorithms; Steady-state; Stochastic processes; Synthetic aperture sonar;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Circuits and Systems, 1988., IEEE International Symposium on
  • Conference_Location
    Espoo
  • Type

    conf

  • DOI
    10.1109/ISCAS.1988.14978
  • Filename
    14978