Back to Search
Start Over
Set-Membership Adaptive Algorithms Based on Time-Varying Error Bounds for CDMA Interference Suppression.
- Source :
-
IEEE Transactions on Vehicular Technology . Feb2009, Vol. 58 Issue 2, p644-654. 11p. 1 Diagram, 6 Charts, 2 Graphs. - Publication Year :
- 2009
-
Abstract
- This paper presents set-membership (SM) adaptive algorithms based on time-varying error bounds for code-division multiple-access (CDMA) interference suppression. We introduce a modified family of SM adaptive algorithms for parameter estimation with time-varying error bounds. The considered algorithms include modified versions of the SM normalized least mean square (SM-NLMS), the affine projection (SM-AP), and the bounding ellipsoidal adaptive constrained (BEACON) recursive least-square technique. The important issue of error-bound specification is addressed in a new framework that takes into account parameter estimation dependency, multiaccess, and intersymbol interference (ISI) for direct-sequence CDMA (DS-CDMA) communications. An algorithm for tracking and estimating the interference power is proposed and analyzed. This algorithm is then incorporated into the proposed time-varying error bound mechanisms. Computer simulations show that the proposed algorithms are capable of outperforming previously reported techniques with a significantly lower number of parameter updates and a reduced risk of overbounding or underbounding. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00189545
- Volume :
- 58
- Issue :
- 2
- Database :
- Academic Search Index
- Journal :
- IEEE Transactions on Vehicular Technology
- Publication Type :
- Academic Journal
- Accession number :
- 37178788
- Full Text :
- https://doi.org/10.1109/TVT.2008.926608