Performance analysis of RLS linearly constrained constant modulus algorithm for multiuser detection

Authors:
Xin Wang;Guangzeng Feng
Affiliations:
Communication Engineering Department, Nanjing University of Posts and Telecommunication, Xinmofanmalu #66, JiangSu, China;Communication Engineering Department, Nanjing University of Posts and Telecommunication, Xinmofanmalu #66, JiangSu, China
Venue:
Signal Processing
Year:
2009

Citing 6
Cited 1

Adaptive filter theory (3rd ed.)

Adaptive filter theory (3rd ed.)
Performance analysis of the linearly constrained constant modulus algorithm-based multiuser detector

IEEE Transactions on Signal Processing
Convergence and performance analysis of Godard family and multimodulus algorithms for blind equalization

IEEE Transactions on Signal Processing
Recursive least squares constant modulus algorithm for blind adaptive array

IEEE Transactions on Signal Processing
A unified approach to the steady-state and tracking analyses ofadaptive filters

IEEE Transactions on Signal Processing
Convergence analysis of the constant modulus algorithm

IEEE Transactions on Information Theory

A geometric approach to the linear modelling

CSS'11 Proceedings of the 5th WSEAS international conference on Circuits, systems and signals

Quantified Score

Hi-index	0.08

Visualization

Abstract

The linearly constrained constant modulus algorithm (LCCMA) is a blind multiuser detector (MUD) solution to multiple access interference (MAI) suppression that is widely investigated in direct-sequence code division (DS-CDMA) systems. However, the conventional CMA based on the stochastic gradient descent (SGD) has slow convergence speed. Our research introduces an approximation of recursive least square (RLS) into LCCMA for better convergence speed in DS-CDMA system and quantifies the performance of blind adaptive filter based on RLS-LCCMA in both a static and a time-varying channel. In this investigation, we derive the expressions for the excess mean-square error (EMSE) of the MUD with a framework called feedback approach, and further obtain a relationship between the step size of SGD-LCCMA and the forgetting factor of RLS-LCCMA. Eventually, simulation results show the advantage of RLS-LCCMA and verify the performance analysis of the algorithm.