DocumentCode
2804357
Title
Set-membership adaptive algorithms based on time-varying error bounds and their application to interference suppression
Author
De Lamare, Rodrigo C. ; Diniz, Paulo S R
Author_Institution
Univ. of York, York
fYear
2006
fDate
3-6 Sept. 2006
Firstpage
884
Lastpage
888
Abstract
This work presents set-membership adaptive algorithms based on time-varying error bounds. A bounding ellipsoidal adaptive constrained (BEACON) recursive least-squares algorithm is described for parameter estimation subject to time-varying error bounds. The important issue of error bound specification is addressed in a new framework that takes into account parameter estimation dependency, multi-access (MAI) and inter-symbol interference (ISI) for DS-CDMA communications. An algorithm for tracking and estimating the interference power is presented and incorporated into the time-varying error bound and the BEACON technique. Computer simulations show that the new algorithms are capable of outperforming previously reported techniques with a smaller number of parameter updates and a reduced risk of overbounding or underbounding.
Keywords
code division multiple access; interference suppression; intersymbol interference; least squares approximations; radio receivers; DS-CDMA communication; RAKE receiver; bounding ellipsoidal adaptive constrained recursive least-squares algorithm; interference suppression; multiaccess intersymbol interference; parameter estimation; set-membership adaptive algorithm; time-varying error bound; Adaptive algorithm; Computer errors; Filtering; Interference constraints; Interference suppression; Intersymbol interference; Multiaccess communication; Multiple access interference; Parameter estimation; Recursive estimation;
fLanguage
English
Publisher
ieee
Conference_Titel
Telecommunications Symposium, 2006 International
Conference_Location
Fortaleza, Ceara
Print_ISBN
978-85-89748-04-9
Electronic_ISBN
978-85-89748-04-9
Type
conf
DOI
10.1109/ITS.2006.4433396
Filename
4433396
Link To Document