Convergence analysis on Godard's quartic (GQ) algorithm used forblind equalization is accomplished in this paper. The first main result is an explanation of the lacal behavior of the GQ algorithm around the global minimum point of the average performa...
Convergence analysis on Godard's quartic (GQ) algorithm used forblind equalization is accomplished in this paper. The first main result is an explanation of the lacal behavior of the GQ algorithm around the global minimum point of the average performance functio, from which we can determine the adaptation gain. It is show that the normalized adaptation gain of the GQ algorithm should be smaller than that of the decision directed (DD) algorithm. In addition, it is observed that the GQ algorithm converges faster than the DD equalization algorithm.