The recursive constant modulus algorithm; a new approach for real-time array processing

Pickholtz, R.L.; Elbarbary, Khairy A.

doi:10.1109/acssc.1993.342594

Cited by 17 publications

(16 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Results indicate that the RLS-CMA has a faster convergence rate than CMA approach. Furukawa and et al method [15] corresponds to a special case of our proposed algorithm (i.e. with b = 1), although they did not provide any specific interpretation for the RLS-CMA approach.…”

Section: Recursive Least Squares Cma (Rls-cma)mentioning

confidence: 89%

Adaptive blind equalization technique to enhance the Constant Modulus Algorithm performance

Nassar

Nahal

2010

2010 International Computer Engineering Conference (ICENCO)

View full text Add to dashboard Cite

Recently blind equalizers have a wide range of research interest since they do not require training sequence and extra bandwidth, but the main weaknesses of these approaches are their high computational complexity and slow adaptation, so different algorithms are presented to avoid this nature. This paper introduces a new blind equalization technique, the Exponentially Weighted Step-size Recursive Least Squares Constant Modulus Algorithm (EXP-RLS-CMA), based upon the combination between the Exponentially Weighted Step-size Recursive Least Squares (EXP-RLS) algorithm and the Constant Modulus Algorithm (CMA), by providing several assumptions to obtain faster convergence rate to an optimal delay where the Mean Squared Error (MSE) is minimum, and so this selected algorithm can be implemented in digital system to improve the receiver performance. Simulations are presentedto show the excellence of this technique, and the main parameters of concern to evaluate the performance are, the rate of convergence, the mean square error (MSE), and the average error versus different signal-to-noise ratios.

show abstract

Section: Recursive Least Squares Cma (Rls-cma)mentioning

confidence: 89%

Adaptive blind equalization technique to enhance the Constant Modulus Algorithm performance

Nassar

Nahal

2010

2010 International Computer Engineering Conference (ICENCO)

View full text Add to dashboard Cite

show abstract

“…Note that this optimization procedure resembles the ones used to obtain the conventional recursive least-squares algorithm [4] and recursive CMA [5]. For real time implementation the required quantities in eq.…”

Section: #1mentioning

confidence: 99%

Least-squares CMA with decorrelation for fast blind multiuser signal separation

Cavalcanti

Romano²,

Brandao³

1999

1999 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings. ICASSP99 (Cat. No.99CH36258)

View full text Add to dashboard Cite

A blind algorithm with implicit signal selectivity capability is proposed. The algorithm is an evolution of the original multiuser constant modulus algorithm of [ I ] . The new algorithm features a least-squares type updating rule for fast convergence rate and an adaptive control of the weight of the decorrelation term which improves the steady-state error variance. The expected improvements of the proposed algorithm are verified through simulations with smart antennas in a spatial-division multiple access system.

show abstract

“…The recursive constant modulus algorithm (RCMA), proposed in [32,33], provides a fast blind algorithm at the expense of an increased complexity. A least squares version of the CM cost function, expressed in Table 3, where y(i) = w T x(i) and 0 < λ ≤ 1 is the forgetting factor, is minimized using some approximation.…”

Section: A Family Of Rls Algorithmsmentioning

confidence: 99%

Decision directed adaptive blind equalization based on the constant modulus algorithm

Fernandes

Favier

Mota

2007

SIViP

View full text Add to dashboard Cite

International audienceIn this paper, new decision directed algorithms for blind equalization of communication channels are presented. These algorithms use informations about the last decided symbol to improve the performance of the constant modulus algorithm (CMA). The main proposed technique, the so called decision directed modulus algorithm (DDMA), extends the CMA to non-CM modulations. Assuming correct decisions, it is proved that the decision directed modulus (DDM) cost function has no local minima in the combined channel-equalizer system impulse response. Additionally, a relationship between the Wiener and DDM minima is established. The other proposed algorithms can be viewed as modifications of the DDMA. They are divided into two families: stochastic gradient algorithms and recursive least squares (RLS) algorithms. Simulation results allow to compare the performance of the proposed algorithms and to conclude that they outperform well-known methods

show abstract

The recursive constant modulus algorithm; a new approach for real-time array processing

Cited by 17 publications

References 5 publications

Adaptive blind equalization technique to enhance the Constant Modulus Algorithm performance

Adaptive blind equalization technique to enhance the Constant Modulus Algorithm performance

Least-squares CMA with decorrelation for fast blind multiuser signal separation

Decision directed adaptive blind equalization based on the constant modulus algorithm

Contact Info

Product

Resources

About