Sciweavers

25 search results - page 1 / 5
» Tracking analysis of the constant modulus algorithm
Sort
View
ICASSP
2008
IEEE
13 years 11 months ago
Tracking analysis of the constant modulus algorithm
Recently, we proposed a model for the steady-state estimation error of real-valued constant-modulus-based algorithms as a function of the a priori error and of a term that measure...
Magno T. M. Silva, Vitor H. Nascimento
TSP
2008
69views more  TSP 2008»
13 years 4 months ago
Stochastic Stability Analysis for the Constant-Modulus Algorithm
We derive an easy-to-compute approximate bound for the range of step-sizes for which the constant-modulus algorithm (CMA) will remain stable if initialized close to a minimum of t...
Victor H. Nascimento, M. T. M. Silva
ICASSP
2008
IEEE
13 years 11 months ago
Avoiding divergence in the constant modulus algorithm
One of the most popular algorithms for blind equalization is the Constant Modulus Algorithm (CMA), due to its simplicity and low computational cost. However, if the step-size is n...
Maria D. Miranda, M. T. M. Silva, Vitor H. Nascime...
TSP
2011
152views more  TSP 2011»
12 years 11 months ago
Blind Adaptive Constrained Constant-Modulus Reduced-Rank Interference Suppression Algorithms Based on Interpolation and Switched
—This work proposes a blind adaptive reduced-rank scheme and constrained constant-modulus (CCM) adaptive algorithms for interference suppression in wireless communications system...
Rodrigo C. de Lamare, Raimundo Sampaio Neto, Marti...
TIT
1998
69views more  TIT 1998»
13 years 4 months ago
Relationships Between the Constant Modulus and Wiener Receivers
— The Godard or the constant modulus algorithm (CMA) is an effective technique for blind receiver design in communications. However, due to the complexity of the Constant Modulus...
Hanks H. Zeng, Lang Tong, C. Richard Johnson Jr.