Open AccessA Non‐Canonical Linearly Constrained Constant Modulus Algorithm for a Blind Multiuser Detector
Author(s) -
Jiang grui,
Kwak Kyung Sup
Publication year - 2002
Publication title -
etri journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.295
H-Index - 46
eISSN - 2233-7326
pISSN - 1225-6463
DOI - 10.4218/etrij.02.0102.0308
Subject(s) - constant (computer programming) , mathematics , noise (video) , interference (communication) , modulus , regular polygon , algorithm , simple (philosophy) , scheme (mathematics) , function (biology) , canonical form , control theory (sociology) , mathematical optimization , computer science , mathematical analysis , image (mathematics) , artificial intelligence , telecommunications , geometry , channel (broadcasting) , philosophy , control (management) , epistemology , programming language , evolutionary biology , pure mathematics , biology
We investigate an alternative blind adaptive multiuser detection scheme based on a non‐canonical linearly constrained constant modulus (LCCM) criterion and prove that, under the constrained condition, the non‐canonical linearly constrained constant modulus algorithm (LCCMA) can completely remove multiple‐access interference. We further demonstrate that the non‐canonical LCCM criterion function is strictly convex in the noise‐free state, and that under the constrained condition, it is also strictly convex even where small noise is present. We present a simple method for selecting the constant as well as a stochastic gradient algorithm for implementing our scheme. Numerical simulation results verify the scheme's efficiency.