Skip to Main Content
Due to the growing demand for mobile communications, blind adaptive algorithms have an important role in improving data transmission efficiency. In this context, the convergence and tracking analysis of such algorithms is a problem of interest. Recently, a tracking analysis of the Constant Modulus Algorithm was presented based on an energy conservation relation. In this letter we extend that analysis to blind quasi-Newton algorithms that minimize the Constant Modulus cost function. Under certain conditions, the considered algorithms can reach the same steady-state mean-square error. Close agreement between analytical and simulation results is shown.