• DocumentCode
    3391530
  • Title

    Reduced-rank BEACON algorithm based on joint iterative optimization of adaptive filters

  • Author

    Clarke, Patrick ; De Lamare, Rodrigo C.

  • Author_Institution
    Commun. Res. Group, Univ. of York, York, UK
  • fYear
    2010
  • fDate
    May 30 2010-June 2 2010
  • Firstpage
    2984
  • Lastpage
    2987
  • Abstract
    This paper presents a novel reduced-rank implementation of the set-membership (SM) Bounding Ellipsoid Adaptive Constrained Least Squares (BEACON) algorithm using the method of joint iterative optimization (JIO) of adaptive filters. The sparsely updating estimation error SM framework is applied to the adaption of the rank reduction matrix and the symbol estimation filter that operates in the reduced-rank signal subspace. A derivation of the scheme, based on least squares (LS) optimization, is given along with an intuitive geometric interpretation of the update procedure. The proposed JIO-BEACON algorithm along with other established reduced-rank algorithms are applied to interference suppression in a multiuser DS-CDMA system. The JIO-BEACON algorithm is shown to exceed the performance of the standard LS JIO and other existing algorithms in terms of convergence and steady state error whilst achieving significant complexity savings.
  • Keywords
    adaptive filters; code division multiple access; iterative methods; least squares approximations; optimisation; space division multiple access; adaptive filters; bounding ellipsoid adaptive constrained least squares; joint iterative optimization; multiuser DS-CDMA system; reduced-rank BEACON algorithm; set-membership; steady state and error; Adaptive filters; Constraint optimization; Ellipsoids; Estimation error; Interference suppression; Iterative algorithms; Iterative methods; Least squares methods; Multiaccess communication; Samarium;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Circuits and Systems (ISCAS), Proceedings of 2010 IEEE International Symposium on
  • Conference_Location
    Paris
  • Print_ISBN
    978-1-4244-5308-5
  • Electronic_ISBN
    978-1-4244-5309-2
  • Type

    conf

  • DOI
    10.1109/ISCAS.2010.5538011
  • Filename
    5538011