Efficient blind MAI suppression in DS/CDMA systems by embedded constraint parallel projection techniques

Masahiro Yukawa, Renato L G Cavalcante, Isao Yamada

Research output: Contribution to journalArticle

32 Citations (Scopus)

Abstract

This paper presents two novel blind set-theoretic adaptive filtering algorithms for suppressing "Multiple Access Interference (MAT)," which is one of the central burdens in DS/CDMA systems. We naturally formulate the problem of MAI suppression as an asymptotic minimization of a sequence of cost functions under some linear constraint defined by the desired user's signature. The proposed algorithms embed the constraint into the direction of update, and thus the adaptive filter moves toward the optimal filter without stepping away from the constraint set. In addition, using parallel processors, the proposed algorithms attain excellent performance with linear computational complexity. Geometric interpretation clarifies an advantage of the proposed methods over existing methods. Simulation results demonstrate that the proposed algorithms achieve (i) much higher speed of convergence with rather better bit error rate performance than other blind methods and (ii) much higher speed of convergence than the non-blind NLMS algorithm (indeed, the speed of convergence of the proposed algorithms is comparable to the non-blind RLS algorithm).

Original languageEnglish
Pages (from-to)2062-2071
Number of pages10
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE88-A
Issue number8
DOIs
Publication statusPublished - 2005 Aug
Externally publishedYes

Fingerprint

DS-CDMA
Code division multiple access
Projection
Speed of Convergence
High Speed
Multiple Access Interference
Adaptive Filtering
Optimal Filter
Multiple access interference
Parallel Processors
Adaptive filtering
Adaptive Filter
Linear Complexity
Adaptive filters
Linear Constraints
Cost functions
Bit error rate
Error Rate
Cost Function
Computational complexity

Keywords

  • Adaptive projected subgradient method
  • Blind MAI suppression
  • DS/CDMA system
  • Linearly constrained algorithms

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Hardware and Architecture
  • Information Systems

Cite this

Efficient blind MAI suppression in DS/CDMA systems by embedded constraint parallel projection techniques. / Yukawa, Masahiro; Cavalcante, Renato L G; Yamada, Isao.

In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E88-A, No. 8, 08.2005, p. 2062-2071.

Research output: Contribution to journalArticle

@article{e1dd39caa8ac42ff8387f8052513d2bd,
title = "Efficient blind MAI suppression in DS/CDMA systems by embedded constraint parallel projection techniques",
abstract = "This paper presents two novel blind set-theoretic adaptive filtering algorithms for suppressing {"}Multiple Access Interference (MAT),{"} which is one of the central burdens in DS/CDMA systems. We naturally formulate the problem of MAI suppression as an asymptotic minimization of a sequence of cost functions under some linear constraint defined by the desired user's signature. The proposed algorithms embed the constraint into the direction of update, and thus the adaptive filter moves toward the optimal filter without stepping away from the constraint set. In addition, using parallel processors, the proposed algorithms attain excellent performance with linear computational complexity. Geometric interpretation clarifies an advantage of the proposed methods over existing methods. Simulation results demonstrate that the proposed algorithms achieve (i) much higher speed of convergence with rather better bit error rate performance than other blind methods and (ii) much higher speed of convergence than the non-blind NLMS algorithm (indeed, the speed of convergence of the proposed algorithms is comparable to the non-blind RLS algorithm).",
keywords = "Adaptive projected subgradient method, Blind MAI suppression, DS/CDMA system, Linearly constrained algorithms",
author = "Masahiro Yukawa and Cavalcante, {Renato L G} and Isao Yamada",
year = "2005",
month = "8",
doi = "10.1093/ietfec/e88-a.8.2062",
language = "English",
volume = "E88-A",
pages = "2062--2071",
journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
issn = "0916-8508",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "8",

}

TY - JOUR

T1 - Efficient blind MAI suppression in DS/CDMA systems by embedded constraint parallel projection techniques

AU - Yukawa, Masahiro

AU - Cavalcante, Renato L G

AU - Yamada, Isao

PY - 2005/8

Y1 - 2005/8

N2 - This paper presents two novel blind set-theoretic adaptive filtering algorithms for suppressing "Multiple Access Interference (MAT)," which is one of the central burdens in DS/CDMA systems. We naturally formulate the problem of MAI suppression as an asymptotic minimization of a sequence of cost functions under some linear constraint defined by the desired user's signature. The proposed algorithms embed the constraint into the direction of update, and thus the adaptive filter moves toward the optimal filter without stepping away from the constraint set. In addition, using parallel processors, the proposed algorithms attain excellent performance with linear computational complexity. Geometric interpretation clarifies an advantage of the proposed methods over existing methods. Simulation results demonstrate that the proposed algorithms achieve (i) much higher speed of convergence with rather better bit error rate performance than other blind methods and (ii) much higher speed of convergence than the non-blind NLMS algorithm (indeed, the speed of convergence of the proposed algorithms is comparable to the non-blind RLS algorithm).

AB - This paper presents two novel blind set-theoretic adaptive filtering algorithms for suppressing "Multiple Access Interference (MAT)," which is one of the central burdens in DS/CDMA systems. We naturally formulate the problem of MAI suppression as an asymptotic minimization of a sequence of cost functions under some linear constraint defined by the desired user's signature. The proposed algorithms embed the constraint into the direction of update, and thus the adaptive filter moves toward the optimal filter without stepping away from the constraint set. In addition, using parallel processors, the proposed algorithms attain excellent performance with linear computational complexity. Geometric interpretation clarifies an advantage of the proposed methods over existing methods. Simulation results demonstrate that the proposed algorithms achieve (i) much higher speed of convergence with rather better bit error rate performance than other blind methods and (ii) much higher speed of convergence than the non-blind NLMS algorithm (indeed, the speed of convergence of the proposed algorithms is comparable to the non-blind RLS algorithm).

KW - Adaptive projected subgradient method

KW - Blind MAI suppression

KW - DS/CDMA system

KW - Linearly constrained algorithms

UR - http://www.scopus.com/inward/record.url?scp=26044467957&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=26044467957&partnerID=8YFLogxK

U2 - 10.1093/ietfec/e88-a.8.2062

DO - 10.1093/ietfec/e88-a.8.2062

M3 - Article

AN - SCOPUS:26044467957

VL - E88-A

SP - 2062

EP - 2071

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

SN - 0916-8508

IS - 8

ER -