By the same authors

Blind constrained set-membership algorithms with time-varying bounds for CDMA interference suppression

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Author(s)

Department/unit(s)

Publication details

Title of host publication2006 IEEE International Conference on Acoustics, Speech, and Signal Processing, Vol IV, Processing
DatePublished - 2006
Pages617-+
Number of pages5
PublisherIEEE
Place of PublicationNEW YORK
Original languageEnglish
ISBN (Print)*************

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.

    Research areas

  • signal detection, estimation, equalization

Discover related content

Find related publications, people, projects, datasets and more using interactive charts.

View graph of relations