A recursive algorithm is proposed for synthesizing a discrete-time periodic signal from a specified discrete-time discrete-frequency Wigner distribution by minimizing the error in the cyclic outer product. Equating the gradient of the error with respect to signal samples to zero results in a set of nonlinear simultaneous equations, which are solved using Newton-Raphson's method. A simulation example is given showing the synthesized signal over the first few iterations.

The constant modulus algorithm (CMA) is an excellent technique for blind channel equalization. A signed error version of CMA (SE-CMA) and dithered signed error version (DSE-CMA) have been proposed which afford overall computational efficiency. We propose three different error functions for faster convergence. This would be essential for communication systems, which cannot afford a high startup delay or for systems, where the channel's impulse response is rapidly fluctuating. One of these algorithms relies on the idea of a variable step size, which increases the rate of convergence.