2013/01/01 by Rodrigo C. de Lamare, de Lamare, Rodrigo C., Paulo S. R. Diniz +1
Computer Science · Engineering · Mathematics · #Advanced Adaptive Filtering Techniques #Advanced Wireless Communication Techniques #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Communication Networks Research #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1301.0097
7 figures; IEEE Transactions on Vehicular Technology, 2009. arXiv admin note: text overlap with arXiv:1212.6626
arxiv created 2013/01/01 · openalex publication_date 2013/01/01 · arxiv updated 2013/01/03 · openalex created_date 2022/10/04 · openalex updated_date 2026/07/28
This work presents set-membership adaptive algorithms based on time-varying error bounds for CDMA interference suppression. We introduce a modified family of set-membership adaptive algorithms for parameter estimation with time-varying error bounds. The algorithms considered include modified versions of the set-membership normalized least mean squares (SM-NLMS), the affine projection (SM-AP) and the bounding ellipsoidal adaptive constrained (BEACON) recursive least-squares technique. The important issue of error bound specification is addressed in a new framework that takes into account parameter estimation dependency, multi-access and inter-symbol interference for 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.