AN ANALYTICAL CONSTANT MODULUS ALGORITHM

Iterative constant modulus algorithms such as Godard and CMA have been used to blindly separate a superposition of cochannel constant modulu s (CM) signals impinging on an antenna array, These algorithms have ce rtain deficiencies in the context of convergence to local minima and t he retrieval of all individual CM signals that are present in the chan nel. In this paper, we show that the underlying constant modulus facto rization problem is, in fact, a generalized eigenvalue problem, and ma y be solved via a simultaneous diagonalization of a set of matrices, W ith this new analytical approach, it is possible to detect the number of CIM signals present in the channel, and to retrieve all of them exa ctly, rejecting other, non-CM signals, Only a modest amount of samples is required, The algorithm is robust in the presence of noise and is tested on measured data collected from an experimental set-up.