Experimental validation of the Kronecker product Godard blind adaptive algorithms

To overcome the analytical challenge the nonconvex Godard criterion presents, the Kronecker product operator and higher order statistical moments have been proposed as a natural framework to obtain an exact and more tractable mathematical description of the behavior of the algorithm. The authors validate these findings by working out several examples in both notations. Particular attention is given to situations of standard constant modulus adaptive algorithm misbehavior