Discrete-time and continuous-time constant modulus algorithm analysis

The purpose of this study is to analyze the properties of one of the most common blind adaptive techniques, the Constant Modulus Algorithm, in a mathematical sense. In this paper, the discrete-time and continuous-time Constant Modulus Algorithm is presented. Convergence behavior of two adaptation algorithm, the steepest descent algorithm and the stochastic gradient algorithm, is discussed in both discrete-time and continuous-time cases. The stochastic gradient algorithm performance of each case is characterized and terms of steady state error. The results of computer simulations are presented. Finally, conclusions and recommendations for future research are given