The optimal step-size constant modulus algorithm (OS-CMA) is based on a computationally efficient iterative technique to minimize the CM cost function. This technique computes algebraically the step size (adaption coefficient) globally minimizing the CM contrast in the search direction at each iteration.
OS-CMA's optimization technique is similar to that used in RobustICA. As a result, the OS-CMA shares many advantages of RobustICA, including high convergence speed and the ability to avoid spurious local extrema.
More details about the OS-CMA and its comparative performance analysis can be found in the references below.
 V. Zarzoso et P. Comon, "Méthodes semi-aveugles pour les télécommunications", dans : C. Jutten et P. Comon, Séparation de sources 2 : au-delà de l'aveugle et applications, Paris : Hermes, 2007, chapitre 8, pp. 303-353.
 V. Zarzoso and P. Comon, "Semi-Blind
Constant Modulus Equalization with Optimal Step Size", in:
Proceedings ICASSP-2005, 30th IEEE International Conference on Acoustics, Speech and Signal Processing, Philadelphia, PA, March 18-23, 2005, Vol. III, pp. 577-580.
 V. Zarzoso and P. Comon, "Blind
Channel Equalization with Algebraic Optimal Step Size", in:
Proceedings EUSIPCO-2005, XIII European Signal Processing
Conference, Antalya, Turkey, September 4-8, 2005.
doc oscma_packagefor details about the algorithm and the different functions contained in the package.
os_cma_demoto run a simple demo.
If you use this package to generate results in your publications, please cite at least reference  above.
The OS-CMA by Vicente Zarzoso and Pierre Comon is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.