Paper: | SPCOM-P9.11 |
Session: | Channel Estimation and Equalization II |
Time: | Thursday, May 18, 14:00 - 16:00 |
Presentation: |
Poster
|
Topic: |
Signal Processing for Communication: Signal detection, estimation, separation and equalization |
Title: |
Blind Constrained Set-Membership Algorithms with Time-Varying Bounds for CDMA Interference Suppression |
Authors: |
Rodrigo de Lamare, Paulo Diniz, LPS/COPPE-UFRJ, Brazil |
Abstract: |
This work presents blind constrained adaptive filtering algorithms based on the set-membership concept and incorporates time-varying bounds for CDMA interference suppression. Constrained constant modulus (CCM) and constrained minimum variance (CMV) gradient type algorithms designed in accordance with the specifications of the set-membership filtering concept are proposed. Furthermore, the important issue of bound specification is addressed in a new framework that takes into account parameter estimation dependency and multi-access (MAI) and inter-symbol interference (ISI) for multiuser communications. 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. |